About this Course

680,212 recent views

Learner Career Outcomes

33%

started a new career after completing these courses

33%

got a tangible career benefit from this course

15%

got a pay increase or promotion
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.
Intermediate Level
Approx. 37 hours to complete
English

What you will learn

  • Essential algorithmic techniques

  • Design efficient algorithms

  • Practice solving algorithmic interview problems

  • Implement efficient and reliable solutions

Skills you will gain

Dynamic ProgrammingDebuggingSoftware TestingAlgorithmsComputer Programming

Learner Career Outcomes

33%

started a new career after completing these courses

33%

got a tangible career benefit from this course

15%

got a pay increase or promotion
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.
Intermediate Level
Approx. 37 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

Content RatingThumbs Up92%(123,924 ratings)Info
Week
1

Week 1

5 hours to complete

Programming Challenges

5 hours to complete
6 videos (Total 48 min), 8 readings, 3 quizzes
6 videos
Solving the Sum of Two Digits Programming Challenge (screencast)6m
Solving the Maximum Pairwise Product Programming Challenge: Improving the Naive Solution, Testing, Debugging13m
Stress Test - Implementation8m
Stress Test - Find the Test and Debug7m
Stress Test - More Testing, Submit and Pass!8m
8 readings
Rules on the academic integrity in the course10m
Companion MOOCBook10m
What background knowledge is necessary?10m
Optional Videos and Screencasts10m
Alternative testing guide in Python10m
Maximum Pairwise Product Programming Challenge10m
Using PyCharm to solve programming challenges10m
Acknowledgements2m
1 practice exercise
Solving Programming Challenges20m
Week
2

Week 2

5 hours to complete

Algorithmic Warm-up

5 hours to complete
12 videos (Total 77 min), 3 readings, 4 quizzes
12 videos
Coming Up3m
Problem Overview3m
Naive Algorithm5m
Efficient Algorithm3m
Problem Overview and Naive Algorithm4m
Efficient Algorithm5m
Computing Runtimes10m
Asymptotic Notation6m
Big-O Notation6m
Using Big-O10m
Course Overview10m
3 readings
Resources2m
Resources2m
Resources2m
3 practice exercises
Logarithms10m
Big-O10m
Growth rate10m
Week
3

Week 3

7 hours to complete

Greedy Algorithms

7 hours to complete
10 videos (Total 56 min), 1 reading, 8 quizzes
10 videos
Car Fueling7m
Car Fueling - Implementation and Analysis9m
Main Ingredients of Greedy Algorithms2m
Celebration Party Problem6m
Efficient Algorithm for Grouping Children5m
Analysis and Implementation of the Efficient Algorithm5m
Long Hike6m
Fractional Knapsack - Implementation, Analysis and Optimization6m
Review of Greedy Algorithms2m
1 reading
Resources2m
2 practice exercises
Greedy Algorithms10m
Fractional Knapsack10m
Week
4

Week 4

8 hours to complete

Divide-and-Conquer

8 hours to complete
20 videos (Total 157 min), 5 readings, 9 quizzes
20 videos
Linear Search7m
Binary Search7m
Binary Search Runtime8m
Problem Overview and Naïve Solution6m
Naïve Divide and Conquer Algorithm7m
Faster Divide and Conquer Algorithm6m
What is the Master Theorem?4m
Proof of the Master Theorem9m
Problem Overview2m
Selection Sort8m
Merge Sort10m
Lower Bound for Comparison Based Sorting12m
Non-Comparison Based Sorting Algorithms7m
Overview2m
Algorithm9m
Random Pivot13m
Running Time Analysis (optional)15m
Equal Elements6m
Final Remarks8m
5 readings
Resources10m
Resources5m
Resources10m
Resources5m
Resources10m
5 practice exercises
Linear Search and Binary Search10m
Polynomial Multiplication15m
Master Theorem10m
Sorting15m
Quick Sort15m

Reviews

TOP REVIEWS FROM ALGORITHMIC TOOLBOX

View all reviews

About the Data Structures and Algorithms Specialization

Data Structures and Algorithms

Frequently Asked Questions

More questions? Visit the Learner Help Center.