Queues Closure – Discussion

  1. Queues have a head an a tail, also called a front and an end.
  2. Queue operations are add, remove and peek . add and remove are also referred to as enqueue and dequeue.
  3. When a queue is implemented with an array, what are the values of the head and tail at initialization?
  4. The head and tail are updated during queue operations. During which operations are the following indices updated?
    (a) head
    (b) tail
  5. Explain what is meant by the acronym FIFO.

© 2020  Vedesh Kungebeharry. All rights reserved. 

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s