Stacks and Queues

Question 1

What is a queue?

Answer 1

A First In First Out (FIFO) linear data structure that maintain the order of the data

Question 2

What is at the front an back of queues?

Answer 2

Front pointer and a back pointer / head/tails pointer

Question 3

What should be considered before enqueueing or dequeuing an item?

Answer 3

If the queue is full (queue overflow) or if the queue is empty (queue underflow)

Question 4

Why is using arrays to implement a queue a problem?

Answer 4

Both the back and front pointers are moving in the same direction as items are added and removed - array will quickly run out of space

Question 5

How to we solve the problem caused by implementing a queue using an array?

Answer 5

Cycle the back pointer to the front of the array when it reaches the end

Question 6

An example of a queue

Answer 6

Transferring data between processors and printers - process scheduling

Question 7

What is a stack?

Answer 7

A Last In First Out (LIFO) data structure - the last item to be pushed onto the stack must be the first item to be popped off

Question 8

What is at the top of a stack?

Answer 8

A stack pointer

Question 9

What should be considered before pushing or popping an item?

Answer 9

If the stack is full (stack overflow) or if the stack is empty (stack underflow)

Question 10

An example of a stack

Answer 10

Keeping track of user inputs for undo operations