6.006 Introduction to Algorithms (Spring 2020, MIT OCW). Instructors: Prof. Erik Demaine, Dr. Jason Ku, and Prof. Justin Solomon.
0
1
September 21, 2023
English
English [CC]
Description
This course is an introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. It emphasizes the relationship between algorithms and programming and introduces basic performance measures and analysis techniques for these problems. (from ocw.mit.edu)
Course Curriculum
- Lecture 01 – Algorithms and Computation Unlimited
- Lecture 02 – Data Structures and Dynamic Arrays Unlimited
- Problem Session 01 – Asymptotic Behavior of Functions and Double-ended … Unlimited
- Lecture 03 – Sets and Sorting Unlimited
- Lecture 04 – Hashing Unlimited
- Problem Session 02 – Solving Recurrences and the Master Theorem Unlimited
- Lecture 05 – Linear Sorting Unlimited
- Problem Session 03 – Drawing Pictures of Hash Tables and Reductions from Set to Sequence Unlimited
- Lecture 06 – Binary Trees, Part 1 Unlimited
- Lecture 07 – Binary Trees, Part 2 Unlimited
- Problem Session 04 – Sequence Rotations, Drawing Sequence Trees, Binary Search Unlimited
- Lecture 08 – Binary Heaps Unlimited
- Lecture 09 – Breadth-First Search Unlimited
- Quiz 01 – Review Unlimited
- Lecture 10 – Depth-First Search Unlimited
- Lecture 11 – Weighted Shortest Paths Unlimited
- Problem Session 05 – Graph Radius, Graph Schematics, Breadth and Depth-First Searches Unlimited
- Lecture 12 – Bellman-Ford Unlimited
- Problem Session 06 – Topological Ordering, DAG Relaxation, Bellman-Ford, and Python Code Unlimited
- Lecture 13 – Dijkstra Unlimited
- Problem Session 07 – Dijkstra Algorithm, Weighted Graph Radius, Weighted Ratios Unlimited
- Lecture 14 – APSP and Johnson Unlimited
- Quiz 02 – Review Unlimited
- Lecture 15 – Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling Unlimited
- Lecture 16 – Dynamic Programming, Part 2: LCS, LIS, Coins Unlimited
- Problem Session 08 – Solving Recursively, O(n)-time Dynamic Programming, … Unlimited
- Lecture 17 – Dynamic Programming, Part 3: APSP, Parens, Piano Unlimited
- Lecture 18 – Dynamic Programming, Part 4: Rods, Subset Sum, Pseudo Polynomial Unlimited
- Lecture 19 – Complexity Unlimited
- Quiz 03 – Review Unlimited
- Lecture 20 – Course Review Unlimited
- Lecture 21 – Algorithms – Next Steps Unlimited
About the instructor
5
5
Instructor Rating
6
Reviews
4637
Courses
24183
Students
OpenCoursa
Accessible Education for Everyone
OpenCoursa is a free online learning platform dedicated to providing high-quality education to learners worldwide. With courses across a wide range of subjects, we empower individuals to gain new skills and knowledge at no cost. Our mission is to make education accessible to everyone, offering flexible learning opportunities for personal and professional growth.
We are an educational and skills marketplace to accommodate the needs of skills enhancement and free equal education across the globe to the millions. We are bringing courses and trainings every single day for our users. We welcome everyone woth all ages, all background to learn. There is so much available to learn and deliver to the people.
FREE
Hours of videos
888 years, 9 months
Units & Quizzes
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
- For teams of 2 or more users
- 27,000+ fresh & in-demand courses
- Learning Engagement tools
- SSO and LMS Integrations
