Homework 3
22C:21 Computer Science II: Data Structures
Due Friday, February 22, 2008
1. (10 points) Complete the MyDoublyLinkedList class
that implements the MyList interface. The implementation must include
head and tail nodes. I've provided the MyLinkedListClass
as an example (and covered it in class). Note that the MyDoublyLinkedList class
contains one additional method to implement beyond what's included in the MyList
interface. Note: For this problem, you must
submit your code via the ICON dropbox. Make sure you include
some code (and output) that demonstrates that you tested your class.
2. (5 points) Exercise 3.4, page 95. You don't have to implement
and submit a program to ICON; you just need to write the code/algorithm.
3. (5 points) Exercise 3.24, page 98. Again, you're not required
to implement and submit a program to ICON.
4. (5 points) Exercise 3.28, page 98. Again, you're not required
to implement and submit a program to ICON.