About this Course

11,682 recent views

Learner Career Outcomes

33%

started a new career after completing these courses

33%

got a tangible career benefit from this course

20%

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. 12 hours to complete
English

Skills you will gain

AlgorithmsPython ProgrammingAlgorithmic EfficiencyDynamic Programming

Learner Career Outcomes

33%

started a new career after completing these courses

33%

got a tangible career benefit from this course

20%

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. 12 hours to complete
English

Offered by

Placeholder

Rice University

Syllabus - What you will learn from this course

Week
1

Week 1

3 hours to complete

Module 3 - Core Materials

3 hours to complete
13 videos (Total 147 min), 2 readings, 1 quiz
13 videos
The sorting problem 11m
A simple quadratic algorithm 10m
Illustrating MergeSort 13m
The recurrence for MergeSort 9m
The Master Theorem and MergeSort efficiency 12m
Linear vs. binary search 12m
Efficiency of binary search 10m
Class structure (from part 1)9m
Coding styles and standards - PoC11m
Testing and machine grading - PoC10m
Plotting data - PoC14m
Peer assessment - "We want a shrubbery!" - IIPP10m
2 readings
Class notes10m
Coding notes10m
1 practice exercise
Homework #330m
Week
2

Week 2

4 hours to complete

Module 3 - Project and Application

4 hours to complete
4 readings
4 readings
Project #3 Description10m
Tests and Tips for Implementing the Clustering Methods10m
Application #3 Description10m
Application #3 Solution10m
Week
3

Week 3

2 hours to complete

Module 4 - Core Materials

2 hours to complete
7 videos (Total 87 min)
7 videos
A dynamic programming algorithm 14m
Illustrating the DP algorithm 11m
Running time of the DP algorithm 8m
DP vs. recursive implementation 13m
Global pairwise sequence alignment 14m
Local pairwise sequence alignment 8m
1 practice exercise
Homework 430m
Week
4

Week 4

3 hours to complete

Module 4 - Project and Application

3 hours to complete
1 video (Total 8 min), 3 readings, 2 quizzes
1 video
3 readings
Project #4 Description10m
Application #4 Description10m
Application #4 Solution10m

Reviews

TOP REVIEWS FROM ALGORITHMIC THINKING (PART 2)

View all reviews

About the Fundamentals of Computing Specialization

Fundamentals of Computing

Frequently Asked Questions

More questions? Visit the Learner Help Center.