Homework2 (due Fri 23-Jan at 8pm)

Notes:

• The same basic policies of hw1 apply here.

---

Exercises

• 2.1.6. Code Tracing Exercises
  • CT #1 (1)
  • CT #2 (1)
  • CT #3 (1)
• 2.1.7. Guided Exercises
  • isPrime (1)
  • nthPrime (1)
  • reverseNumber (1)
  • mostFrequentDigit (1)
  • hasConsecutiveDigits (1)
• 2.1.8. Section Exercises
  • occursIn (1)
  • stepsToReach495 (2)
  • isRotation (2)
  • carrylessAdd (2)
  • nthEinNumber (2)
  • isLangfordPairing (3)
  • longestDigitRun (3)
  • carrylessMultiply (4)
• 2.1.9. Honors Exercises
  • integral (4)
  • Integer Data Structures (10)
• 2.1.10. Additional Code Tracing Exercises
  • Additional CT #1 (1)
  • Additional CT #2 (1)
  • Additional CT #3 (1)
• 2.1.11. Additional Practice Exercises
  • gcd (1)
  • babylonianSquareRootIterations (1)
  • nthAdditivePrime (1)
  • nthEmirpPrime (2)
  • nthPowerfulNumber (1)
  • nthPerfectNumber (1)
  • nthWithProperty309 (1)
  • isSemiPrime (2)
  • nthLeftTruncatablePrime (2)
  • nthCarolPrime (2)
  • longestIncreasingRun (3)
  • nthSmithNumber (3)
  • findZeroWithBisection (3)
• 2.2.2. Guided Exercises
  • nthHappyPrime (1)

---