Introduction to Algorithms (SMA 5503)

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; Programming Assignments with Examples
MIT OpenCourseWare details
  • As taught in: Fall 2005
  • Department: Electrical Engineering and Computer Science, Mathematics
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-sma-5503 Category: Brand:

Design and analysis of algorithms: sorting, hashing, trees, dynamic programming and graphs, with lecture videos and solved problem sets.

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

This class teaches how to design and analyze efficient algorithms, using methods useful in practice. Lectures cover sorting, hashing, search trees and data structures, then amortized analysis, dynamic programming, greedy methods, graph algorithms and shortest paths. Lecture videos, problem sets with solutions and past quizzes make it suitable for self-study, along with a guide to describing algorithms clearly in writing.

What You Will Achieve

  • Analyze running times using asymptotic notation and recurrences
  • Apply divide-and-conquer, dynamic programming and greedy design
  • Choose data structures such as hash tables and red-black trees
  • Solve graph problems including shortest paths


Program Overview

Analysis and Sorting

The first lectures introduce core tools.

  • Asymptotic notation
  • Divide-and-conquer
  • Quicksort
  • Linear-time sorting

Data Structures

The middle lectures build efficient structures.

  • Hashing
  • Red-black trees
  • Skip lists
  • Amortized algorithms

Design and Graphs

The later lectures treat major paradigms.

  • Dynamic programming
  • Greedy algorithms
  • Shortest paths
  • Advanced topics

Course Completion


Job Outlook

These skills are central to software engineering, computer science research and technical interviews.


Before you start: A strong understanding of programming and a solid background in discrete mathematics, including probability, are necessary prerequisites to this course. For MIT Students, this course is the header course for the MIT/EECS Engineering Concentration of Theory of Computation. You are expected to have taken 6.001 Structure and Interpretation of Computer Programs and 6.042J / 18.062J Mathematics for Computer Science, and received a grade of C or higher in both classes. If you do not meet these requirements, you must talk to a TA before registering for the course.

Our take

Good for: Students with strong programming and discrete mathematics, including probability, who want a rigorous treatment of algorithms.

Keep in mind: This assumes the third edition of Cormen and colleagues’ textbook. Other terms of this class also appear on the site, with some different materials, so compare before you begin.

Bottom line: An algorithms course, with videos, solved problems and exams that support independent learners.

Frequently Asked Questions

How should an algorithm be written up?

As a short essay with a summary paragraph, a description in English and perhaps pseudocode, a worked example, a proof of correctness and an analysis of running time.

Which exam material is available?

Practice versions and actual versions of Quiz 1, Quiz 2 and the final exam, all with solutions.

Is there any programming?

One problem set comes with sample inputs and outputs and edit distance source code in Java and C. Most other work is written exercises and problems.

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
    Introduction to Algorithms (SMA 5503)
    Introduction to Algorithms (SMA 5503)
    LiveTalent
    Logo
    Compare items
    • Total (0)
    Compare
    0