COMP3600/6466 – Algorithms
Semester Recap
Hanna Kurniawati
[email protected]
What have we covered?
• Analysis of Algorithms
• Abstract Data Structures
• Algorithm Design Techniques
• Problem Complexity
Algorithm Analysis
• Problem: Sorting + Searching
• Analysis Framework:
• Model of Computation
• Asymptotic Notations
• A bit of correctness
• Recurrence Analysis
• Probabilistic Analysis (incl. basic of
Randomized Algorithm)
• Empirical Analysis
Abstract Data Structures
• Binary Search Tree
• Heaps
• AVL Tree
• Red-Black Tree
• Hashing
Algorithm Design Techniques
• Dynamic Programming
• Greedy
Problem Complexity
• P, NP, NP-hard, NP-complete
DONE!!! J
Hopefully you’ve learned a thing or two J

欢迎咨询51作业君