ICS 6D - Winter, 2024 (Dillencourt)

Topics covered by lecture

• Lecture 1 - Tuesday, January 9:
  • Boolean Logic part 1. [Chapter 1 notes, Slides 1 through 22]
• Lecture 2 - Thursday, January 11:
  • Boolean Logic part 2. [Chapter 1 notes, Slides 23 through 25]
  • Sets part 1. [Chapter 2 notes, Slides 1 through 15]
• Lecture 3 - Tuesday, January 16:
  • Sets part 2. [Chapter 2 notes, Slides 16 through 17]
  • Functions [Chapter 4 notes, all (Slides 1 through 16)]
  • Sequences; Recurrence Relations; Summations part 1. [Chapter 8 notes, Slides 1 through 13]
• Lecture 4 - Thursday, January 18:
  • Summations part 2, Induction part 1. [Chapter 8 notes, Slides 14 through 33]
• Lecture 5 - Tuesday, January 23:
  • Induction, part 2. Strong Induction [Chapter 8 notes, Slides 34 through 43]
  • Discussion, questions about upcoming Test 1
• Thursday, January 25: No lecture (Test 1)
• Lecture 6 - Tuesday, January 30:
  • Recursive definitions. Structural Induction. Recursive Algorithms, part 1. [Chapter 8 notes, Slides 46 through 66]
  • Note: slides 44 and 45 were skipped.
• Lecture 7 - Thursday, February 1:
  • Recursive Algorithms, part 2. Induction and Recursive Algorithms. Solving Linear Recurrence Relations [Chapter 8 notes, Slides 67 through 88]
  • Note: slides 89 and 90 were skipped.
• Lecture 8 - Tuesday, February 6:
  • Integer division and the Division Algorithm. Modular Arithmetic. Prime factorizations, part 1. [Chapter 9 notes, Slides 1 through 26]
• Lecture 9 - Thursday, February 8:
  • Prime factorizations, part 2. Primality testing. GCD (Greatest Common Divisor) and Euclid's algorithm, part 1. [Chapter 9 notes, Slides 27 through 43]
• Lecture 10 - Tuesday, February 13:
  • GCD (Greatest Common Divisor) and Euclid's algorithm, part 2. Number representation, part 1 [Chapter 9 notes, Slides 44 through 52]
• Thursday, February 15: No lecture (Test 2)
• Lecture 11 - Tuesday, February 20:
  • Number representation, part 2. Fast exponentiation. Cryptography basics, part 1. [Chapter 9 notes, Slides 53 through 76]
• Lecture 12 - Thursday, February 22:
  • Cryptography basics, part 2. Public key encryption. The RSA algorithm [Chapter 9 notes, Slides 77 through 92]
  • Counting basics. Bijection rule, sum rule, product rule, generalized product rule. [Chapter 10 notes, Slides 1 through 20]
• Lecture 13 - Tuesday, February 27:
  • Counting permutations. Counting subsets. Subset and permutation examples. Counting by complement. [Chapter 10 notes, Slides 21 through 45]
• Lecture 14 - Thursday, February 29:
  • Permutations with repetitions. Counting multisets. Assignment problems: Balls in bins. [Chapter 10 notes, Slides 46 through 67]
• Lecture 15 - Tuesday, March 5:
  • Inclusion/Exculsion [Chapter 10 notes, Slides 68 through 83]
  • Note: slide 84 was skipped.
  • Generating Permutations and Combinations. Binomial Coefficients and Combinatorial Identitities, Part 1. [Chapter 11 notes, Slides 1 through 16]
• Thursday, March 7: No lecture (Test 3)
• Lecture 16 - Tuesday, March 12:
  • Binomial Coefficients and Combinatorial Identitities, Part 2. The Pigeonhole Principle [Chapter 11 notes, Slides 17 through 41]
• Thursday, March 14:
  • No lecture due to classroom equipment failure
  • Discussion, questions about upcoming Final Exam