2810 COMP Data Structures, Spring 2009
February 7, 2009
PROGRAMMING ASSIGNMENT #2
Due on Monday, February 16, 2009 before midnight
Full, well documented code should be submitted for each of the problems in the assignment. All submissions should arrive at [e-mail] before the deadline. If any part of the submission is a result of a collaboration with other students, or of use of external sources these have to be fully and appropriately acknowledged at the time of submission. Do not hesitate to add to your submission (text) files explaining in detail your ideas, approaches, results, and conclusions. Although you should try to achieve optimal solution to each problem, non-optimal but working solution is generally regarded (much) higher than underdeveloped brilliant idea. The solutions to these problems are to be discussed with the instructor, as outlined the in syllabus, and will be graded for credit. The oral presentations of the solutions will also be part of the credit for this course. 1. Implementing find For each of the four implementations discussed in Chapter 16, write a function find(x) that returns an appropriate reference to the object x if found in the data structure and appropriate negative result if it is not found. Describe in detail your algorithms, and analyze their running time. Develop a test example. 2. Implementing findMin and deleteMin For the linked...