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

• For the best learning experience, please do not attempt the lecture or recitation exercises before we cover them in those sessions.
• See the Week1 Plan for more notes.

• Quiz1
• 4.2: 1d Lists
• 4.2.15. removeEvens (mutating + nonmutating) (1 pt) ✓
• 4.2.16. multiplyPolynomials (3 pts) ✓

• 4.2.16. isNearlySorted (1 pt) ✓
• 4.2.16. repeatingPattern (2 pts) ✓
• 4.3.3. lookAndSay + inverseLookAndSay (2 pts) ✓

• 4.2.16. singleWildcardMatches (3 pts) ✓
• 4.3: Tuples
• 4.3.3. areaOfPolygon (1 pt) ✓
• 4.3.4. satisfyExpressions (3 pts) ✓

• 4.2.14. 1d Lists Code Tracing Exercises (5 exercises, overall worth 2 pts on hw)
• 4.2.16. removeRepeats (mutating + nonmutating) (1 pt)
• 4.2.16. firstNEvenFibonacciNumbers (1 pt)
• 4.2.16. bowlingScore (2 pts)
• 4.2.16. firstNAcceptedValues (3 pts)
• 4.3.2. Tuples Code Tracing (3 exercises, overall worth 1 pt on hw)
• 4.3.3. bestTimeToMeet (1 pt)
• 4.3.3. isClique (1 pt)
• Bonus/Optional:
  Note: for hw2, bonus problems are worth half the points listed below. Thus, with 8 points listed, you can score up to +4, for a max score on hw2 of 104.
  • 4.2.17. linearRegression (4 pts)
  • 4.2.17. runSimpleProgram (4 pts)