Pseudocode
1. Enqueue(value):
2. if queue is full:
3. report Overflow error
4. else:
5. add value to rear of queue
6. update rear pointer
1. Dequeue():
2. if queue is empty:
3. report Underflow error
4. else:
5. get value from front of queue
6. remove value from front
7. update front pointer
8. return value
1. Peek():
2. if queue is empty:
3. report Underflow error
4. else:
5. return value from front
1. GetSize():
2. // ADTs often track size internally
3. return queue.length