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

Q. The recurrence relation T(n) = mT(n/2) + an² is satisfied by

View solution

Q. The terminal vertices of a path are of degree

View solution

Q. A circuit in a connected graph which includes vertex of the graph is known as

View solution

Q. Let X is the adjacency matrix of a graph a with no self-loops. The entries along type principle diagonal of X are

View solution

Q. Which of the following is similar to direct files?

View solution

Q. Which of the following are not file Organization?

View solution

Q. A Linear Collection Of Data Elements Where The Linear Node Is Given By Means Of Pointer Is Called _________

View solution

Q. The processing of accessing data stored in a tape is similar to manipulating data on a

View solution

Q. Which of the following is true for binary search tree?

View solution

Q. Which of the following is true for walk in a graph

View solution

Q. The number of comparison required in heap sort under worst case is

View solution