2.3.2 Algorithms for Main Data Structures

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 functions removes an element from a stack?

Answer 3

Pop

Question 4

Which function adds an element to a queue?

Answer 4

Enqueue

Question 5

Which function removes an element from a queue?

Answer 5

Dequeue

Question 6

What is the purpose of a back pointer in a queue?

Answer 6

Holds the location of the next available space

Question 7

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

Answer 7

Peek

Question 8

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

Answer 8

Points to space containing the first item

Question 9

What value is the top pointer initiliased to in a stack?

Answer 9

-1

Question 10

Give pseudocode for the function adding new elements to a stack.

Answer 10

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

Question 11

Give pseudocode for the function adding new elements to a queue.

Answer 11

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

Question 12

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

Answer 12

Peek