Welcome to the Discrete Mathematics course, your gateway to mastering the mathematical foundations essential for modern computing and data science. Designed for aspiring software engineers, computer scientists, data analysts, and cryptographers, this course is ideal for undergraduate students, professionals looking to enhance their analytical skills, and anyone interested in the theoretical underpinnings of computer science.
Discrete Mathematics for Computer Science and Engineering
Discrete Mathematics for Computer Science and Engineering
本课程是 Mathematics for Engineering 专项课程 的一部分
包含在 
中
您将学到什么
Analyse and assess complex problems by applying set theory and functions, ensuring accurate and efficient solutions are developed.
Design and evaluate graph-based models to optimise algorithms and enhance network analysis in cryptography and database management contexts.
Critique mathematical proofs and reasoning to enhance problem-solving skills in varied scenarios.
Innovate discrete structures to efficiently solve problems in data structures, operating systems, and computation theory.
您将获得的技能
要了解的详细信息
可分享的证书
添加到您的领英档案
最近已更新！
August 2025
作业
129 项作业
授课语言：英语（English）
了解顶级公司的员工如何掌握热门技能
积累特定领域的专业知识
本课程是 Mathematics for Engineering 专项课程 专项课程的一部分
在注册此课程时，您还会同时注册此专项课程。
- 向行业专家学习新概念
- 获得对主题或工具的基础理解
- 通过实践项目培养工作相关技能
- 获得可共享的职业证书
该课程共有10个模块
In this module, you will first learn the basics of formal logic. With that foundational knowledge, you will learn multiple techniques to write mathematical proof in order to prove a statement. You will gain insights into how to choose proof methods, including direct proofs, indirect proofs, trivial proofs, and vacuous proofs.
涵盖的内容
13个视频9篇阅读材料11个作业1个插件
In this module, you will learn about more proof techniques, including proof by contradiction, existence proofs, and proof by cases. You will recognise some common fallacies in incorrect proofs. Following this, you will learn about mathematical induction and strong mathematical induction. You will gain insights into writing inductive proof for standard theorems and problems. You will learn about sequences and summations. You will also learn about arithmetic, geometric, and harmonic progressions and their corresponding series.
涵盖的内容
14个视频13篇阅读材料13个作业
This module introduces you to sets and functions. You will get acquainted with Venn diagrams, the cardinality of a set, power sets, set operations, set identities, and computer representation of sets. You will learn about injective, surjective, and bijective functions.
涵盖的内容
17个视频15篇阅读材料15个作业
This module introduces you to relations by illustrating n-ary relations, complementary relations, and relations on a set. You will learn about reflexive, symmetric, anti-symmetric, and transitive relations. You will also learn about functionality, composite relations, representing relations, closure of relations, and applications of relations in computer science. You will also learn about the countability and uncountability of sets.
涵盖的内容
15个视频15篇阅读材料15个作业
In this module, you will learn about equivalence relations, equivalence classes, and partitions. You will gain insights into partial ordering, partial or total ordered sets, and the Hasse diagram. You will also learn about maximal and minimal elements, least upper bound (lub ) and greatest lower bounds (glb ), and lattice.
涵盖的内容
15个视频14篇阅读材料15个作业
In this module, you will learn about counting techniques, including the pigeonhole principle, permutations and combinations, and the inclusion-exclusion principle. You will gain insights into combinatorics, a subfield of discrete mathematics that deals with arrangements of discrete objects with specific constraints and the number of distinct ways of making such arrangements.
涵盖的内容
15个视频15篇阅读材料15个作业
In this module, you will learn about definitions of recursive functions. You will learn to use structural induction to prove statements that use recursive definitions. You will also learn about recurrence relations and explore some techniques to solve them.
涵盖的内容
15个视频14篇阅读材料14个作业
This module introduces you to graphs, starting from real-world examples. Following this, you will learn about rigorous definitions of graphs and techniques to represent them. You will also gain insights into bipartite graphs and graph isomorphism.
涵盖的内容
12个视频12篇阅读材料12个作业
In this module, you will learn about more advanced topics pertaining to graphs. You will learn about definitions of paths and connectivity. You will also learn about Euler and Hamilton paths, planar graphs, and graph colorings and their applications.
涵盖的内容
8个视频7篇阅读材料7个作业
This module introduces you to the fundamentals of trees and spanning trees of a graph. You will learn about algorithms to identify minimum spanning trees in a graph. Following this, the module introduces you to the notions of basic algebraic structures such as groups, semi-groups, and rings.
涵盖的内容
12个视频12篇阅读材料12个作业
获得职业证书
将此证书添加到您的 LinkedIn 个人资料、简历或履历中。在社交媒体和绩效考核中分享。
位教师
从 Algorithms 浏览更多内容
状态：预览Shanghai Jiao Tong University
状态：免费试用University of California San Diego
状态：免费试用University of London
状态：免费试用University of Colorado System
人们为什么选择 Coursera 来帮助自己实现职业发展
Felipe M.
自 2018开始学习的学生
''能够按照自己的速度和节奏学习课程是一次很棒的经历。只要符合自己的时间表和心情，我就可以学习。'
Jennifer J.
自 2020开始学习的学生
''我直接将从课程中学到的概念和技能应用到一个令人兴奋的新工作项目中。'
Larry W.
自 2021开始学习的学生
''如果我的大学不提供我需要的主题课程，Coursera 便是最好的去处之一。'
Chaitanya A.
''学习不仅仅是在工作中做的更好：它远不止于此。Coursera 让我无限制地学习。'
常见问题
To access the course materials, assignments and to earn a Certificate, you will need to purchase the Certificate experience when you enroll in a course. You can try a Free Trial instead, or apply for Financial Aid. The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile.
Yes. In select learning programs, you can apply for financial aid or a scholarship if you can’t afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, you’ll find a link to apply on the description page.
更多问题
提供助学金，