3.1 stack and queue

Question 1

Stack abstract data type

Answer 1

push(e) – Insert element e at the top of the stack
* pop() – Remove the top element from the stack; an
error occurs if the stack is empty
* top() – Return a reference to the top element on the
stack, without removing it; an error occurs if the
stack is empty
* size() – Return the number of elements in the stack
* empty() – Return true if the stack is empty and false
otherwise

Question 1

LIFO (last-in first-out)

Answer 1

stack

Question 2

Queues

Answer 2

FIFO (First in First out)

Question 3

Queue Abstract data type

Answer 3

enqueue(e): Insert element e at the rear of the queue
* dequeue(): Remove element at the front of the
queue; an error occurs if the queue is empty
* front(): Return, but do not remove, a reference to the
front element in the queue; an error occurs if the
queue is empty
* size(): Return the number of elements in the queue
* empty(): Return true if the queue is empty and false
otherwise

Question 4

STL queue

Answer 4

size(): Return the number of elements in the queue
* empty(): Return true if the queue is empty and false
otherwise
* push(e): Enqueue e at the rear of the queue
* pop(): Dequeue the element at the front of the
queue
* front(): Return a reference to the element of the
queue’s front
* back(): Return a reference to the element at the
queue’s rear