ICS 6D - Reading Assignments Winter, 2024 (Dillencourt)

The textbook reading activities for the quarter are listed below. Generally, the readings for each week will be posted by Friday afternoon of the previous week.

• "Reading a section" means reading the section and doing all the participation activities.
• Readings and associated activities are to be completed before 12:29PM on the due date (one minute before the start of class).
• There is no grace period.
• It is recommended that you do not wait until the last possible moment to read the material and complete the activities.

• Week 1: (Note: For this week only, you will not be graded on completing the readings before the lecture.)
  • Tuesday, January 9:
    • Chapter 1: Sections 1.1 through 1.8
  • Thursday, January 11:
    • Chapter 3: Section 3.1 through 3.7
    • Chapter 4: Section 4.1 through 4.6
• Week 2:
  • Tuesday, January 16: No readings due
  • Thursday, January 18:
    • Chapter 8: Section 8.1 through 8.5
• Week 3:
  • Tuesday, January 23:
    • Chapter 8: Section 8.6
  • Thursday, January 25: No readings due (Test 1)
• Week 4:
  • Tuesday, January 30:
    • Section 8.8: Recursive definitions
    • Section 8.9: Structural induction
    • Section 8.10: Recursive algorithms
    • Section 8.11: Induction and recursive algorithms
  • Thursday, February 1:
    • Section 8.15: Solving Linear homogeneous recurrence relations
• Week 5:
  • Tuesday, February 6:
    • Section 9.1: The Division Algorithm
    • Section 9.2: Modular arithmetic
    • Section 9.3: Prime factorizations
    • Section 9.4: Factoring and primality testing
  • Thursday, February 8:
    • Section 9.5: Greatest common divisor and Euclid's algorithm
    • Section 9.6: Number representation
    • Section 9.7: Fast exponentiation
• Week 6:
  • Tuesday, February 13: No readings due
  • Thursday, February 15: No readings due (Test 2)
• Week 7:
  • Tuesday, February 20:
    • Section 9.8: Introduction to cryptography
    • Section 9.9: The RSA cryptosystem
  • Thursday, February 22:
    • Section 10.1: Sum and product rules
    • Section 10.2: The bijection rule
    • Section 10.3: The generalized product rule
• Week 8:
  • Tuesday, February 27:
    • Section 10.4: Counting permutations
    • Section 10.5: Counting subsets
    • Section 10.6: Subset and permutation examples
    • Section 10.7: Counting by complement
  • Thursday, February 29:
    • Section 10.8: Permutations with repetitions
    • Section 10.9: Counting multisets
    • Section 10.10: Assignment problems: balls in bins
    • Section 10.11: Inclusion-exclusion principle
• Week 9:
  • Tuesday, March 5: There are no REQUIRED readings due on this date, because of the upcoming Test 3. However, portions of the the following readings are RECOMMENDED. See the notes below each listed section for details.
    • Section 11.1: Generating permutations and combinations
      • For the final, all I will expect you to know is the material on Lexicographic Order, which is the portion of the chapter up through and including Participation Activity 11.1.2. So you should read at least that far. I plan to cover this material on Tuesday March 5.
      • We will skip the remaining material in this section, since this is a course on discrete mathematics, not algorithms. However, this is material that every computer scientist should know and the presentation in the Zybook is well done, so I encourage you to read it.
    • Section 11.2: Binomial coefficients and combinatorial identities
      • We will be covering some of this material in class on Tuesday March 5, and continuing with it on Tuesday March 12. It will be required reading for Tuesday March 12. I recommend that for Tuesday March 5 you read up through and including Participation Activity 11.2.4.
  • Thursday, March 7: No readings due (Test 3)
• Week 10:
  • Tuesday, March 12:
    • Section 11.2: Binomial coefficients and combinatorial identities
    • Section 11.3: The pigeonhole principle
  • Thursday, March 14:
    • Section 12.1: Probability of an event