homeworks 2 and 3 are graded...they can be picked up during lab, or, possibly,
in my office laterre this evening
the mean on hwk2 was about a 17 out of 20
on hwk3 it was about a 21 out of 30
with regard to hwk #2:
i have very little to say about it...it was a while ago! :(
with regard to hwk #3:
on problem #2: common errors--
you need only log(base2)(b) bits for part III of compression
on problem #3:
remember: the info stored at external nodes should be an index to
the original text...INCLUDING spaces!! (spaces has an ASCII
code, too)
when you exhaust the search string, if you've skipped bits,
you need to check one string in that subtree before confirming
a match
common mistake: did not find ALL prefixes...stopped at just 1
there were a few different pictures/encoding schemes used...i would suggest, on
the exam, that you indicate whether or not you started counting at ZERO, or ONE,
etc...rather than leaving that up to interpretation.
on problem #4:
i graded this one pretty...umm...loosely; if thought that you
had the right idea, you probably scored fairly well; if you
were way off, or you did not refer to the algorithm, then you
may not have scored as high
watts