CS 127, Fall 2000 – Quiz #2 Review
Topics
The quiz will focus on the topics covered in the course since the first
midterm. Of course, since everything we do builds on what comes previously,
knowledge of the material from the first part of the term is essential.
In particular, here are the topics we will have covered:
-
Linked lists in arrays (6.5-6.6)
-
Sorting (8.1-8.4)
-
Tables (9.1-9.5)
-
Hashing (9.6-9.7)
-
Binary trees / Binary search trees (10.1-10.3)
-
AVL Trees (10.4)
-
Tries (11.2)
-
B-trees (11.3)
-
Graphs (12.1-12.7)
Study Ideas
Do the exercises in the textbook associated with each of the above sections.
Check answers with someone else in the class and see if you agree.
Review the vocabulary in textbook.
The following links are for take-home exams given by other profs in
the department, in the past. They may have chosen to emphasize some different
material, so keep this in mind when looking at them.
http://www.mathcs.carleton.edu/faculty/jondich/Courses/cs127_w98/Documents/midterm2.html
http://www.mathcs.carleton.edu/faculty/jondich/Courses/cs127_s97/midterm2.html
http://www.mathcs.carleton.edu/faculty/jondich/Courses/cs127_w96/Tests/midterm2.html