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 Theoretical Computer Science
Peking University via edX Introducción a la Teoría Combinatoria
Universidad Católica de Murcia via Miríadax 离散数学概论 Discrete Mathematics Generality
Peking University via Coursera Discrete Mathematics
Indian Institute of Technology, Ropar via Swayam Discrete Mathematics
Shanghai Jiao Tong University via Coursera