CMU 15-112: Fundamentals of Programming and Computer Science
Week9 Plan
Note:
- Please do not do recitation or lecture exercises before we do them in recitation and lecture!
- quiz7
- Recursion overview
-
Complete 8.3 Recursion Practice + some Unit 8 exercises(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
- 8.10. powerset (2 pts)
- 8.11. isAlmostPalindrome (1 pt)
- 8.11. hasSublistSum (2 pts)
- 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)
-
Complete:
- 8.11. digitCountMapInRange (2 pts)
- Finish exercises from Tue lecture (as needed)
- Fractals (for week10)
- Read all Recursion notes except Fractals (8.7) and Backtracking (8.8)
- Complete 8.2 Code Tracing with Recursion
- Complete 8.9 More Code Tracing with Recursion
-
Complete 8.10. Unit 8 Guided Exercises
- 8.10. flatten (2 pts)
- 8.10. getCourse (2 pts)
-
Complete 8.11. Unit 8 Exercises
- 8.11.1. addOffsets (1 pt)
- 8.11.2. hasRepeatedDigit (1 pt)
-
Bonus/Optional: 8.12. Unit 8 Honors Exercises (each worth 2 pts of bonus)
- 8.12. recursiveSat (4 pts)
- 8.12. isKingsTour (4 pts)