CS 117, 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:
-
Multidimensional arrays (10.2)
-
Recursion (12.1-12.3)
-
Sequential search
-
Binary search (within 12.3)
-
Classes (6.2)
-
Structs (6.1)
-
Abstract Data Types (6.3)
-
Pointers (11.1)
-
Dynamic arrays (11.2)
-
Linked lists (14.1)
Study Ideas
Do the self-test questions in the textbook associated with each of the
above sections. The answers to all of these are in the back of each
chapter. Test yourself.
Review the vocabulary in the margins of the textbook.
The following links are for take-home 117 exams given by Jeff Ondich
in the past. Our quiz is in class, and he 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/cs117_w00/Documents/midterm2.html
http://www.mathcs.carleton.edu/faculty/jondich/Courses/cs117_f99/Documents/midterm2.html
http://www.mathcs.carleton.edu/faculty/jondich/Courses/cs117_s98/Tests/midterm2.html