Test 3 Information - ICS 6D - Winter, 2024 (Dillencourt)

FOR GENERAL INFORMATION ABOUT TEST RULES AND THE TEST FORMAT, CLICK HERE.

Test coverage

The primary coverage area for Test 3 is the material covered in the readings and slides listed below. The test will not contain questions that focus exclusively on earlier material, but some knowledge of earlier material may be necessary.

The list of topics for Test 3 will begin where the coverage for Test 2 ended. Since the material in Section 9.5 (Greatest common divisor and Euclid's algorithm) was only partially covered on Test 2, coverage begins with this topic.

The test will focus on the following material:

• Zybook readings:
  • Chapter 9:
    • Section 9.5: Greatest common denominator and Euclid's algorithm
    • Section 9.6: Number representation
    • Section 9.7: Fast exponentiation
    • Section 9.8: Introduction to cryptography
    • Section 9.9: The RSA cryptosystem
      • You are not expected to memorize the RSA algorithm. You should be sufficiently familiar with it that if you are given the pseudocode you can apply it. For example, given the pseudocode and two chosen primes p and q, you should be able to compute the public and private keys.
  • Chapter 10:
    • Section 10.1: Sum and product rules
    • Section 10.2: The bijection rule
    • Section 10.3: The generalized product rule
    • Section 10.4: Counting permutations
    • Section 10.5: Counting subsets
    • Section 10.6: Subset and permutation examples
    • Section 10.7: Counting by complement
    • Section 10.8: Permutations with repetitions
    • Section 10.9: Counting multisets
    • Section 10.10: Assignment problems: Balls in bins
• Class lecture notes/slides:
  • Chapter 9 Notes: Slides 36 through 92
  • Chapter 10 Notes: Slides 1 through 67