MCQ on Data Structures and Algorithms

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

Here comes MCQ quiz on data structures and algorithms. The quiz contains questions having a problem statement and 4 choices out of which only one is correct.

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

Dynamic programming does not work if the subproblems:

Overlap

Cannot be divided into half

Have to be divided too many times to fit in the memory

Share resources and thus are not independent

Correct

Incorrect

Question 2 of 20

2. Question

What is the time complexity of Strassen’s multiplication algorithm using the Divide and conquer approach?

O(n^{log 5})

O(n^{log 6})

O(n^{log 7})

None of these

Correct

Incorrect

Question 3 of 20

3. Question

What is the time complexity of the following code?

for(int i=1; i<=n; i++){

for(j=1; j<=i; j++)

printf(“This is a dependent for loop”);

}

O(n)

O(n²)

O(log n)

O(n log n)

Correct

Incorrect

Question 4 of 20

4. Question

What will be the time complexity to find the greatest element in a max-heap?

O(1)

O(n)

O(log n)

O(n log n)

Correct

Incorrect

Question 5 of 20

5. Question

Which of the following is the most appropriate definition of a bi-connected graph?

A graph containing no parallel edges

A graph having two or more non-empty components

A graph having no articulation point

None of these

Correct

Incorrect

Question 6 of 20

6. Question

Which of the following is an application of a deque?

To find the maximum of all sub-arrays of size k

To avoid collision in a hash table

Steal job scheduling algorithm

Can be used as both stack and queue

Correct

Incorrect

Question 7 of 20

7. Question

The partition algorithm of quicksort divides the input elements into the ratio of 1:999. What is the time complexity of the algorithm?

O(1)

O(n)

O(log n)

O(n log n)

Correct

Incorrect

Question 8 of 20

8. Question

What is the time complexity of insertion operation in a priority queue?

O(n²)

O(n log n)

O(n)

O(log n)

Correct

Incorrect

Question 9 of 20

9. Question

Which of the following algorithm always gives correct results for negative edges weights as well?

Prim’s algorithm

Kruskal’s algorithm

Dijkstra’s algorithm

All of the above

Correct

Incorrect

Question 10 of 20

10. Question

Which of the following statement is false with respect to the divide and conquer strategy?

We can divide the actual problem into any number of sub-problems

The size of each sub-problem is always the same

The combine step is not mandatory in all the problems following divide and conquer.

Both (B) and (C)

Correct

Incorrect

Question 11 of 20

11. Question

We can solve an N-queens problem using:

Dynamic programming

Divide and conquer technique

Greedy technique

backtracking

Correct

Incorrect

Question 12 of 20

12. Question

Huffman encoding and decoding is an application of:

Minimum spanning tree

Binary tree

Binary search tree

Tree traversal

Correct

Incorrect

Question 13 of 20

13. Question

What is the best case time complexity for the quicksort algorithm?

O(n logn)

O( log n)

O(n² logn)

O( log n²)

Correct

Incorrect

Question 14 of 20

14. Question

What is the advantage of finding the max and min element in an array by the divide and conquer technique?

Simpler calculations

Reduced time complexity

Reduced space complexity

No particular benefit

Correct

Incorrect

Question 15 of 20

15. Question

Dynamic programming divides the problems into a number of:

Objective functions

Decision stages

Unrelated constraints

None of these

Correct

Incorrect

Question 16 of 20

16. Question

Which of the following is a method to construct the binary heap data structure?

Inserting keys one after the other

Converting array representation of binary tree into a heap

Both (A) and (B)

Neither (A) nor (B)

Correct

Incorrect

Question 17 of 20

17. Question

How many different types of insertion can we perform on a Binary tree?

1

2

3

4

Correct

Incorrect

Question 18 of 20

18. Question

A connected acyclic graph is also known as:

A free tree

A tree graph

A binary tree

None of these

Correct

Incorrect

Question 19 of 20

19. Question

We can access the elements of an array:

Sequentially

Hierarchically

Randomly

None of these

Correct

Incorrect

Question 20 of 20

20. Question

What will be the output if we reverse the string “PQPPRSQ” using a stack?

PQPPRSQ

PSRQQPP

QSRPPQP

QSPPRPQ

Correct

Incorrect

Summary

As we all know, the data structures and algorithms comprise a major weightage in academics as well as interviews. Therefore, this quiz has been designed in such a way that it gives a quick revision of all the important topics. Hope you find it useful.