Queues

Question 1

Define Queue

Answer 1

• abstract data type that holds an ordered, linear sequence of items.
• pointer for front and rear
• FIFO

Question 2

Define Priority Queue

Answer 2

• each element has a priority

- inserted ahead of those with lower priority and behind those of an equal priority.

Question 3

Operations of priority queue

Answer 3

• enqueue()
• dequeue()
• is_empty()
• is_full()

Question 4

Define Circular queue

Answer 4

• reuses empty slots at the front of the array
• wraps around as items are enqueued or dequeue
• front and rear pointers
• if front = rear, queue is empty
• if rear -1 from front, queue is full

Question 5

Applications of queues

Answer 5

• print tasks (print queue)

- tasks in order of priority