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

---

Notes:

1. Please do not do the recitation problems before recitation!
2. Also, the stars for the recitation problems are hidden until recitation, so you may notice the stars do not add up properly until after then.

Tuesday Lecture:

• Quiz3
• 4.4.13. isLatinSquare (for green-check credit) (moved to Thursday)
• 4.4.14. wordSearch (for green-check credit)
• 4.4.15. matrixMultiply (for green-check credit) (moved to Thursday)

Wed Recitation:

• 4.4.12. Code Tracing #2 (not for green-check credit)
• 4.4.13. removeRowAndCol (mutating and nonmutating) (for green-check credit)
• 4.4.15. makeEdits (for green-check credit)

Thu lecture:

• Remaining Tue items
• Discuss Term Projects
• Preview (notes, not exercises):
  • Unit 5: Animations with 1d Lists

Fri Homework (hw4):
The following are the required exercises for hw4 that will not be covered for green-check credit in lecture or recitation:

• 4.4.12. 2d List Code Tracing Exercises (all required):
  • Code Tracing #1 (1 pt)
  • Code Tracing #2 (1 pt)
  • Code Tracing #3 (1 pt)
  • Code Tracing #4 (1 pt)
• 4.4.14. Word Search Case Study (all required):
  • betterWordSearch1 (2 pts)
  • betterWordSearch2 (2 pts)
  • betterWordSearch3 (2 pts)
• 4.4.15. 2d List Section Exercises (9 pts required):
  • insertRowAndCol (mutating and nonmutating) (1 pt)
  • isKingsTour (2 pts)
  • isAlmostMagicSquare (3 pts)
• 4.5. Unit 4 Guided Exercises (all required):
  • isLegalSudoku (2 pts)

The following are optional / bonus exercises for hw4 that will not be covered for green-check credit in lecture or recitation:

• 4.6. Unit 4 Exercises (optional / bonus):
  • samePolygons (2 pts)
  • nQueensChecker (2 pts)
  • bestScrabbleScore (3 pts)