2.3.1

Question 1

What structure are stacks?

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 does the back pointer in a queue do?

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 a queue

Answer 6

Points to the space containing the first item in the queue

Question 7

What value is the top pointer of a stack initialised as

Answer 7

-1

Question 8

Pseudocode to add an item to a stack

Answer 8

push(element)
top += 1
A[top] = element

Question 9

Pseudocode to add an item to a queue

Answer 9

enqueue(element)
A[back] = element
back += 1

Question 10

What is a procedural programming language

Answer 10

High-level language
Gives a series of instructions in a (logical)
order / line by line / what to do and how to
do it