DSA Day 3

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as _____________

• Queue

• Stack

• tree

• Linked List

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

• Stack

• Queue

• tree

• Array

A queue follows __________

• FIFO (First In First Out) principle

• LIFO (Last In First Out) principle

• Ordered array

• Linear tree

Circular Queue is also known as ________

• Ring Buffer

• Square Buffer

• Rectangle Buffer

• Curve Buffer

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• ABCD

• DCBA

• DCAB

• ABDC

A data structure in which elements can be inserted or deleted at/from both ends but not in the middle is?

• Queue

• Circular queue

• Dequeue

• Priority queue

A normal queue, if implemented using an array of size MAX_SIZE, gets full when?

• Rear = MAX_SIZE – 1

• Front = (rear + 1)mod MAX_SIZE

• Front = rear + 1

• Rear = front

Queues serve major role in ______________

• Simulation of recursion

• Simulation of arbitrary linked list

• Simulation of limited resource allocation

• Simulation of heap sort

Which of the following is not the type of queue?

• Ordinary queue

• Single ended queue

• Circular queue

• Priority queue