QUESTION 1

(a) Define the behaviour of the Stack ADT and Queue ADT, outlining the differences of each one. Give a real-world example of a Stack and a Queue.

(4 marks)

(b) Explain the difference between a non-circular queue and a circular queue, using diagrams to illustrate your answer.

(6 marks)

(c) Provide pseudocode for the following operations pertaining to a Queue: isfull(A), isempty(A), enqueue(A, x), dequeue(A). A is an array and x is an element. Why does each operation except enqueue(A, x) only require the single argument A?

(15 marks)