DAT305 Data Structures for Problem Solving

DAT/305 Week 3 Challenge Activities 3.1.1: Stack ADT

CHALLENGE ACTIVITY 1

Given numStack: 69,87 (top is 69)
What is the stack after the following operations?
Pop(numStack)
Push(numStack, 92)
Pop(numStack)
Push(numStack, 77)

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

CHALLENGE ACTIVITY 2

Given numStack: 11,71,12 top is 11)
What does Peek(numStack) return?

What is the stack after the following operations?
Push(numStack, 34)
Pop(numStack)
Push(numStack, 73)
Peek numStack)
Peek/numStack)

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

CHALLENGE ACTIVITY 3

Given numStack: 16.65 (top is 16)
Pop(numStack)
Pop(numStack)

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

After the above operations, what does isEmpty(numStack) return?

DAT/305 Week 3 Challenge Activities 3.2.1: Stacks using linked lists

CHALLENGE ACTIVITY 1

Given an empty stack numStack, what does the list head pointer point to? If the pointer is null, enter null.

After the following operation, which node does the list head pointer point to?
StackPush(numStack, 83)

CHALLENGE ACTIVITY 2

Given numStack: 54, 38, 25, 28 (top is 54)
After the following operation: StackPush(numStack, 40)
What node does newNode's next pointer point to? If the pointer is null, enter null.

What node does the list's head pointer point to?

CHALLENGE ACTIVITY 3

Given numStack: 51 (top is 51)
After the following operation: StackPop(numStack)
What is returned?

What node does the list's head pointer point to? If the pointer is null, enter null:

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?

DAT/305 Week 3 Challenge Activities 3.4.1: Queues using linked lists

CHALLENGE ACTIVITY 1

Given an empty queue numQueue, what does the list head pointer point to? If the pointer is null, enter null.

What does the list tail pointer point to?

After the following operations:
QueueEnqueue(numqueue, 66)
QueueEnqueue(numQueue, 93)
QueueDequeue(numQueue)

What does the list head pointer point to?

What does the list tail pointer point to?

CHALLENGE ACTIVITY 2

Given numQueue: 78, 37, 47

What does the list head pointer point to? If the pointer is null enter null.

What does the list tail pointer point to?

After the following operations:
QueueEnqueue(numQueue, 60)
QueueEnqueue(numqueue, 57)
QueueDequeue(numQueue)
QueueDequeue(numQueue)

What does the list head pointer point to?

What does the list tail pointer point to?

DAT/305 Week 3 Challenge Activities 3.5.1: Deque ADT

CHALLENGE ACTIVITY 1

Given an empty deque numDeque, what are the deque's contents after the following operations?
PushBack(numDeque, 24)
PushFront(numDeque, 49)
PushBack(numDeque, 44)

After the above operations, what does PeekFront(numDeque) return?

After the above operations, what does PeekBack(numDeque) return?

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

CHALLENGE ACTIVITY 2

Given an empty deque numDeque, what are the deque's contents after the following operations?
PushBack(numDeque, 95)
PopFront(numDeque)
PushFront(numDeque, 42)
PushFront(numDeque, 25)
PopBack(numDeque)

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

CHALLENGE ACTIVITY 3

Given numDeque: 19, 38
PeekFront(numDeque)
PopFront(numDeque)
After the above operations, what does GetLength(numDeque) return?

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