MCQ Questions on Data Structures

Data Flair

3 years ago

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

A lot of engineering students find the concepts of data structures and algorithms quite challenging. To make things easier for the students, here is a small initiative in the form of MCQ quiz questions on Data Structures which will help the students practice the concepts and gain confidence over the subject.

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

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

k

kh+1

kh-1

kh

Correct

Incorrect

Question 2 of 20

2. Question

Which of the following statements with respect to complexity analysis is true?

n = O(log n)

n log n = O(100 log n)

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

None of these

Correct

Incorrect

Question 3 of 20

3. Question

What is the replacement of x in step 1 of the topological sort algorithm?

Algorithm TSort{

    step1: x;

    step2: Arrange the nodes in the descending order of finish time;

}

Apply level order traversal

Apply breadth-first search(BFS)

Apply depth-first search(DFS)

None of these

Correct

Incorrect

Question 4 of 20

4. Question

Which of the following is false with respect to an AVL tree?

It fulfils all the properties of a binary search tree.

AVL tree property is related to the structure of the tree.

While inserting values into an AVL tree, we need not balance the height at every step.

Height is balanced by means of various kinds of rotations.

Correct

Incorrect

Question 5 of 20

5. Question

What does the following function do?

void fun(struct node* START){

    if(START == NULL)

        return;

    fun(START->link);

    cout << START->data;

}

Prints all the nodes of the linked list

Prints all the nodes of the list in reverse order

Prints alternative nodes of the linked list

Prints alternative nodes of the list in reverse order

Correct

Incorrect

Question 6 of 20

6. Question

What is the time complexity of a graph if we represent it using an adjacency matrix?

O(1)

O(n)

O(n²)

O(n log n)

Correct

Incorrect

Question 7 of 20

7. Question

Which of the following statements is false?

If we implement the queue with a linked list, keeping track of the front pointer, only the rear pointer ‘s’ will change during an insertion into a non-empty queue.

We can make use of queue data structure to implement quicksort algorithm but not the least recently used(LRU) page fault algorithm.

Both (A) and (B).

Neither (A) nor (B)

Correct

Incorrect

Question 8 of 20

8. Question

Which of the following is not an m-way search tree?

Binary search tree

B-tree

B+-tree

None of these

Correct

Incorrect

Question 9 of 20

9. Question

Why shouldn’t we represent a binary tree using an array?

Because arrays provide cache friendliness

Because the space complexity of binary trees becomes O(2ⁿ) if we use arrays

Because we can access elements randomly in an array

None of these

Correct

Incorrect

Question 10 of 20

10. Question

Which of the following is true with respect to expression trees?

Non-leaf nodes always denote an operator in an expression tree

Leaf nodes are always variables or constants.

Both (A) and (B)

Neither (A) nor (B)

Correct

Incorrect

Question 11 of 20

11. Question

If F denotes the front, R denotes the rear and SIZE denotes the maximum possible size of a circular queue, which of the following is the correct function depicting that the circular queue is full?

R = (F+1)modSIZE

R = F mod SIZE

F = (R+1) mod SIZE

F = R mod SIZE

Correct

Incorrect

Question 12 of 20

12. Question

Let f1=n! And let f2=2ⁿ. Which of the following statement is correct with respect to f1 and f2?

f2 = O(f1)

f1 = O(f2)

Both (A) and (B)

Neither (A) nor (B)

Correct

Incorrect

Question 13 of 20

13. Question

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

O(EV)

O(E logE)

O(E logV)

O(E)

Correct

Incorrect

Question 14 of 20

14. Question

Which of the following statements is false with respect to a multi-stage graph?

A multi-stage graph is a directed graph

A multi-stage graph is an L-staged graph

In a multi-stage graph, the first and the last stage contain only 1 vertex.

None of these

Correct

Incorrect

Question 15 of 20

15. Question

What is the best case time complexity in the case of modified bubble sort?

Ω(1)

Ω(log n)

Ω(n)

Ω(n log n)

Correct

Incorrect

Question 16 of 20

16. Question

We need to create a list dynamically, where the search operation is of the order O(1). The user does not care about any statistical operations like finding max, min or medium. Which is the best data structure for such a case?

Array

Stack

Queue

Linked list

Correct

Incorrect

Question 17 of 20

17. Question

What is the total number of stack permutations possible for ‘n’ elements?

n!

C(2n,n)/(n+1)

2n-1

2n+3

Correct

Incorrect

Question 18 of 20

18. Question

Which of the following statements is false?

A complete binary tree with ‘n’ internal nodes has (n+1) leaf nodes.

A tree with n nodes has (n-1) edges.

The maximum number of nodes in a binary tree of height ‘h’ is 2^h+1-1.

If we have the preorder and post-order of a tree, we cannot construct a labelled rooted binary tree.

Correct

Incorrect

Question 19 of 20

19. Question

Traversal of a graph is different from a tree because

DFS of a graph makes use of the stack, but the inorder traversal of a tree is recursive.

BFS of a graph makes use of the queue, whereas a time-efficient BFS of a tree is recursive.

A graph may contain loops, so we need to maintain a visited flag for each node in a loop

All of the above

Correct

Incorrect

Question 20 of 20

20. Question

What is the time complexity of the optimised matrix multiplication also known as Strassen’s multiplication method?

O(n^2.81)

O(n^3.36)

O(n^1.25)

O(n^2.56)

Correct

Incorrect

Summary

Here we complete the quiz. The above quiz has MCQ type questions covering the important concepts of data structures and algorithms. This quiz will prove to be really helpful for the students who wish to test their knowledge and understanding of data structures and algorithms.