DSA day 4

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

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

Queues serve major role in ______________

• Simulation of recursion

• Simulation of arbitrary linked list

• Simulation of limited resource allocation

• Simulation of heap sort

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

• Rear = front

• Front = (rear + 1)mod MAX_SIZE

• Rear = MAX_SIZE – 1

• Front = rear + 1