Midterm 1
- Time: 7pm 7/10 Friday
- Location: 306 Soda (NOT 141 McCone)
About the Exam
- The exam is open-book, open-notes. No electronic devices allowed.
- The exam is un-timed to alleviate time pressure. But please do not study the material during the exam. I will cancel this policy if people abuse it.
- Parts of the exam will be done in groups.
Suggestions about How to Study
- Do the practice exams. If you would like to see more practice exams, you can find more in the HKN exam archive here . The actual exam will be similar to the practice exams.
- If you still don't quite see how recursion works, get help at office hours!
- Study the homeowrk solutions and the discussion handouts
Suggestions about Programming on Exam:
These are not requirement but rather guidelines about maximizing your score on the exam. The main point is this: if your code is hard to understand, then it is easy to mis-grade.
- Write as neatly as possible. You have no time constraint.
- Use meaning variable/function names. DO NOT use x,y,z,x1,... as variable names
- All procedures we ask you to write are fairly short. If you find yourself writing 4 helper functions each of which is 5 to 6 lines, you are probably on the wrong track
- If you can't think of an appropriate short descriptive name for your procedure, put a short concise comment saying what it's suppose to do.
Practice Midterms:
Your midterm 1 will cover the material from the practice midterm 1's as well as the Tree/Deep-list questions from the practice midterm 2's. Skip all questions about normal vs. applicative order.
- Sample Midterm 1.1 / Solution
- Sample Midterm 1.2 / Solution
- Sample Midterm 1.3 / Solution
- Sample Midterm 2.1 / Solution
- Sample Midterm 2.2 / Solution
- Sample Midterm 2.3 / Solution