Quicksort is run on two inputs shown below to sort them in the ascending order. i) 1,2,3,...n ii) n,n-1,n-2,...2,1 If C1 and C2 be the number of comparisons made for the inputs (i) and (ii) respectively, then

What kind of list is the best to answer questions such as "Which is the item at position n?"

The breadth-first traversal (BFS) is a method to traverse______

Let A be a sorted array of n=10 elements. Assume that only one comparison is required to determine whether the target is equal to, less than, or greater than A[i]. Which of the following denotes the average successful time of finding an arbitrary element x in A using the binary search?

Which of the following tree traversal techniques reads the root before its children nodes?

Which of the following operations is more expensive in the array implementation of the linked list than it is in the dynamically created linked list?

Which of the following operations in the simple linked list will modify the beginning of the linked list?

A matrix is called sparse when______

Which of the following data structures has a balanced condition?

A given connected graph G is a Euler graph if and only if all vertices of G are of ______.

What is the meaning of the statement: "Entries in a stack are 'ordered'"?