Data Structures and Algorithms

COP 3530

University of Florida

Assignment 4

Do problems 13.4 (complexities should be as in Ex. 13.3), 13.24 (part (c) and (d) only, note that for part (d) only the meld method is different from that of MaxHBLT, the remaining methods are the same), 15.10 (for the timing part, use the class misc.AverageSortTime.java (modify as needed), present your results in tabular and graph form (see Chapter 4)), and 15.12.

The assignment is due in the lecture Mon. Nov. 6. The solutions will be posted on the Web shortly after this lecture. No late assignments will be accepted.

SPECIAL NOTES

See SPECIAL NOTES for Assignment 1. In particular, note that both email and hard copy submission are required.

GRADING

CODE THAT HAS NOT BEEN COMPILED OR GENERATES COMPILER ERRORS WILL RECEIVE NO CREDIT

First Problem
Grader: Ms. Arti Balakrishnan
ab0@cise.ufl.edu
15 points (6 points for the modified version of SortedChain; 1 for the constructor(s) of your priority queue class, 3 for each of the priority queue methods getMax and removeMax, 2 for testing; your priority queue class will inherit the remaining priority queue methods from your modified sorted chain class)

Second Problem
Grader: Ms. Sama Ramanujam
sama@ufl.edu
16 points (2 for WbltNode, 12 for meld, 2 for testing)

Third Problem
Grader: Ms. Xiaoli Liu
xliu@cise.ufl.edu
16 points (6 for the sort method, 2 for testing sort method, 6 for obtaining and presenting the run times in tabular and graph form, 2 for subjective comparison of run times).

Fourth Problem
Grader: Mr. Tapan Divekar
tdivekar@cise.ufl.edu
12 points (10 for code, 2 for testing).

STATISTICS
Total Points = 59
Highest Score = 59
Lowest Score = 2
Average Score = 35
Number of submissions = 137

Solutions