Back to Course Catalog
CS101
Semester 1 • Undergraduate
3 Academic Credits
Introduction to Computing & Discrete Math
Foundations of computation, propositional logic, set theory, graph theory, and algorithmic problem-solving.
Course Learning Outcomes
Propositional Logic
Theoretical foundation and algorithmic problem solving with faculty evaluation.
Proof by Induction
Theoretical foundation and algorithmic problem solving with faculty evaluation.
Set Theory
Theoretical foundation and algorithmic problem solving with faculty evaluation.
Recurrence Relations
Theoretical foundation and algorithmic problem solving with faculty evaluation.
Curriculum Chapter Syllabus
Chapter 01
Foundational Theory & Invariants
Asymptotic notation, amortized complexity, and invariant proofs.
Big-O / Omega / ThetaMaster TheoremLoop Invariants
Chapter 02
Linear & Hierarchical Data Structures
Dynamic arrays, linked allocation, stacks, queues, and priority heaps.
Fibonacci HeapsArray Doubling AnalysisCircular Queues
Chapter 03
Self-Balancing Binary Search Trees
AVL height balances, single/double rotations, and Red-Black tree coloring rules.
AVL Balance FactorRed-Black InvariantsSplay Trees
Chapter 04
Graph Traversals & Optimal Pathing
Breadth/depth traversals, topological sorting, shortest paths, and minimum spanning trees.
Dijkstra AlgorithmBellman-Ford Dynamic ProgrammingKruskal & Prim