DAT305 Data Structures for Problem Solving
DAT305 Data Structures for Problem Solving
DAT305 covers Data Structures. Topics include data structures, recursion, analysis, sorting and searching (sequential and binary), tree and tree algorithms, graphs and graph algorithms, as related to organizational problem solving across industries.
1 Item(s)
Grid List
-
DAT/305 Week 3 Challenge Activities 3.4.1: Queues using linked lists
Regular Price: $5.00
Special Price $2.00
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 2Given 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?
Learn More
1 Item(s)
Grid List
You have no items in your shopping cart.
