1
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.
FREE
This course includes
Hours of videos
555 years, 6 months
Units & Quizzes
20
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
It emphasizes the relationship between algorithms and programming and introduces basic performance measures and analysis techniques for these problems.
Course Currilcum
- Introduction notes Unlimited
- Data Structures notes Unlimited
- Sorting notes Unlimited
- Hashing notes Unlimited
- Linear Sorting notes Unlimited
- Binary Trees, Part 1 notes Unlimited
- Binary Trees, Part 2: AVL notes Unlimited
- Binary Heaps notes Unlimited
- Breadth-First Search notes Unlimited
- Depth-First Search notes Unlimited
- Weighted Shortest Paths notes Unlimited
- Bellman-Ford notes Unlimited
- Dijkstra’s Algorithm notes Unlimited
- ASP & Johnson’s Algorithm notes Unlimited
- Dynamic Programming, Part 1: SRBOT, Fib, DAGs, Bowling notes Unlimited
- Dynamic Programming, Part 2: LCS, LIS, Coins notes Unlimited
- Dynamic Programming, Part 3 notes Unlimited
- Dynamic Programming, Part 4: Rods, Subsetsums, Pseudopolynomial notes Unlimited
- Complexity notes Unlimited
- Course Review notes Unlimited
