CS2400 M6

Question 1

Queue vs stack

Answer 1

FIFO (first in first out) vs LIFO (last in first out)

Question 2

myQueue.getFront();

Answer 2

Gets the first item in the queue without removing

Question 3

myQueue.dequeue();

Answer 3

Removes first item and returns it

Question 4

What do you do when the queue reaches the last array index?

Answer 4

backIndex = (backIndex+1) % queue.length;

Will circle to the front of the array again.

Question 5

How to add/remove to array queue

Answer 5

Add: at lastIndex + 1
Remove: firstIndex, then increase it

Question 6

Recursion

Answer 6

Problem solving process that breaks a problem into smaller problems of the same nature. Method calls itself.