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 operations require linear time for their worst-case behavior in the linked-list version of a queue?

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 elements? (Pick the nearest answer)

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 points is/are true about Linked List data structure when it is compared with array

Assume that reference of head of following doubly linked list is passed to above function 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6. What should be the modified linked list after the function call?

Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

The time required to search an element in a linked list of length n is

Which of the following operations is performed more efficiently by doubly linked list than by linear linked list?