# Introduction to Algorithms Course By MIT

### Introduction to Algorithms Course By MIT

This Algorithm computer programming course from MIT provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems. It includes: Lecture Video, Recitation Video, Problem Set Assignments with solutions, Lecture Notes, Transcripts, Exams with solutions, and related resources. The complete course is available for download in one large zip file (5.5GB) from dropbox.

Course Outline:

• Lecture 1 – Introduction to Algorithms
• Lecture 2 – Models of Computation, Document Distance
• Lecture 3 – Insertion Sort, Merge Sort
• Lecture 4 – Lecture Heaps and Heap Sort
• Lecture 5 – Lecture Binary Search Trees, BST Sort
• Lecture 6 – AVL trees, AVL sort
• Lecture 7 – Counting Sort, Radix Sort, Lower Bounds for Sorting
• Lecture 8 – Counting Sort, Radix Sort, Lower Bounds for Sorting
• Lecture 9 – Table Doubling, Karp-Rabin
• Lecture 10 – Open Addressing, Cryptographic Hashing
• Quiz 1 → Quiz 1 Answers
• Lecture 11 – Introduction to Algorithms
• Lecture 12 – Introduction to Algorithms
• Lecture 13 – Introduction to Algorithms
• Lecture 14 – Introduction to Algorithms
• Lecture 15 – Introduction to Algorithms
• Lecture 16 – Introduction to Algorithms
• Lecture 17 – Introduction to Algorithms
• Lecture 18 – Introduction to Algorithms
• Quiz 2 → Quiz Answers
• Lecture 19 – Introduction to Algorithms
• Lecture 20 – Introduction to Algorithms
• Lecture 21 – Introduction to Algorithms
• Lecture 22 – Introduction to Algorithms
• Lecture 23 – Introduction to Algorithms
• Lecture 24 – Introduction to Algorithms
• Final Exam → Final Exam Answers

-love learning -your best ed lessons guide, Scott

Categories: