About this Course

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.
Advanced Level

Completion of previous courses. Calculus, probability theory: distributions, expectations and moments. Some programming experience with Python.

Approx. 9 hours to complete
English

What you will learn

  • Describe basic algorithm design techniques

  • Create divide and conquer, dynamic programming, and greedy algorithms

  • Understand intractable problems, P vs NP and the use of integer programming solvers to tackle some of these problems

Skills you will gain

Analysis of AlgorithmsAlgorithm DesignPython ProgrammingData Structure DesignIntractability
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.
Advanced Level

Completion of previous courses. Calculus, probability theory: distributions, expectations and moments. Some programming experience with Python.

Approx. 9 hours to complete
English

Offered by

Placeholder

University of Colorado Boulder

Syllabus - What you will learn from this course

Week
1

Week 1

2 hours to complete

Divide and Conquer Algorithms

2 hours to complete
3 videos (Total 92 min), 2 readings
Week
2

Week 2

2 hours to complete

Dynamic Programming Algorithms

2 hours to complete
5 videos (Total 106 min)
Week
3

Week 3

2 hours to complete

Greedy Algorithms

2 hours to complete
5 videos (Total 111 min)
Week
4

Week 4

2 hours to complete

Intractability and Supplement on Quantum Computing

2 hours to complete
4 videos (Total 132 min)

About the Data Structures and Algorithms Specialization

Data Structures and Algorithms

Frequently Asked Questions

More questions? Visit the Learner Help Center.