Computer Science 161
Exam #3 Reviews
Disclaimer: I have attempted to be comprehensive in the following,
but important items may have been omitted by mistake. If you see
such an omission, please let me know. You are responsible for all of
the lecture material to date.
The third hour exam will be on Friday, April 30, and will cover
- Chapter 6 (classes): Be able to declare a class with public
and private components. Be able to use a class, and explain why
this approach is taken.
- Chapter 7 (control structures): We've seen most of this
before. Please pay particular attention to nested loops and the
switch statement.
- Chapter 8: Not on this exam
- Chapter 9: Arrays
- Be able to specify, read, write, add up, etc. arrays and
the elements of arrays.
- Be able to sort an array. For this exam, I will ask you to
use any sorting algorithm you chose, but to name it. For the
final exam, I may specify the sorting algorithm to use. Be
able to define and specify loop invariants for sorts.
- Be able to do basic string manipulation: in particular, be
able to calculate the length of a string (look at your
palindrome program), and be able to use strcpy and strcmp.
- Searching: Be able to search an array using sequential and
binary search techniques
- Recursion: Be able to write basic recursive routines.
QuickSort will not be on this exam.