The Hong Kong University of Science and Technology

Discrete Mathematical Tools for Computer Science Specialization

The Hong Kong University of Science and Technology

Discrete Mathematical Tools for Computer Science Specialization

Master Core Discrete Math for Computer Science. Build mathematical reasoning skills for algorithm design, analysis, and problem solving.

Included with Coursera Plus

Get in-depth knowledge of a subject
Beginner level

Recommended experience

4 weeks to complete
at 10 hours a week
Flexible schedule
Learn at your own pace
Get in-depth knowledge of a subject
Beginner level

Recommended experience

4 weeks to complete
at 10 hours a week
Flexible schedule
Learn at your own pace

What you'll learn

  • Apply discrete math to analyze algorithms and solve CS problems.

    Reason about algorithm efficiency mathematically.

Details to know

Shareable certificate

Add to your LinkedIn profile

Taught in English
Recently updated!

February 2026

See how employees at top companies are mastering in-demand skills

 logos of Petrobras, TATA, Danone, Capgemini, P&G and L'Oreal

Advance your subject-matter expertise

  • Learn in-demand skills from university and industry experts
  • Master a subject or tool with hands-on projects
  • Develop a deep understanding of key concepts
  • Earn a career certificate from The Hong Kong University of Science and Technology

Specialization - 3 course series

What you'll learn

  • Apply counting techniques to compute possibilities in algorithms and data structures.

  • Apply rules of inference and proof techniques to verify correctness of statements.

  • Use sets, relations, and functions to represent and analyse computational structures.

What you'll learn

  • Use propositional and predicate logic to model and reason about computer science problems.

  • Use permutations, combinations, and inclusion–exclusion to solve combinatorial problems.

  • Analyse uncertainty using probability, conditional probability, and random variables.

What you'll learn

  • Analyse algorithm efficiency using asymptotic growth and mathematical reasoning.

  • Apply number theory concepts to algorithms and basic cryptographic systems.

  • Design and reason about recursive algorithms using induction and recurrence relations.

Earn a career certificate

Add this credential to your LinkedIn profile, resume, or CV. Share it on social media and in your performance review.

Instructor

Kenneth Wai-Ting Leung
The Hong Kong University of Science and Technology
8 Courses 222,936 learners

Offered by

You might also like

Why people choose Coursera for their career

Felipe M.

Learner since 2018
"To be able to take courses at my own pace and rhythm has been an amazing experience. I can learn whenever it fits my schedule and mood."

Jennifer J.

Learner since 2020
"I directly applied the concepts and skills I learned from my courses to an exciting new project at work."

Larry W.

Learner since 2021
"When I need courses on topics that my university doesn't offer, Coursera is one of the best places to go."

Chaitanya A.

"Learning isn't just about being better at your job: it's so much more than that. Coursera allows me to learn without limits."
Coursera Plus

Open new doors with Coursera Plus

Unlimited access to 10,000+ world-class courses, hands-on projects, and job-ready certificate programs - all included in your subscription

Advance your career with an online degree

Earn a degree from world-class universities - 100% online

Join over 3,400 global companies that choose Coursera for Business

Upskill your employees to excel in the digital economy

Frequently asked questions