Analysis of Algorithms
ENCT 388 · Semester 6 · Analysis of Algorithms
Open in the Padhaiko appSyllabus and lessons
Chapter 1: Introduction to Algorithm Analysis (5 hours)
Chapter 2: Iterative and Numeric Algorithms (8 hours)
Chapter 3: Divide and Conquer Algorithms (8 hours)
Chapter 4: Greedy Algorithms (7 hours)
Chapter 5: Dynamic Programming (8 hours)
Chapter 6: Backtracking Techniques (4 hours)
Chapter 7: NP-Hard and NP-Complete Problems (5 hours)