Computer Science 410: Homework 6 -- Grading Guide
Point Distribution
1pass = 15%
Heap = 20%
2pass = 10%
Intersection = 15%
Style = 10%
Writeup = 30%
Manual Items
- Check that O(nlgm) requirements are being met and that timing is consistent with written timing
- Check overlap looks reasonable -
use "BigHouse Output for Manual Check" for top 25.
(Light scan that collision numbers are next to each other)
- Check that 2 pass isn't just calling 1pass
Can look at student output files if problems.
- Check glaring inefficiencies -
- Reads the input file more than once for part 1: -4
- Does not meet the asymptotic time/space requirement for part 1: -4
- Reads the input file more than twice for part 2: -4
- Does not meet the asymptotic time/space requirement for part 2: -4
- Part3 Does not meet the asymptotic time/space requirement for part 3
(e.g. stored information from the larger file
("cornell.txt") in a data structure): -4
- Used inefficient method for avoiding repeated addresses: -4
Style
- Puts the key as part of the value as well (i.e. address included
in value) (The only way to access the values of a Hashtable is if you have the key.
But if you already have the key it doesn't need to be part of
the value
you are looking up.): -2
- Gets and puts into hashtable when adding element to the name
vector
(if the hashtable contains pointers to vectors, modifying the
contents of
the vector does not change the pointer. Hashtable.put() is unnecessary): -2
- Wasted space by using a separate count instead of Vector.size(): -2
- Used inappropriate data structure (such as Vector) to store the
count info in part 2: - 2
- Handed in Report with more than 3 pages: -3
- Failure to include attachment: -3