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

---

Note:

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

Tuesday Lecture:

• Overview of 5.3 Animations with 2d Lists
• Overview of Sets and Dictionaries
• 6.2.8. Sets Guided Exercises
  • repeats (1 pt) (for green-check credit)
• 6.2.9. Sets Section Exercises
  • hasNoDuplicates (1 pt) (for green-check credit)
• 6.3.7. Dictionaries Guided Exercises
  • mostCommonName (1 pt) (for green-check credit)

Wed Recitation:

• 6.2.9. Sets Section Exercises
  • inOnlyOneList (2 pts) (for green-check credit)
• 6.3.8. Dictionaries Section Exercises
  • invertDictionary (1 pt) (for green-check credit)
  • sparseMatrixAdd (1 pt) (for green-check credit)

Thu lecture:

• Quiz6
• 6.3.7. Dictionaries Guided Exercises
  • getHoursLogged (2 pts) (for green-check credit)
• 6.3.8. Dictionaries Section Exercises
  • mostCommonLetterPairs (3 pts) (for green-check credit)
• Overview of Efficiency
• 6.4.8 Efficiency Section Exercises
  • getPairSum (1 pt) (for green-check credit)

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

• 6.2.6. Sets Code Tracing Exercises (2 pts, all required)
  • Code Tracing #1
  • Code Tracing #2
• 6.2.9. Set Section Exercises (6 pts, all required)
  • inBothLists (1 pt)
  • isPermutation (2 pts)
• 6.3.6. Dictionaries Code Tracing Exercises (4 pts, all required)
  • Code Tracing #1 (1 pt)
  • Code Tracing #2 (1 pt)
  • Code Tracing #3 (2 pts)
• 6.3.8. Dictionaries Section Exercises (7 pts, all required)
  • friendsOfFriends (2 pts)
• 6.4.7 Efficiency Practice (all required)
  • Checkpoints (no green checks)
• 6.4.8 Efficiency Section Exercises (4 pts, all required, manually graded)
  • containsPythagoreanTriple (1 pt)
  • findTriplets (2 pts)