DAT305 Data Structures for Problem Solving

DAT/305 Week 3 Challenge Activities 3.3.1: Queue ADT

CHALLENGE ACTIVITY 1

Given numQueue: 75, 45
What are the queue's contents after the following operations?
Enqueue (numQueue, 80)
Dequeue(numQueue)

After the above operations, what does GetLength(numQueue) return?

CHALLENGE ACTIVITY 2

Given numQueue: 90, 60
What does Peek(numQueue) return?

What is the queue after the following operations?
Peek(numQueue)
Dequeue (numQueue)
Peek(numQueue)
Enqueue (numQueue, 90)

After the above operations, what does GetLength(numqueue) return?

CHALLENGE ACTIVITY 3

Given numQueue: 73, 39
Peek(numQueue)
Dequeue (numqueue)
After the above operations, what does GetLength(numQueue) return?

After the above operations, what does IsEmpty(numQueue) return?

CHALLENGE ACTIVITY 4

Given numQueue is empty, what does the list head pointer point to?

What does the list tail pointer point to?

After the following operations:
Enqueue (numQueue, 26)
Enqueue (numQueue, 47)
Enqueue (numQueue, 22)
Dequeue (numQueue)

What does the list head pointer point to?

What does the list tail pointer point to?