Moocable is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

CS202: Discrete Structures

Description

This course covers topics in discrete structures such as sets, counting theory, mathematical logic, proofs, probability, recursion, graphs, trees, and finite-state automata. Students will learn how to analyze and solve problems using these mathematical concepts. The teaching method includes lectures, problem-solving exercises, and a final exam. This course is intended for students studying computer science or related fields who need a strong foundation in discrete mathematics.

Tags

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

Online Courses

Saylor Academy

CS202: Discrete Structures

Affiliate notice

  • Type
    Online Courses
  • Provider
    Saylor Academy

This course covers topics in discrete structures such as sets, counting theory, mathematical logic, proofs, probability, recursion, graphs, trees, and finite-state automata. Students will learn how to analyze and solve problems using these mathematical concepts. The teaching method includes lectures, problem-solving exercises, and a final exam. This course is intended for students studying computer science or related fields who need a strong foundation in discrete mathematics.

  • 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