Introduction to Algorithms (SMA 5503)
Design and analysis of algorithms: sorting, hashing, trees, dynamic programming and graphs, with lecture videos and solved problem sets.
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.
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.



There are no reviews yet.