Queue

Question 1

What is a queue?

Answer 1

A data structure that follows the First-In, First-Out (FIFO) principle, where the element that enters first is the one that gets accessed first

Question 2

What are the two main operations of a queue?

Answer 2

Enqueue (add), Dequeue (remove)

Question 3

What is a deque (double ended queue)?

Answer 3

A queue where elements can be added or removed from both ends of the queue

Question 4

What is a circular queue?

Answer 4

A queue where the last position is connected back to the first position, forming a circle

Question 5

What is a priority queue?

Answer 5

A queue where each element has a priority, and elements with higher priority are dequeued before elements with lower priority. It can be implemented using heaps

Question 6

What is an affinity queue?

Answer 6

A queue where every element has an affinity and is placed with an element having the same affinity; otherwise placed at the rear

Question 7

What is the time complexity of queue operations (enqueue, dequeue, peak, isEmpty)?

Answer 7

O(1)

Question 8

Queues can have queue overflow and queue underflow