Homework2 (due Sat 25-Jan at 8pm)

---

Notes:

• For all exercises, to receive credit you need to obtain a green check in CS Academy. There is no partial credit on individual exercises.
• For guided exercises, watching the guided video is required -- it will show you how to solve the exercise elegantly, will save you lots of time, and will best prepare you for later exercises. Thus, first read the writeup and then carefully watch the guided video. Then and only then should you solve the guided exercise.

---

Required problems

• 2.2.6 Code Tracing Exercises (all, 2 stars)
• 2.2.7 Guided Exercises
  • isPrime (1)
  • nthPrime (1)
  • reverseNumber (1)
  • mostFrequentDigit (1)
  • hasConsecutiveDigits (1)
• 2.2.8 Section Exercises
  • occursIn (1)
  • nthEinNumber (2)
  • nthEmirpPrime (2)
  • isRotation (2)
• 2.2.11 Additional Practice Exercises
  • stepsToReach495 (2)
  • longestIncreasingRun (3)

Bonus/Optional

Note:

• These problems are bonus and optional (you can skip them).
• They are worth up to 3 bonus points. This is very few, so please do not do the bonus just for the points. Instead, do it for the learning!

• 2.2.9 Honors Exercises
  • carrylessMultiply (4 in CS Academy, worth 2 bonus points)
• 2.2.11 Additional Practice Exercises
  • findZeroWithBisection (3 in CS Academy, worth 1 bonus point)

---

Week 3 Required Prereading (due Mon 27-Jan at 8pm)

Read the notes and complete all the checkpoints in CS Academy through (and including) section 2.4.9 Code Tracing with Strings

(Note: Checkpoints include anything labeled as a Checkpoint in the notes. Unless otherwise specified, pre-reading does not include anything labeled as an Exercise on the table of contents.)

---