Discrete Mathematics

Discrete math is the language CS is written in — instead of continuous curves and limits, you reason about finite, countable structures: propositions, sets, relations, graphs, trees, and the logic that ties them together. The work is mostly problem sets where you'll prove things rigorously (direct, contrapositive, induction), trace algorithms on graphs, and translate circuits into Boolean expressions, assessed through two midterms and a final. It's the formal-reasoning backbone for almost everything that follows in CTIS — data structures, algorithms, databases, automata — so the habits of careful definition and proof you build here pay off for years.