- Queues have a head an a tail, also called a front and an end.
- Queue operations are add, remove and peek . add and remove are also referred to as enqueue and dequeue.
- When a queue is implemented with an array, what are the values of the head and tail at initialization?
- The head and tail are updated during queue operations. During which operations are the following indices updated?
- Explain what is meant by the acronym FIFO.
© 2020 Vedesh Kungebeharry. All rights reserved.