Divide and Conquer, Sorting and Searching, and Randomized Algorithms

68 reviews

The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algor…

• Coursera
• 17 hours worth of material, 4 weeks long
• 6th Feb, 2023
• Free Online Course (Audit)

• Best of All Time

Computing in Python IV: Objects & Algorithms

95 reviews

Learn about recursion, search and sort algorithms, and object-oriented programming in Python.

• edX
• 9-10 hours a week, 5 weeks long
• Self paced
• Free Online Course (Audit)

Algorithms, Part I

59 reviews

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data struct…

• Coursera
• 54 hours worth of material, 6 weeks long
• 13th Feb, 2023
• Free Online Course (Audit)

• Best of All Time

Computing in Python III: Data Structures

44 reviews

Learn more complex ways of handling data, including files, lists, and dictionaries for building complex programs.

• edX
• 9-10 hours a week, 5 weeks long
• Self paced
• Free Online Course (Audit)

Algorithms, Part II

21 reviews

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data struct…

• Coursera
• 63 hours worth of material, 6 weeks long
• 6th Feb, 2023
• Free Online Course (Audit)

Automata Theory

20 reviews

This course covers the theory of automata and languages. We begin with a study of finite automata and the languages they can define (the so-called "regular languages." Topics include deterministic and nondeterministic automata, regular expressions, and t…

• edX
• 5-10 hours a week, 7 weeks long
• Self paced
• Free Online Course (Audit)

Algorithms for Big Data (COMPSCI 229r)

4 reviews

The series of 25 lectures from Harvard University would cover topics such as Sketching/Streaming, Dimensional Reduction, large scale machine learning, deal with regression problems, external memory problem (measure disk I/Os instead of the number of inst…

• YouTube
• 34 hours worth of material
• On-Demand
• Free Online Course

Graph Search, Shortest Paths, and Data Structures

1922 ratings at Coursera

The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applic…

• Coursera
• 15 hours worth of material, 4 weeks long
• 6th Feb, 2023
• Free Online Course (Audit)

Design of Computer Programs

14 reviews

Learn how to model problems, and how to optimize performance by using some of the advanced features of Python.

• Udacity
• 8 weeks long
• On-Demand
• Free Online Course

Principles of Computing (Part 1)

30 reviews

This two-part course builds upon the programming skills that you learned in our Introduction to Interactive Programming in Python course. We will augment those skills with both important programming practices and critical mathematical problem solving sk…

• Coursera
• 19 hours worth of material, 5 weeks long
• 27th Feb, 2023
• Free Online Course (Audit)

Text Retrieval and Search Engines

14 reviews

Recent years have seen a dramatic growth of natural language text data, including web pages, news articles, scientific literature, emails, enterprise documents, and social media such as blog articles, forum posts, product reviews, and tweets. Text data a…

• Coursera
• 31 hours worth of material, 6 weeks long
• 6th Feb, 2023
• Free Online Course (Audit)

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

1216 ratings at Coursera

The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).

• Coursera
• 15 hours worth of material, 4 weeks long
• 6th Feb, 2023
• Free Online Course (Audit)

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

785 ratings at Coursera

The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis…

• Coursera
• 14 hours worth of material, 4 weeks long
• 13th Feb, 2023
• Free Online Course (Audit)

Advanced Algorithms (COMPSCI 224)

2 reviews

CS 224 is an advanced course in algorithm design, and topics we will cover include the word RAM model, data structures, amortization, online algorithms, linear programming, semidefinite programming, approximation algorithms, hashing, randomized algorithm…

• YouTube
• 35 hours worth of material
• On-Demand
• Free Online Course

Introduction to Algorithms (Fall 2011)

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems.

• MIT OpenCourseWare
• 42 hours worth of material
• On-Demand
• Free Online Course