0
(
ratings
)
students
Created by:
Last updated:
November 30, 2022
Duration:
Unlimited Duration
FREE
This course includes:
Unlimited Duration
Badge on Completion
Certificate of completion
Unlimited Duration
Description
This course 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
Course Curriculum
- Algorithmic Thinking, Peak Finding Unlimited
- Models of Computation, Document Distance Unlimited
- Insertion Sort, Merge Sort Unlimited
- Heaps and Heap Sort Unlimited
- Binary Search Trees, BST Sort Unlimited
- AVL Trees, AVL Sort Unlimited
- Counting Sort, Radix Sort, Lower Bounds for Sorting Unlimited
- Hashing with Chaining Unlimited
- Table Doubling, Karp-Rabin Unlimited
- Open Addressing, Cryptographic Hashing Unlimited
- Integer Arithmetic, Karatsuba Multiplication Unlimited
- Square Roots, Newton’s Method Unlimited
- Breadth-First Search (BFS) Unlimited
- Depth-First Search (DFS), Topological Sort Unlimited
- Single-Source Shortest Paths Problem Unlimited
- Dijkstra Unlimited
- Bellman-Ford Unlimited
- Speeding up Dijkstra Unlimited
- Dynamic Programming I: Fibonacci, Shortest Paths Unlimited
- Dynamic Programming II: Text Justification, Blackjack Unlimited
- Dynamic Programming III: Parenthesization, Edit Distance, Knapsack Unlimited
- Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros. Unlimited
- Computational Complexity Unlimited
- Topics in Algorithms Research Unlimited
About the instructor
5
5
Instructor Rating
1
Reviews
1520
Courses
1916
Students
Massachusetts Institute of Technology
