| Contents [0/1] |
| Homework (Linked Lists, Queues) [1/1] |
(Click here for one slide per page)
| Homework (Linked Lists, Queues) [1/1] |
Review Section 1.3 of Algorithms on Stacks, Queues and Bags. Pay special attention to the treatment of linked list implementations of stacks and queues (pp. 142 - 153).
Skim Section 2.4 of Algorithms on Priority Queues. We will begin covering this material next week.
Do Quiz 7 on D2L.
Do the homework assigned on D2L (See Submissions).
Make sure to submit each file to the correct folder. I will not move your homework to the correct folder (mostly because I won't look closely) - downloading your submissions and autograding them is automated!
In this homework, you will get some practice working with linked lists and implement a queue with a linked list.
hw7a: Practice with Linked Lists - DO THIS PART OF THE HOMEWORK FIRST!
Create a new package in IntelliJ IDEA, called ds1.student.linked. Download the following files and save them to this new package.
Implement all the functions requested. Follow all instructions!.
Tests are already provided for you and should guide you to getting your answers correct.
hw7b: Implement a Queue with a Linked List
Create a new package in IntelliJ IDEA, called ds1.student.queue. Download the following files and save them to this new package.
Implement all the methods and tests as indicated with the TODO comments in LinkedQueue.java.
Do not change Queue.java.
Note: There are three main programs for this homework. They are in MyLinked0.java, MyLinked1.java, and LinkedQueue.java. You should be sure to run all of them!