Stacks And Queues

Topic Covered : Stack ADT, Implementation of stack using array and linked list, Application of Stack- Evaluation of postfix/prefix expression, Queue ADT, Implementation of queue using Array and Linked List

1. The data structure required for Breadth First Traversal on a graph is?

A) Stack

B) Array

C) Queue

D) Tree

Correct Answer: Queue

Explanation : The data structure required for Breadth First Traversal on a graph is Queue.

2. Circular Queue is also known as ________.

A) Ring Buffer

B) Square Buffer

C) Curve Buffer

D) Rectangle Buffer

Correct Answer: Ring Buffer

Related Topics

Stacks And Queues

1. The data structure required for Breadth First Traversal on a graph is?

2. Circular Queue is also known as ________.