Data Structures Algorithms MCQ (Multiple Choice Questions), Data Structures Algorithms Online Quiz

1 .

A data structure where elements can be added or removed at either end but not in the middle

A)

Deque

B)

Queues

C)

Stacks

D)

Linked lists

Correct Answer : Option (A) : Deque

2 .

Tower of hanoi is a classic example of_______

A)

divide and conquer

B)

recursive approach

C)

B but not A

D)

Both (A) & (B)

Correct Answer : Option (D) : Both (A) & (B)

Explanation : The recursive approach of tower of hanoi uses divide and conquer method.

3 .

The situation when in a linked list START=NULL is

A)

underflow

B)

overflow

C)

housefull

D)

saturated

Correct Answer : Option (A) : underflow

4 .

Which if the following is/are the levels of implementation of data structure

A)

Abstract level

B)

Application level

C)

Implementation level

D)

All of the above

Correct Answer : Option (D) : All of the above

5 .

The operation of processing each element in the list is known as

A)

Merging

B)

Traversal

C)

Sorting

D)

Inserting

Correct Answer : Option (B) : Traversal

6 .

When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

A)

FEAKDCHBG

B)

FAEKCDBHG

C)

FAEKCDHGB

D)

EAFKHDCBG

Correct Answer : Option (C) : FAEKCDHGB

7 .

When does top value of the stack changes?

A)

Before deletion

B)

After deletion

C)

At the time of deletion

D)

While checking underflow

Correct Answer : Option (B) : After deletion

8 .

Which of the following is not the type of queue?

A)

Ordinary queue

B)

Priority queue

C)

Circular queue

D)

Single ended queue

Correct Answer : Option (D) : Single ended queue

9 .

If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then

A)

we'll get the same spanning tree.

B)

spanning will have less edges.

C)

we'll get a different spanning tree.

D)

spanning will not cover all vertices.

Correct Answer : Option (A) : we'll get the same spanning tree.

Explanation : Regardless of which algorithm is used, in a graph with unique weight, resulting spanning tree will be same.

10 .

Project scheduling is an example of__________

A)

divide and conquer

B)

greedy programming

C)

dynamic programming

D)

None of the above.

Correct Answer : Option (C) : dynamic programming