COP 3503: Computer Science II Archive
Some of the material originally covered in the course (Stacks, Queues,
LLs, Binary Trees, Binary Heaps, Hash Tables), got moved down to CS1. Once
that occurred, topics from CS3 were moved down to CS2 and CS3 was
eliminated. With this elimination, a couple things happened. There was
less redundancy in our C, CS1, CS2, CS3 sequence and a few topics, such a
string matching, computational geometry and number theory, were removed.
Since I was a bit worried about the amount of programming students would
do after finishing the sequence, after CS3 was removed, I added recitation
programs as a way to get students to write more code before they finished
the C-CS1-CS2 sequence. Some of the notes between this class and CS3 are
the exact same.