Design and Analysis of Algorithms
Free
This is an intermediate algorithms course with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography.
Course Features
- Lectures 11
- Quizzes 0
- Duration 4 hours per week
- Skill level
- Language English
- Students 1242
- Certificate No
- Assessments Self
-
Syllabus
- Lecture 1.1 Syllabus Locked
-
Calendar
- Lecture 2.1 Calendar Locked
-
This Course at MIT
- Lecture 3.1 This Course at MIT Locked
- Lecture 3.2 Meet the Educator Locked
- Lecture 3.3 Instructor Insights Locked
-
Lecture Notes
- Lecture 4.1 Lecture Notes Locked
-
Lecture Videos
- Lecture 5.1 Lecture Videos Locked
-
Recitation Notes
- Lecture 6.1 Recitation Notes Locked
-
Recitation Videos
- Lecture 7.1 Recitation Videos Locked
-
Assignments
- Lecture 8.1 Assignments Locked
-
Exams
- Lecture 9.1 Exams Locked