CS202: Resources | Saylor Academy

Topic	Name	Description
	Course Syllabus

© Saylor Academy 2010-2024 except as otherwise noted. Excluding course final exams, content authored by Saylor Academy is available under a Creative Commons Attribution 3.0 Unported license. Third-party materials are the copyright of their respective owners and shared under various licenses. See detailed licensing information. Saylor Academy®, Saylor.org®, and Harnessing Technology to Make Education Free® are trade names of the Constitution Foundation, a 501(c)(3) organization through which our educational activities are conducted.

Course Introduction

Course Syllabus

Unit 1: Sets, Set Relations, and Set Functions

1.1: Set Notation and Relations

1.2: Basic Set Operations

1.3: Cartesian Products and Power Sets

1.4: Summation Notation and Generalizations

Unit 1 Assessment

Unit 2: Counting Theory

2.1: Rule of Products

2.2: Permutations

2.3: Partitions of Sets and the Law of Addition

2.4: Combinations and the Binomial Theorem

Unit 2 Assessment

Unit 3: Mathematical Logic

3.1: Propositions and Logical Operators

3.2: Truth Tables and Propositions Generated by a Set

3.3: Equivalence and Implication

3.4: The Laws of Logic

Unit 3 Assessment

Unit 4: Mathematical Induction and Proofs

4.1: Mathematical Systems

4.2: Direct Proof

4.3: Indirect Proof

4.4: Propositions over a Universe

4.5: Mathematical Induction

4.6: Strong Induction

Unit 4 Assessment

Unit 5: Probability

5.1: Introduction

5.2: Sample Spaces, Events, and Their Probabilities

5.3: Complements, Intersections, and Unions

5.4: Conditional Probability and Independent Events

Unit 5 Assessment

Unit 6: Recursion

6.1: Introduction

6.2: Transitioning from Informal to Formal

6.3: The Many Faces of Recursion

6.4: Sequences

6.5: Recursion in the Real World

Unit 6 Assessment

Unit 7: Graphs

7.1: A Less-Formal Introduction

7.2: A Formal Introduction

7.3: Graph Structures

7.4: Graph Node Connectivity

7.5: Graph Traversals

7.6: Graph Optimization

7.7: Planarity and Colorings

Unit 7 Assessment

Unit 8: Trees

8.1: Introduction

8.2: Spanning Trees

8.3: Rooted Trees

8.4: Binary Trees

Unit 8 Assessment

Unit 9: Finite-State Automata

9.1: Introduction

9.2: State Transition Diagrams

9.3: Finite-State Machine States

9.4: Putting the Basics to Use

Unit 9 Assessment

Study Guide

Course Feedback Survey

Certificate Final Exam

Proctor-Verified Final Exam

Archived Materials