CSD203-quiz4-queue-15m

Basic operations we can do on a queue are:

• Enqueue

• Dequeue

• Peek

• isEmpty

• Size

This way of organizing elements is called ____

Reasons to implement queues using arrays:

• Memory Efficient

• Easier to implement and understand

• Fixed size

• Shifting cost

• Alternatives

Reasons for using linked lists to implement queues:

• Dynamic size

• No shifting

• Extra memory

• Readability

Fill the (*) in line 11

Fill the (*)

Adds a new element to the queue

• 
• 
• 
• 

Removes the first (front) element from the queue

• 
• 
• 
• 

Fill in the _____________

Checks if the queue is empty

• 
• 
• 
•