CS5nm Final Exam (E03) Study Guide
Summary of Chapters for Final Exam: 1-6, 8, 10, 12
Although several other chapters were included in earlier reading assignments, since we did not have time to discuss them in lecture or practice the concepts in a programming assignments, material from those chapters will not appear on the final exam in Fall 2008. (Summer 2009 may be a different story!)
New topics for Final Exam:
- Lecture notes from 11/12 through end of quarter
- Exercises ex12, ex13, ex14, ex15
- Particularly exercise 15!
- Recursion on lists
- Composition of functions (e.g. application of f(g(x), as in the case of
noDups(allVowelsA(word)) in ex15
Other topics from Midterm 2
- Drawing in PyGame (ex06, ex09, handout) and TurtleWorld (Chapter 4, ex10)
- Demorgan's Law: simplifying expressions involving and, or, not
- not (a and b) is the same as (not a) or (not b)
- not (a or b) is the same as (not a) and (not b)
- My articles on void vs. fruitful functions and on what print does
- My article "recursion on slices—background".
- This is a summary of material from the lecture of Monday 11/10, except for the last part on recursion.
- Lecture notes through 11/12/2008, and exercises ex01 through ex11.
(end of study guide for Midterm 3)