Suggested preparation: Programming, discrete mathematics and basic proof techniques.
About this course
Learn to design and analyze algorithms using sorting, graph traversal, shortest paths and other core techniques. Lectures and problem sessions connect data structures with correctness and computational efficiency.
Topics and lesson examples
- 1. Algorithms and Computation
- Problem Session 3
- 11. Weighted Shortest Paths
- 16. Dynamic Programming, Part 2: LCS, LIS, Coins
- 21. Algorithms—Next Steps
Course at a glance
| Provider | MIT |
|---|---|
| Platform | YouTube · MIT OpenCourseWare |
| Access | Free Video |
| Level | Intermediate — WikiFree study-level assessment |
| Language | English |
| Available lessons | 32 |
| Video duration | 35h 19m · self-paced |
| Details checked | 10 October 2026 |
Preparation and study approach
Suggested preparation: Programming, discrete mathematics and basic proof techniques.
Follow the available videos in sequence, pausing to summarize the main argument or reconstruct a worked example. Keep a short list of assumptions, unfamiliar terms and questions to revisit. Additional reading, problem solving and practice will take time beyond the listed video duration.
Using this video classroom
Select a lesson from the list, or search for a topic. Previous and Next move through the sequence. You can mark lessons complete; progress is stored in this browser without a WikiFree account.
Free access and course scope
The public MIT OpenCourseWare videos in this classroom are free to watch. This listing provides the available playlist recordings, which may include selected lectures, recitations, demonstrations or supporting discussions rather than every component of the original campus course. Textbooks, equipment, software licenses, supervised labs, graded assignments and instructor feedback are not supplied by WikiFree. No purchase is required to watch the videos or use the note-based study approach above.
WikiFree independently organizes these resources for self-paced study. Watching does not award an MIT certificate, academic credit or admission to MIT.
Video provider and credit: MIT OpenCourseWare on YouTube. WikiFree titles, descriptions and cover artwork are independently prepared.
Related courses for your next step
- Compare another approachFree Simplilearn Course: Data Structures and Algorithms
Focus: Arrays & Lists · Trees & Graphs
Intermediate - Compare another approachData Structures and Algorithms in JavaScript: Free Course
Focus: Data structures · JavaScript
Intermediate - Explore a higher-level optionFree MIT Course: Advanced Data Structures
Focus: 1. Persistent Data Structures · 6. Dynamic Optimality II
Professional - Explore a higher-level optionFree MIT Course: Geometric Folding Algorithms and Origami Mathematics
Focus: Lecture 1: Overview of Geometric Folding Algorithms: Linkages, Origami, Polyhedra · Lecture 8: Fold & One Cut
Professional
Compare course focus, level and study time
| Course | Level | Focus | Study time |
|---|---|---|---|
| This course — Free MIT Course: Algorithms and Data Structures | Intermediate | 1. Algorithms and Computation · Problem Session 3 · 11. Weighted Shortest Paths | 35h 19m of video; practice time is additional |
| Free Simplilearn Course: Data Structures and Algorithms | Intermediate | Arrays & Lists · Trees & Graphs · Search & Sort | 56h 43m of video; practice time is additional |
| Data Structures and Algorithms in JavaScript: Free Course | Intermediate | Data structures · JavaScript · Trees | 3h 52m of video; practice time is additional |
| Free MIT Course: Advanced Data Structures | Professional | 1. Persistent Data Structures · 6. Dynamic Optimality II · 11. Integer Models | 29h 53m of video; practice time is additional |
| Free MIT Course: Geometric Folding Algorithms and Origami Mathematics | Professional | Lecture 1: Overview of Geometric Folding Algorithms: Linkages, Origami, Polyhedra · Lecture 8: Fold & One Cut · Lecture 12: Tensegrities & Carpenter's Rules | 42h 46m of video; practice time is additional |
Provider: MIT. Videos play from the MIT OpenCourseWare channel on YouTube.
Report a correction
Questions & discussion
Share a useful question or correction. Comments appear after moderation. Please avoid personal or sensitive information.