About this Course

50,508 recent views
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Beginner Level
Approx. 13 hours to complete
English
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Beginner Level
Approx. 13 hours to complete
English

Offered by

Placeholder

University of California San Diego

Placeholder

National Research University Higher School of Economics

Syllabus - What you will learn from this course

Week
1

Week 1

5 hours to complete

Traveling Salesman Problem

5 hours to complete
4 videos (Total 43 min), 2 readings, 4 quizzes
4 videos
Shortest Common Superstring Problem10m
Brute Force Search11m
Nearest Neighbor8m
2 readings
Rules on the academic integrity in the course10m
Additional Materials10m
4 practice exercises
Cycle Weight20m
Brute Force Algorithm30m
Average Weight30m
Nearest Neighbors30m
Week
2

Week 2

4 hours to complete

Exact Algorithms

4 hours to complete
4 videos (Total 49 min)
4 videos
Dynamic Programming: Main Ideas9m
Dynamic Programming: Representing Subsets10m
Dynamic Programming: Code13m
2 practice exercises
Branch and Bound1h
Dynamic Programming1h
Week
3

Week 3

4 hours to complete

Approximation Algorithms

4 hours to complete
2 videos (Total 20 min)
2 videos
Local Search8m
1 practice exercise
2-Approximation2h 2m

Reviews

TOP REVIEWS FROM DELIVERY PROBLEM

View all reviews

About the Introduction to Discrete Mathematics for Computer Science Specialization

Introduction to Discrete Mathematics for Computer Science

Frequently Asked Questions

More questions? Visit the Learner Help Center.