CMU 15-112: Fundamentals of Programming and Computer Science
Week10 Plan

---

Note:

• Please do not do recitation or lecture exercises before we do them in recitation and lecture!

Tue Lecture:

• quiz8
• Recursion overview
• Complete 8.3 Recursion Practice (for green-check credit):
  • 8.3.2. rangeSum and exclusiveRangeSum
  • 8.3.3. digitSum and maxDigit
  • 8.3.4. fibonacci and perrin
  • 8.3.5. reversedList and reversedEvens
  • 8.3.6. power and betterPower

Wed Recitation:

• Discuss Code Tracing with Recursion
• Complete 8.4. More Recursion Practice (for green-check credit):
  • 8.4.1. oddCount (1 pt)
  • 8.4.2. oddSum (1 pt)
  • 8.4.3. oddValues (1 pt)
  • 8.4.4. oddMax (1 pt)
  • 8.4.5. Interleave (1 pt)

Thu Lecture:

• From 8.10. Unit 8 Guided Exercises:
  • 8.10.2. getCourse (2 pts)
  • 8.10.4. solveKingsTour (3 pts)
• Term Project

Sun Homework (hw9):
Note: hw9 is due on Sunday 13-Nov. The following are the required exercises for hw9 that will not be covered for green-check credit in lecture or recitation:

• Read all Recursion notes
• Complete 8.2 Code Tracing with Recursion
• Complete 8.9 More Code Tracing with Recursion
• Complete 8.10. Unit 8 Guided Exercises
  • 8.10.1. flatten (2 pts)
  • 8.10.3. Teddy Bear Fractal (2 pts)
• Complete 8.11. Unit 8 Exercises
  • 8.11.1. addOffsets (1 pt)
  • 8.11.2. hasRepeatedDigit (1 pt)
  • 8.11.3. solveMiniSudoku (3 pts)
• Continue making progress on the Term Project (nothing to submit for this one)