Stacks And Queues

Question 1

Are stacks FIFO or FILO?

Answer 1

FILO

Question 2

Which function adds an item to a stack?

Answer 2

Push

Question 3

Which function removes an element from a stack?

Answer 3

Pop

Question 4

What is the significance of the back pointer in the array representation of a queue?

Answer 4

Holds the location of the next available space in the queue

Question 5

Which function returns the item at the front of a queue without removing it?

Answer 5

Peek

Question 6

What is the purpose of the front pointer in the array representation of a queue?

Answer 6

Points to the space containing the first item in the queue

Question 7

What value is the top pointer initialised to in the array representation of a stack?

Answer 7

-1

Question 8

Give pseudocode for the function which adds new elements to stacks.

Answer 8

Stacks: pushelement; top = top + 1

Question 9

Give pseudocode for the function which adds new elements to queues.

Answer 9

Queues: enqueueelement; back = back + 1

Question 10

Which function returns the item at the top of a stack without removing it?

Answer 10

Peek