Kenji Watanabe

Discrete Structures I builds the mathematical vocabulary computer science depends on: logic, sets, functions, and basic proof technique. Rather than treating this as abstract mathematics for its own sake, the course consistently ties each idea back to a computing problem — why a search terminates, why an argument about correctness holds, why two representations of the same information are equivalent.

Data Structures & Algorithms is where students stop asking only "does this work?" and start asking "how well does this work, and why?" The course covers the core data structures used throughout the rest of the curriculum — stacks, queues, trees, hash tables, graphs — alongside the analytical tools to reason about their time and space costs. Every structure is motivated by a problem it solves better than the alternatives.