Do you know that? **74% like freelancing because of being my owm boss** next

**Contact Email: teammmrem@yahoo.com**

<< All Upwork (oDesk) and Elance Tests << Test answers for Upwork (oDesk) Data Structures Test 2016 - Databases

See all updated test answers above. Answered and not answered tests questions.

**This helps getting job:** Hundreds of (cover letter examples , interview questions , profile samples ) • Earn on Upwork (oDesk) **Job assistance:** jobs popularity • freelance rates

Find Upwork (oDesk) and Elance test answers on this website:

- Which graph traversal algorithm uses a queue to keep track of the vertices which need to be processe...
- A simple graph with n vertices and k components can have at the most _______.
- What is the minimum number of edges which must be removed from a complete bipartite graph of six nod...
- Which feature of heaps allows them to be efficiently implemented using a partially filled array?
- What happens if you make a recursive call without making the problem smaller?
- Tree algorithms typically run in time O(d) . What is d?
- Here is a code for an integer variable n while (n > 0) { n = n/10; // Us...
- Suppose we have a circular array implementation of a queue, with ten items in the queue stored at da...
- Which of the following sorting algorithms yield approximately the same worst-case and average-case r...
- The operation for adding an entry to a stack is traditionally called ________.
- For a complete binary tree with depth d, the total number of nodes is:
- Which of the following is false?
- Which of the following applications may use a stack?
- What is the value of the post-fix expression 6 3 2 4 + - *?
- The minimum number of interchanges needed to convert the array 89,19,14,40,17,12,10,2,5,7,11,6,9,70 ...
- Suppose T is a complete binary tree with 14 nodes. What would be the minimum possible depth of T?
- In which data structure do the insertion and deletion take place at the same end?
- What is the formulae to find maximum number of nodes n in a perfect binary tree?
- A chained hash table has an array size of 512. What is the maximum number of entries that can be pla...
- In which dynamically created linked list can the first node be recovered after moving to the second ...
- What is the best definition of a collision in a hash table?
- What is the pre-order traversal equivalent of the following algebraic expression? [a+(b-c)]*[(d-e)/...
- A sparse matrix can be a lower-triangular matrix when____.
- A graph in which all nodes are of an equal degree is known as:
- What is the maximum number of statements that may be recursive calls in a single function declaratio...
- Which additional requirement is placed on an array so that binary search may be used to locate an en...
- What is the worst-case scenario for heapsort to sort an array of n elements?
- The recurrence relation T(n)=mT(n/2)+an2 is satisfied by___
- If 'data' is a circular array of CAPACITY elements and 'last' is an index in that ar...
- Consider the node of a complete binary tree whose value is stored in data[i] for an array implementa...
- In a complete binary tree, the parent of any node k can be determined by ________.
- Consider a linked list of n elements which is pointed by an external pointer. What is the time taken...
- Suppose X is a B-tree leaf containing 41 entries and has at least one sibling. Which of the statemen...
- In a complete binary tree of n nodes, how far are the most distant two nodes? Assume each in the pat...
- In a graph G, F is a spanning forest of G if (i)F is a subgraph of G containing all the nodes of G ...
- Which information is not saved in the activation record when a function call is executed?
- The linked list implementation of sparse matrices is superior to the generalized dope vector method ...
- Which situation occurs frequently if the selected hash function is poor?
- The post-order traversal of a binary tree starts with:
- One difference between a queue and a stack is:
- What is the minimum number of nodes in a full binary tree with depth 3?
- Using which traversal in a sorted binary insertion tree can a sorted array of numbers be obtained?
- Where does the push member function place the new entry on the linked list in the linked list implem...
- Which term is used to describe an O(n) algorithm?
- What is the minimum number of nodes in a complete binary tree with depth 3?
- What is true of the complete bipartite graphs K(3,3) and K(2,4)?
- If X is the adjacency matrix of a graph G with no self loops, the entries along the principle diagon...
- Consider a linked list implementation of a queue with two pointers: front and rear. The time needed ...
- What is the worst-case scenario for mergesort to sort an array of n elements?
- Consider a hashing function that resolves collision by quadratic probing. Assume that the address sp...
- In which data structure is the concept of rotation used?
- You have implemented a queue with a circular array keeping track of the first, the last, and the cou...
- A procedure that calls itself in a program is called _______.
- State whether True or False. For all possible inputs, a linear algorithm to solve a problem must pe...
- If a max heap is implemented using a partially filled array called data, and the array contains n el...
- What is the worst-case scenario for quicksort to sort an array of n elements?
- Which of the following lines of the code will delete two successive nodes of a single linked linear ...
- A non- planar graph with the minimum number of vertices has:
- A circuit which is a connected graph and which includes every vertex of the graph is known as_____.
- A one dimensional array A has indices 1...75. Each element is a string and takes up three memory wor...
- A simple graph in which there exists an edge between every pair of vertices is called a/an _________...
- Let A be a sorted array of n=10 elements. Assume that only one comparison is required to determine w...
- Which operations require linear time for their worst-case behavior in the linked-list version of a q...
- Which of the following statements about binary trees is false?
- How many real links are required for a sparse matrix having 10 rows, 10 columns and 15 non-zero elem...
- In a graph G having the cut set matrix C(G) and an incidence matrix A(G), the rank of C(G) would be_...
- Which of the operations is simpler in the doubly linked list than it is in the simple linked list?
- Which of the following formulae in big-Oh notation best represents the expression n2+35n+6?
- The operation for removing an entry from a stack is traditionally called _______.
- Which queue allows insertion and deletion at both ends?
- What kind of initialization needs to be done for a chained hash table?
- The number of nodes in the largest maximal independent set of the complete bipartite graph K(4,2) is...
- Which of the following techniques is used to resolve collision in hashing?
- You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer....
- Which of the following operations is performed more efficiently by the doubly linked list than by th...
- Four characters are placed in a queue in the following order: D, C, B, and A. If they are removed on...
- What is the meaning of the statement: "Entries in a stack are 'ordered'"?
- A given connected graph G is a Euler graph if and only if all vertices of G are of ______.
- Which of the following data structures has a balanced condition?
- A matrix is called sparse when______
- Which of the following operations in the simple linked list will modify the beginning of the linked ...
- You have implemented a queue with a circular array keeping track of the first item, the last item, a...
- What is the worst-case scenario for the binary search for finding a single item in an array?
- A binary tree, all the levels of which except possibly the last have the maximum number of nodes and...
- What is the pre-order traversal equivalent of the following algebraic expression? [a+(b-c)]*[(d-e)/...
- In the linked representation of a sparse matrix, the head node for a column list stores_____
- The hashing function which dynamically adapts to changes in the table being accessed is called _____...
- What will happen if in data structure a pop operation on the stack causes the stack pointer to move ...
- If h is the depth of the tree, which formula will be used to find the maximum number of nodes n in a...
- What is the minimum number of edges and vertices possible in a non- planar graph?
- Which of the following is the worst-case scenario for operations on heaps?
- Which of these are standard operations of Stack Data Structure?
- Suppose we have a circular array implementation of a queue, with ten items in the queue stored at da...
- A binary search tree is generated by inserting the following integers in the order: 50,15,62,5,20,58...
- What is the worst-case scenario for the binary search for finding a single item in an sorted array?
- What is the maximum depth of recursive calls a function may make?
- Consider this binary search tree. Which will be the new root if you remove the root and replace it ...
- The number of distinct simple graphs with up to three nodes is _______.
- In a selection sort algorithm, the number of passes required to perform the sort are ______.
- You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer....
- Which formula is the best approximation for the depth of a heap with n nodes?
- What do we call a binary tree in which all the levels, except possibly the last level, have the maxi...
- Which of the following operations is more expensive in the dynamically created linked list than it i...