1. Wednesday, 12/11/02, Slide #1 CS 106 Intro to Comp. Sci. 1 Wednesday, 12/11/02  QUESTIONS??  Today: CLOSING CEREMONIES!  HW #5 – Back Monday (12/16) am  Review for final exam  Evaluations  FINAL EXAM: WEDNESDAY, 12/18/02, 1:30-4:30, HARDER 201  OFFICE HOURS: 2 – 4 Monday and Tuesday next week and by appointment

2. Wednesday, 12/11/02, Slide #2 General Info About Final Exam  Final is cumulative: Covers material from entire course (class meetings, reading, labs, homework)  Format will be similar to earlier exams.   You may bring to the exam two reference sheets: two 8.5 by 11 pieces of paper, on which you may write any information you wish (both sides OK).

3. Wednesday, 12/11/02, Slide #3 Final Exam Topics: Chaps. 1-3  Chapter 1: Basic computer components and terminology; high and low level languages; beginning C++ programming ideas (program structure, input/output, assignment, float objects, precedence of operators); kinds of program errors, debugging  Chapter 2: If statement, statement blocks, while statement, initializing and updating in loops, counting, summing, accumulating, sentinels, nested loops  Chapter 3: Basic function syntax, function parameters and arguments; function return types, value-returning v. void functions; scope of objects; constants and global constants; using library functions

4. Wednesday, 12/11/02, Slide #4 Final Exam Topics: Chaps. 4-6  Chapter 4: Program design process; top-down design; software life cycle  Chapter 5: More on functions; function prototypes and definitions; value v. reference parameters; stubs, file input and output; ; ofstream and ifstream types; end-of-file loops; declaring/opening/using/closing files  Chapter 6: Data types, float, double, char, comparison operators, char library functions, ASCII code

5. Wednesday, 12/11/02, Slide #5 Final Exam Topics: Chaps. 7-9  Chapter 7: More on if-statement; compound comparisons; for-loop; do-while statement; boolean objects, logical operators &&, ||, !; precedence of operators; short-circuit evaluation; integer operators %, ++, --, +=, -=, *=, /=  Chapter 8: More on File I/O  Chapter 9: string objects; ; string constants; whitespace; string operators (input/output, comparison, index [ ], concatenation +); member functions (size(), length(), max_size())

6. Wednesday, 12/11/02, Slide #6 Final Exam Topics: Chap. 10, plus extra material  Chapter 10: Arrays, declaring and using; initializing; processing arrays with loops; arrays as function parameters and arguments; multidimensional (especially 2-D) arrays; (pointers not covered)  Searching and sorting: Linear search, binary search (discussed in Chap. 13), selection sort, quicksort, time-complexity, divide-and-conquer algorithms  Random numbers: Random numbers in C++; ; rand(); RAND_MAX; srand(time(0)); ; random probabilities, random integers in a range

7. Wednesday, 12/11/02, Slide #7 Final Exam Topics: Chap. 12  Chapter 12: Basic syntax and concepts of OOP and classes; principles of OOP, ADTs, objects; Client use of classes, declaring instances of class objects, the member access operator (dot); the header file: client interface, class definition, function prototypes, data members, public v. private; the implementation file: prefix of function names with class name and scope operator, defining member functions, when member access operator is needed to refer to class members, overloading operators, type conversion.

8. Wednesday, 12/11/02, Slide #8 Final Exam Topics: Chap. 13  Chap. 13: Recursion, tracing recursion (showing variable values and return values); “good” or “useful” recursion