Lab 11

For this lab you will be writing the operations for an array based queue. The class ArrayBasedQueue will have a statically sized template array, and three integer member variables front, back, count. The class will also contain a default constructor, and queue based operations described below which you will write for this lab. Main is given to you and the class definition. Memorize the acronym FIFO for the upcoming midterm and that this behavior applies to the data structure Queue.

lab11.cpp

• bool enqueue(const T& elem)

  if the queue is not full
    assign queue index back to the passed elem
    update back
    increment count
    return true
  otherwise
    return false
  

• T dequeue()

  create a T element and assign it 0
  if the queue is not empty
    assign elem the value of queue index front 
    update front
    decrement count
  endif
  return elem
  

• bool isEmpty() const

  if front is equal to back, return true
  otherwise return false
  

• bool isFull() const

  if front is equal to back+1 mod capacity, return true
  otherwise return false
  

• T peekFront() const

  if queue is not empty, return the value at queue index front
  otherwise return 0
  

Show me your completed code in class or have the file lab11.cpp within your depository directory ~/2020/wk11/