Discrete Mathematics Courses and Certifications

Sundeep Saradhi Kanthety

Types of Functions in Discrete Mathematics - Set Theory - One to One, Onto, Bijective etc.

Explore different types of functions in discrete mathematics, including one-to-one, onto, and bijective functions, along with set properties, operations, and classifications.

• YouTube
• 22 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Compositions of Functions in Discrete Mathematics and Set Theory

Explore function types (one-to-one, onto, bijective) and set properties (idempotence, associativity, De-Morgan's Law) in discrete mathematics, with comprehensive coverage of set operations and classifications.

• YouTube
• 16 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Tautology, Contradiction and Contingency in Discrete Mathematics

Explore fundamental concepts of propositional logic in discrete mathematics, including tautology, contradiction, and contingency, with practical examples and logical connectives.

• YouTube
• 19 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Binomial Theorem with Examples - Expansion, Coefficients, and Terms in Discrete Mathematics

Master the binomial theorem through clear explanations of expansion, coefficients, and terms with practical examples in discrete mathematics.

• YouTube
• 20 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Generating Function for Sequence in Recurrence Relations - Discrete Mathematics

Delve into the mathematical approach of generating functions for sequences in recurrence relations, exploring key concepts in discrete mathematics and problem-solving techniques.

• YouTube
• 16 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Principle of Inclusion and Exclusion with Examples - Discrete Mathematics

Master the Principle of Inclusion and Exclusion through clear examples and problem-solving techniques in discrete mathematics, focusing on combinatorial counting methods for sets with overlapping elements.

• YouTube
• 19 minutes
• On-Demand
• Free Video

离散数学概论 Discrete Mathematics Generality

281 ratings at Coursera

离散数学是计算机科学的基础理论，离散结构的基础知识和逻辑思维的形式化是信息技术类学生的基本功，离散数学的基本概念是理科专业学生进行信息类课程学习的重要基础。 本课程介绍计算机科学和信息技术理论基础的概念和思想方法，介绍数理逻辑、集合论、图论、抽象代数和形式语言与自动机等各部分的基本概念，介绍离散数学基本概念和空间信息技术之间的联系与结合，培养学生理解和掌握离散数学基本概念，采用形式化方法分析问题，并能自觉运用逻辑分析、结构层次分析和同构类比等思想方法解决问题的能力。

• Coursera
• 27 hours
• On-Demand
• Paid Course

Discrete Mathematics

Explore logic, probability, graph theory, relations, and combinatorics in this comprehensive mathematics course, enhancing problem-solving skills and mathematical reasoning abilities.

• YouTube
• 1 day 4 hours
• On-Demand
• Free Video

Discrete Mathematics for CS in Arabic - الرياضيات المتقطعة

31 ratings at Udemy

Discrete Mathematics is the language of Computer Science. One needs to be fluent in it to work in many fields in CS.

• Udemy
• 1 day 4 hours 48 minutes
• On-Demand
• Paid Course

Master Discrete Math 2020: More Than 5 Complete Courses In 1

482 ratings at Udemy

Learn Discrete Mathematics In This Course: 300+ Lectures/Quizzes And 30 Assignments With 500+ Questions & Solutions

• Udemy
• 16 hours 4 minutes
• On-Demand
• Paid Course

Microcredential

Essential Mathematics for Computer Science

Master discrete mathematics, logic, algebra, calculus, and algorithmic reasoning to build the rigorous mathematical foundation essential for computing, data science, and software engineering.

• Coursera
• 8 weeks, 10 hours a week
• On-Demand
• Paid Course
• 5 courses

Discrete Math for Computer Science - Logic & Set Theory

Master propositional and predicate logic, set theory, and formal reasoning to build mathematical foundations essential for algorithm design and program correctness.

• Coursera
• 9 hours 24 minutes
• On-Demand
• Paid Course

Microcredential

Discrete Mathematical Tools for Computer Science

Master discrete mathematics fundamentals for computer science: logic, counting, algorithms, recursion, and probability through rigorous problem-solving and proofs.

• Coursera
• 4 weeks, 10 hours a week
• On-Demand
• Paid Course
• 3 courses

Discrete Math for Computer Science - Algorithms & Recursion

Master number theory, cryptography, and recursive algorithms while analyzing efficiency through mathematical induction and asymptotic notation.

• Coursera
• 13 hours 44 minutes
• On-Demand
• Paid Course

Discrete Math for Computer Science - Counting & Probability

Master combinatorial counting and probability theory to analyze algorithms, model uncertainty, and solve complex computational problems with systematic mathematical precision.

• Coursera
• 14 hours 21 minutes
• On-Demand
• Paid Course