Students will be introduced to discrete structures and techniques for computing. The course, which is the first in the two-term sequence, aims to convey the skills in discrete mathematics that are used in the study and practice of computer science. Topics include: Sets; Graphs and trees; Functions: properties, recursive definitions, solving recurrences; Relations: properties, equivalence, partial order; Proof techniques: inductive proof; Counting techniques and discrete probability. 01/05/2026 - 03/21/2026
- Teacher: Jaylin Kuoha