COP 3530

Data Structures and Algorithms

University of Florida

Assignment 1

Do problems 5.6, 5.28 (use the class developed for 5.27), 6.18, and 6.22.

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


SPECIAL NOTES

  1. Read the solutions posted on the Web site for related problems from the text. Study the structure of the corresponding Java files to figure out how you should structure your code.
  2. When you test a code, you must attempt to use all data sets that can be expected to cause the code to behave differently.
  3. Read Assignment Guidelines before you start.
  4. Read Submission Procedures. 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. Sheetul Agrawal
sagrawal@cise.ufl.edu
12 points (8 for the new method, 2 for complexity, 2 for testing)

Second Problem
Grader: Mr. Tapan Divekar
tdivekar@cise.ufl.edu
12 points (2 for each of iterator, constructor, hasNext, next, and remove, 2 for testing)

Third Problem
Grader: Ms. Aarathi Balakrishnan
ab0@cise.ufl.edu
12 points (10 for the code, 2 for testing)

Fourth Problem
Grader: Mr. Jinting Lu
jlu@cise.ufl.edu
16 points (10 for the code, 2 for each complexity analysis, 2 for testing)

STATISTICS
Total Points = 52
Highest Score = 52
Lowest Score = 6.5
Average Score = 32
Number of Submissions = 163


Solutions