MCQ on Data Structure with Answers

Free Data Structures and Algorithms courses with real-time projects Start Now!!

Data structures and algorithms are one of the most important parts of computer science. It tells which method is best to solve a particular computational problem. Here is a curated list of a few MCQ type questions with answers that will help you strengthen your hold on data structure.

Time limit: 0

Quiz Summary

0 of 20 Questions completed

Questions:

Information

You have already completed the quiz before. Hence you can not start it again.

Quiz is loading…

You must sign in or sign up to start the quiz.

You must first complete the following:

Results

Quiz complete. Results are being recorded.

Results

0 of 20 Questions answered correctly

Your time:

Time has elapsed

You have reached 0 of 0 point(s), (0)

Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)

Categories

Not categorized 0%

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

Current

Review / Skip

Answered

Correct

Incorrect

Question 1 of 20

1. Question

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

Finding the number of connected components

Finding the minimum spanning tree for an unweighted graph

Finding all the articulation points in a graph

Finding strongly connected components in a graph

Correct

Incorrect

Question 2 of 20

2. Question

Which of the following statements is incorrect?

2^logn = O(n)

100*n*log n = O(n log n)

3ⁿ = O(2ⁿ)

(n log n)/100 = O(n log n)

Correct

Incorrect

Question 3 of 20

3. Question

What approach does recursion follow?

Heuristic approach

Divide and conquer approach

Top-down approach

Bottom-up approach

Correct

Incorrect

Question 4 of 20

4. Question

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

O(n logn logn)

O(n)

O(n logn)

O(n²)

Correct

Incorrect

Question 5 of 20

5. Question

What is the time complexity of the following function?

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

O(1)

O(n)

O(log n)

O(n logn)

Correct

Incorrect

Question 6 of 20

6. Question

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

}

Count the total number of nodes in a binary tree

Count the internal nodes in a binary tree

Count the leaf nodes in a binary tree

None of these

Correct

Incorrect

Question 7 of 20

7. Question

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

O(log n)

O(n log n)

O(log logn)

O(n)

Correct

Incorrect

Question 8 of 20

8. Question

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

Stack

Linked list

Array

None of these

Correct

Incorrect

Question 9 of 20

9. Question

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

(k^h+1-1)/(k-1)

k^h+1-1

k-1

(k^h-1-1)/(k-1)

Correct

Incorrect

Question 10 of 20

10. Question

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?

Dividing into sub-problems

Recursively solving the subproblems

Merging the solutions

All steps are equally expensive

Correct

Incorrect

Question 11 of 20

11. Question

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

20, 30

12, 20

15, 15

30, 20

Correct

Incorrect

Question 12 of 20

12. Question

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

Hashing

Sequential search

Binary search

Depth-first search

Correct

Incorrect

Question 13 of 20

13. Question

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

O(n)

O(log n)

O(n logn)

O(log log n)

Correct

Incorrect

Question 14 of 20

14. Question

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?

3

1

6

12

Correct

Incorrect

Question 15 of 20

15. Question

What is the best case time complexity for binary search?

O(log n)

θ(log n)

O(n)

θ(n)

Correct

Incorrect

Question 16 of 20

16. Question

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

Input

Worst case

Best case

Output

Correct

Incorrect

Question 17 of 20

17. Question

What is the output of Kruskal’s algorithm?

Spanning tree

Minimum spanning tree

Maximum spanning tree

None of these

Correct

Incorrect

Question 18 of 20

18. Question

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?

n

²ⁿC_n/(n+1)

²ⁿC_n

n log n

Correct

Incorrect

Question 19 of 20

19. Question

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

O(1)

O(n)

O(log n)

O(n log n)

Correct

Incorrect

Question 20 of 20

20. Question

Which of the following is an application of stack?

Undo operation in text editors

Huffman codes

Bayesian spam filter

Interrupt handling in the operating system

Correct

Incorrect

Summary

The above quiz contains questions from complexity analysis, binary trees, data structures like stacks and queues, sorting techniques and recursion, etc. Thus, the quiz will provide a good amount of recall for these concepts.