YoVDO

CS202: Discrete Structures

Offered By: Saylor Academy

Tags

Discrete Mathematics Courses Mathematical logic Courses Probability Courses Recursion Courses

Course Description

Overview

Explore fundamental concepts in discrete mathematics, including set theory, counting techniques, logic, mathematical induction, probability, recursion, graphs, trees, and finite-state automata in this comprehensive 44-hour course. Develop problem-solving skills and gain a solid foundation in discrete structures essential for computer science and related fields.

Syllabus

  • Course Introduction
  • Unit 1: Sets, Set Relations, and Set Functions
  • Unit 2: Counting Theory
  • Unit 3: Mathematical Logic
  • Unit 4: Mathematical Induction and Proofs
  • Unit 5: Probability
  • Unit 6: Recursion
  • Unit 7: Graphs
  • Unit 8: Trees
  • Unit 9: Finite-State Automata
  • Study Guide
  • Course Feedback Survey
  • Certificate Final Exam

Related Courses

Introduction to Logic
Stanford University via Coursera Logic: Language and Information 1
University of Melbourne via Coursera Logic: Language and Information 2
University of Melbourne via Coursera Information Service Engineering
openHPI Language, Proof and Logic
Stanford University via edX