Computer Science 210
Data Structures
Fall 2017, Siena College
Lecture 21: More Linked Lists
Date: Monday, October 30, 2017
Agenda
- Announcements
- Check out CS Department Lightning Talks today at 12:30 in RB 328!
- Tomorrow's office hours need to be cancelled, unfortunately
- Lab 6: Introduction to Linked Lists due Wednesday as usual (all might be in)
- Programming Project 3: Sorting with Comparators now on the late clock
- Exam 2 news
- In lab sessions on Wednesday
- Extra review time today 5:30-6:30 in RB 328
- Sample solutions outside my office
- More linked lists
- a complete singly linked list
- circular lists
- doubly linked lists
- list interfaces
- implementations in structure5
Lecture 21 Assignment
Due at the start of class, Friday, November 3.
Please submit answers to these
questions by the start of class. zyBook activities should be done
right in your zyBook, and all others should be submitted to
Blackboard under "Lecture 21 Assignment" . We will
discuss these questions at the start of class, so no late
submissions can be accepted.
Read and complete all participation activities in Chapter 14,
Sections 5 through 9, of your zyBook. This will be worth a total of 20
"Assignment" points, with your score based on the percentage of
tests your responses pass.
- Bailey Problem 9.4, p. 212 (in the "Problems"
section at the bottom, not the "Self Check Problem"). For this,
write a method of some List class that takes another List
as its parameter and returns true exactly when this list
and the one passed as the parameter contain equal objects at each
list position. (5 points)
- Bailey Problem 9.10, p. 213. Here, the two
implementations Bailey refers to are a list that maintains an
instance variable with the current number of elements in the list at
all times, vs. one that does not. (5 points)
- Bailey Exercise 9.12, p. 213. Note: truly
shuffled data would be data where each element has an equal
probability of being at each position. (5 points)
Terminology
- circularly linked list
- doubly linked list