MCQ on Data Structure with Answers

1. Which of the following is not an application of Depth-first search?

Which of the following statements is incorrect?

 What approach does recursion follow?

 Assuming that the time complexity of the partition procedure is n log n, what is the time complexity of quicksort in the best case?

What is the time complexity of the following function?

f(n) = n logn + 10n + 4

What does the following code do with respect to binary trees?

int fun(struct node* ptr)

{

    if(ptr == NULL)

        return 0;

    if(ptr->left == NULL && ptr->right == NULL)

        return 1;

    return fun(ptr->left)+fun(ptr->right);    

}

What is the average case complexity to find the height of quicksort? 

The element which is inserted first will be removed first in:

What is the maximum number of nodes in a k-ary tree of height ‘h’?

Merge sort is based on the divide and conquer technique i.e. it completes in 3 steps- divides into subproblems, recursively solves and then merge. Which of these three steps is the most expensive in the merge sort?

Which of the following is an example of inversion pair with respect to insertion sort?

For which of the following techniques, all the search keys have to be present in the main memory?

What is the space complexity to search for an element inside a heap?

Given A, B and C are the three nodes present in a tree. What is the number of binary trees possible if the preorder is ABC and the inorder is BAC?

 What is the best case time complexity for binary search?

Which of the following is not a criterion for the analysis of an algorithm?

What is the output of Kruskal’s algorithm?

If n denotes the number of nodes a binary tree has, what is the royal number of unlabelled binary trees possible with the ‘n’ number of nodes?

What is the order of the height of a complete binary tree?

 Which of the following is an application of stack?