title: Pseudo-code for dequeue
body: <p><em>A queue is to be held in a linear array called Q with number of elements = limit (numbered 0 to limit-1). The oldest element of the queue is to be held in array element 0 (at the front), the next in array element 1, and so on. A variable back stores the index of the array element containing the newest element in the queue (or -1 for an empty queue).</em>   </p>
  
  <h2>How do i write 'size' operation (in pseudo-code)?</h2>
  
  <p>** </p>