Data Structures Algorithms - Quiz(MCQ)
A)
Deque
B)
Queues
C)
Stacks
D)

Correct Answer : Option (A) :   Deque

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.

A)
underflow
B)
overflow
C)
housefull
D)
saturated

Correct Answer : Option (A) :   underflow

A)
Abstract level
B)
Application level
C)
Implementation level
D)
All of the above

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

A)
Merging
B)
Traversal
C)
Sorting
D)
Inserting

Correct Answer : Option (B) :   Traversal

A)
FEAKDCHBG
B)
FAEKCDBHG
C)
FAEKCDHGB
D)
EAFKHDCBG

Correct Answer : Option (C) :   FAEKCDHGB

A)
Before deletion
B)
After deletion
C)
At the time of deletion
D)
While checking underflow

Correct Answer : Option (B) :   After deletion

A)
Ordinary queue
B)
Priority queue
C)
Circular queue
D)
Single ended queue

Correct Answer : Option (D) :   Single ended queue

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.

A)
divide and conquer
B)
greedy programming
C)
dynamic programming
D)
None of the above.

Correct Answer : Option (C) :   dynamic programming