COP 3530

Data Structures and Algorithms

University of Florida

Assignment 2

Do problems 6.42 (omit the Do Exercise 13 part), 6.44 (omit the Do Exercise 17 part), 8.26, and 8.34.

The assignment is due in the lecture Wed. Oct. 4. The solutions will be posted on the Web shortly after this lecture. No late assignments will be accepted.


SPECIAL NOTES

1. See SPECIAL NOTES for Assignment 1. In particular, note that both email and hard copy submission are required.
2. For problems 6.42 and 6.44 use the class DoublyLinkedList (available as solution to problem 6.39). For 6.42 you need to write a nonstatic method to meld two doubly linked lists, and for 6.44 a nonstatic method to splia a doubly linked list is required.