Q. The best sorting methods if number of swapping done, is the only measure of efficiency is

View solution

Q. The sorting method which sorts a set of elements that is already in order or in reverse order with equal speed is

View solution

Q. The expression which access the (ij)th entry of a m x n matrix stored in column major form is

View solution

Q. Number of possible trees with 3 nodes is

View solution

Q. Binary expression tree is traversed in ...........traversal.

View solution

Q. The value for which we are searching is called the

View solution

Q. A ................. search begins the search with the element that is located in the middle of the array.

View solution

Q. Recursion in merge sort performs

View solution

Q. The address field of linked list

View solution

Q. A circular list can be used to represent

View solution

Q. A list node representing an arc of a graph requires how many fields?

View solution

Q. Traversing a binary tree first root and then left and right sub trees is called...............traversal.

View solution

Q. A header node to represent a graph node requires how many fields?

View solution

Q. What can we say about the array representation of a circular queue, when it contain only one element?

View solution

Q. The order of binary search algorithm is

View solution

Q. The average search time of hashing with linear probing will be less if the load factor

View solution

Q. A graph in which all node are of equal degree called as

View solution

Q. A vertex of degree one is called as

View solution

Q. A simple graph with n vertices and k components can have at most

View solution

Q. Which of the following sorting procedure is the slowest?

View solution