Q. A binary tree is said to have heap property if the elements along any path:

View solution

Q. The graph K3,4 has:

View solution

Q. If (rear==maxsize-1) rear=0; else rear=rear+1; is required in:

View solution

Q. Which of the following does not define a tree?

View solution

Q. The complexity of Kruskal’s minimum spanning tree algorithm on a graph with ‘n’ nodes and ‘e’ edges is :

View solution

Q. Which of the following data structures is most efficient in terms of both space and time to reverse a string of characters?

View solution

Q. Which of the following can be the sequence of nodes examined in a binary search tree while searching for key 98?

View solution

Q. Which of the following is true for a sorted list with ‘n’ elements?

View solution

Q. Consider  a  rooted  tree  in  which  every  node  has  at  least  three  children.  What  is  the minimum number of nodes at level i (i > 0) of the tree?  Assume that the root is at level 0:

View solution

Q. Which of the following data structure is used to implement recursion?

View solution

Q. The height of a binary tree with ‘n’ nodes, in the worst case is:

View solution

Q. Given a parallel algorithm A with computation time t, if parallel algorithm A performs m computational operation, then p processors can execute algorithm A in time given by:

View solution

Q. With reference to implementation of different association mining algorithms, identify the correct statement:

View solution

Q. The maximum number of nodes in a binary tree of depth 10 is:

View solution

Q. The time required to find shortest path in a graph with n vertices and e edges is:

View solution

Q. Pre order is also known as:

View solution

Q. The equivalent post fix expression for d/(e+f) + b*c is:

View solution

Q. Which algorithm has same average, worst case and best case time?

View solution

Q. Application of data structure in queue is:

View solution

Q. The number of edges in a complete graph with N vertices is equal to:

View solution