Data Structures and Algorithms

COP 3530

University of Florida

Assignment 3

Do problems 11.34, 12.30, 12.46, and 12.62.

The assignment is due in the lecture Wed. Oct. 18. 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.

Problem 11.34. Your class should implement the interface Dictionary and should implement all the same methods of HashChains. Use the tail node to simplify the operations. Omit the run-time performance comparison. You may use the same main method as used in HashChains to test your class.

Problem 12.30. (You might want to read the posted solution for 12.31 first.)

Problem 12.46. The remove method should throw an UnsupportedOperationException. Note that the simple solution in which the constructor stores all elements in an array in the order they are to be iterated and the next method just sequences down this array doesn't meet the stated complexity requirements.

GRADING

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

First Problem
Grader: Ms. Jinting Lu
jlu@cise.ufl.edu
15 points (2 for the constructor, 1 each for isEmpty, size, and output; 3 each for get, put, and remove; 1 for testing)

Second Problem
Grader: Ms. Sama Ramanujam
sama@ufl.edu
14 points (10 for code, 2 for analysis, 2 for testing)

Third Problem
Grader: Ms. Xiaoli Liu
xliu@cise.ufl.edu
18 points (1 each for the methods iterator, hasNext, and remove; 5 for the constructor; 8 for next; 2 for testing)

Fourth Problem
Grader: Ms. Sheetul Agrawal
sagrawal@cise.ufl.edu
6 points (5 for the new method, 1 for testing)

STATISTICS
Total Points = 53
Highest Score = 53
Lowest Score = 5
Average Score = 39
Number of submissions = 145

Solutions