Introduction to Algorithms

View Course Materials

Buying via our links supports this free directory · Affiliate disclosure.
Course facts
  • Payment: Free, no certificate
  • Credits: Non Credit
  • Learning style: Self-paced, start anytime
  • Resources: Exam Solutions; Exams; Lecture Notes; Lecture Videos; Problem Set Solutions; Problem Sets
MIT OpenCourseWare details
  • As taught in: Spring 2020
  • Department: Electrical Engineering and Computer Science
Created byMIT
Available onMIT OpenCourseWareMIT OpenCourseWare

Course Details
Learning Style

Start Anytime

Level

All Levels

Study Mode

100% Online

Outcomes
Academic Credits

Non Credit

Price & Terms
Pricing Model

Free Content (No Certificate)

Technical
Content Medium

Video Based

Specification
Access

Free Access

Academic Level

Undergraduate

SKU: introduction-algorithms Category: Brand:

Data structures, sorting, hashing, graph search, shortest paths, and dynamic programming, with lecture videos, notes, and problem sets.

At a glance
LevelAll Levels
AccessFree access
FormatVideo Based
As taught inSpring 2020
DepartmentElectrical Engineering and Computer Science
Add your review
Add to wishlistAdded to wishlistRemoved from wishlist 0
Add to compare

Solving a computational problem well starts with modeling it mathematically and choosing the right data structure and algorithm. The course works through elementary data structures such as dynamic arrays, heaps, balanced binary search trees and hash tables, and classical approaches to sorting, graph searching and dynamic programming, always relating each algorithm to how it is programmed and how fast it runs.

What You Will Achieve

  • Analyze the performance of an algorithm with basic measures and techniques
  • Choose among dynamic arrays, heaps, binary search trees, and hash tables for a problem
  • Find shortest paths with breadth-first search, Bellman-Ford, and Dijkstra’s algorithm
  • Design dynamic programming solutions by defining recursive subproblems


Program Overview

Data Structures and Sorting

Storing data so that common operations are fast.

  • Data structures and dynamic arrays
  • Sorting, hashing, and linear sorting
  • Binary trees and AVL trees
  • Binary heaps

Graph Algorithms

Searching graphs and finding shortest paths.

  • Breadth-first and depth-first search
  • Weighted shortest paths and Bellman-Ford
  • Dijkstra’s and Johnson’s algorithms

Dynamic Programming and Complexity

Breaking problems into subproblems, and the limits of what is efficient.

  • Recursive algorithms and subproblems
  • All-pairs shortest paths and other examples
  • Pseudopolynomial time and complexity

Course Completion


Job Outlook

Algorithms and data structures are core to software engineering, technical interviews, systems design and research, and to any role that writes code that has to scale.


Before you start: 6.0001 Introduction to Computer Science and Programming in Python: Basic experience programming in Python 3. 6.042J Mathematics for Computer Science: Basic knowledge of discrete mathematics: set theory, relations and logic, combinatorics, proofs, recursion, number theory, graph theory, and probability. We strongly caution against taking 6.006 before having fulfilled the listed prerequisites. We will evaluate your understanding of the prerequisite material via a short Problem Set 0 assignment. All students must submit this evaluation, regardless of prerequisite status. We will assign each submission a letter grade. If you receive a C or below on the assignment, you will need to meet with a staff member to review your performance before you will be allowed to take the class. We will not grade any other assignments from you until a good faith attempt of Problem Set 0 has been submitted. The grade for this assignment will NOT affect your final grade in the class, but turning it in is required for taking this class.

Our take

Good for: Programmers who want a rigorous grounding in algorithms and data structures, with recorded lectures and full solutions to practice with.

Keep in mind: The course strongly cautions against starting before its prerequisites, and a short first problem set checks that background before the main material.

Bottom line: A recent, fully recorded algorithms course with lecture and recitation notes and solutions to every problem set, quiz, and the final.

Frequently Asked Questions

Is a textbook required?

No. The written material is the notes from lectures and recitations. Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein, third edition, is a useful reference but is not required.

Can I check my work on the problem sets?

Yes. Solutions are published for all nine problem sets, including the first one that checks your background, and for the three quizzes and the final exam.

Which shortest-path algorithms are taught?

Breadth-first search for unweighted graphs, Bellman-Ford, Dijkstra's algorithm, and Johnson's algorithm, followed by all-pairs shortest paths with dynamic programming.

User Reviews

0.0 out of 5
★★★★★
0
★★★★★
0
★★★★★
0
★★★★★
0
★★★★★
0

No reviews yet. Be the first to review this course.

There are no reviews yet.

Write your review

Reviews can only be posted by registered learners. Log in, then you will return here to post.

×

    Report this page
    LiveTalent
    Logo
    Compare items
    • Total (0)
    Compare
    0