Course Overview
Logic and Discrete Math provides the formal mathematical foundation for computer science. Learners study propositions, predicates, sets, relations, functions, combinatorics, graph structures, and proof techniques used to reason about algorithms, programs, data structures, networks, and computational systems.
Logic and Discrete Math Topics
-
Propositional Logic
Focused study of propositional logic as a core topic within logic and discrete math, emphasizing conceptual understanding, technical vocabulary, reasoning patterns, and links to practical computing systems.
-
Predicate Logic
Focused study of predicate logic as a core topic within logic and discrete math, emphasizing conceptual understanding, technical vocabulary, reasoning patterns, and links to practical computing systems.
-
Set Theory
Focused study of set theory as a core topic within logic and discrete math, emphasizing conceptual understanding, technical vocabulary, reasoning patterns, and links to practical computing systems.
-
Relations and Functions
Focused study of relations and functions as a core topic within logic and discrete math, emphasizing conceptual understanding, technical vocabulary, reasoning patterns, and links to practical computing systems.
-
Combinatorics
Focused study of combinatorics as a core topic within logic and discrete math, emphasizing conceptual understanding, technical vocabulary, reasoning patterns, and links to practical computing systems.
-
Graph Theory
Focused study of graph theory as a core topic within logic and discrete math, emphasizing conceptual understanding, technical vocabulary, reasoning patterns, and links to practical computing systems.
-
Proof Techniques
Focused study of proof techniques as a core topic within logic and discrete math, emphasizing conceptual understanding, technical vocabulary, reasoning patterns, and links to practical computing systems.