Data Structure MCQ Online Test

Data Flair

3 years ago

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

Welcome to online MCQ Test on data structure and algorithm. This quiz contains 20 questions based on data structures and algorithms and covers almost all the topics for your revision. Let’s start!!!

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

Suppose a binary search tree has the inorder traversal as: 10, 20, 30, 40, 50, 60, 70. What is the output of the following code segment?

void traverse(struct node* ptr){

    if(ptr){

        cout << ptr->data;

        traverse(ptr->right);

        traverse(ptr->left);

    }

}

10, 30, 70, 60, 20, 50, 40

40, 10, 20, 50, 30, 60, 70

40, 20, 50, 10, 60, 30, 70

40, 50, 20, 60, 70, 30, 10

Correct

Incorrect

Question 2 of 20

2. Question

Which of the following statement is false for a bubble sort?

The number of comparisons in the best case is O(n²).

The number of comparisons in the worst case is O(n³).

The number of swap operations in the best case is O(1).

The number of swap operations in the worst case is O(n²).

Correct

Incorrect

Question 3 of 20

3. Question

Which of the following methods is best suitable to solve a fractional knapsack problem?

Dynamic programming

Backtracking

Greedy approach

Divide and conquer

Correct

Incorrect

Question 4 of 20

4. Question

Which of the following is not an application of dynamic programming?

Job sequencing with deadlines

Finding the longest common subsequence

Matrix chain multiplication

Ballman ford’s algorithm

Correct

Incorrect

Question 5 of 20

5. Question

Which of the following statements is false with respect to Depth-first search?

When we reach a node, we call it a visit

Exploring means processing every child of the node

Discovery is said to occur when we visit the node for the first time

None of these

Correct

Incorrect

Question 6 of 20

6. Question

Consider an empty stack. The order of performing the operations is: push(21), push(52), push(16), pop(), pop(), push(25), push(22), push(60), pop(), pop(), push(15), pop().

Which values are finally present in the stack after performing these operations?

21, 25, 22, 15

21, 52, 16

21, 25

25, 21

Correct

Incorrect

Question 7 of 20

7. Question

What is Karatsuba’s algorithm used for?

Finding the maximum and minimum element in an array

For long integer multiplication

For matrix multiplication

For performing binary search more efficiently

Correct

Incorrect

Question 8 of 20

8. Question

Which of the following operations in a stack can be implemented only during actual implementation and not as an abstract data type? An unordered list contains n distinct elements.

push()

pop()

isFull()

isEmpty()

Correct

Incorrect

Question 9 of 20

9. Question

What does the following code depict?

#define Size 5 //Maximum possible size of a stack

struct stack{

    int data[SIZE];

    int TOP;

}

void fun(){

    if(ptr -> TOP == SIZE-1)

        return;

}

Overflow

Underflow

Enqueue

Dequeue

Correct

Incorrect

Question 10 of 20

10. Question

What is the minimum number of nodes in a complete binary tree of height ‘h’?

2^h+1-1

2^h+1

2^h-1

2^h

Correct

Incorrect

Question 11 of 20

11. Question

How many binary trees are possible if the preorder of the binary tree is ‘ABC’

36

30

48

60

Correct

Incorrect

Question 12 of 20

12. Question

Which of the following combinations does not produce a unique binary tree?

Inorder + preorder

Postorder + inorder

Preorder + postorder

None of the above

Correct

Incorrect

Question 13 of 20

13. Question

What is the worst-case complexity of the following code?

for(i=1; i<=n; i=i*2){

    for(j=1; j<=n; j=j*2)

        cout << “Hello world”;

}

O((log₂ n)²)

O(log₂ n)

O(n)

O(n²)

Correct

Incorrect

Question 14 of 20

14. Question

How many min-heaps can we construct using 5 distinct keys?

5

10

8

12

Correct

Incorrect

Question 15 of 20

15. Question

Let V denote the vertices in a graph and E denote the edges in a graph. What is the time complexity for Bellman Ford’s algorithm?

O(VE)

O(E)

O(V)

O(VE2)

Correct

Incorrect

Question 16 of 20

16. Question

Which of the following statement is false with respect to Dijkstra’s algorithm?

It always works for positive weights

It may or may not work for negative weights

It always works correctly for negative edge weights

It never gives correct results for negative weights

Correct

Incorrect

Question 17 of 20

17. Question

What time does it take to delete an element from a binary heap?

O(log n)

O(n)

O(n log n)

O(n²)

Correct

Incorrect

Question 18 of 20

18. Question

Which of the following statements is true?

The space complexity of quicksort is O(n)

The worst-case time complexity of quicksort is O(n)

Merge sort is an in-place sorting algorithm

The space complexity of merge sort is O(n)

Correct

Incorrect

Question 19 of 20

19. Question

In which case, the complexity is much more difficult to analyze?

Best case

Worst case

Average case

The analysis is the same in all cases

Correct

Incorrect

Question 20 of 20

20. Question

Which of the following is not an application of divide and conquer?

Binary search

0/1 knapsack problem

Strassen’s matrix multiplication

Long integer multiplication

Correct

Incorrect

Summary

This was online test based on data structure and algorithm containing 20 MCQ questions. Covering MCQs is very important from the aspect of clearing written interview rounds for many IT companies. Hope this collection of questions helped you a lot.