A one dimensional array A has indices 1...75. Each element is a string and takes up three memory words. The array is stored starting at location 1120 decimal. The starting address of A[49] is:

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 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)

A member function that is declared ________ may not access any non-static data members in the class

A heuristic is a(n) ____.

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?