OKSTEM College · AS Computer Science

CS 121 — Discrete Mathematics

Covers mathematical foundations essential for CS: logic, proof techniques, set theory, combinatorics, graph theory, Boolean algebra, and formal languages.

Start Course →

12 Lessons

Sets, Relations & Functions

Propositional Logic & Truth Tables

Predicate Logic & Quantifiers

Proof Techniques: Direct & Contrapositive

Proof by Induction

Counting & Combinatorics

Permutations & Combinations

Graph Theory: Definitions & Representations

Graph Traversal: BFS & DFS

Trees & Spanning Trees

Boolean Algebra & Logic Circuits

Automata & Formal Languages

Learning Outcomes

Write and evaluate propositional and predicate logic expressions
Construct direct proofs, proofs by contradiction, and by induction
Apply counting principles, permutations, and combinations
Represent and traverse graphs using BFS and DFS
Minimize Boolean expressions using Karnaugh maps
Describe regular and context-free languages with automata