Masoud Seddighin
Algorithm Lab - 721
•
•
•
•
Analysis of Algorithms(5)
Simple DS (6)
Hash (1)
Sorting and Selection (2)
•
•
•
•
•
•
Graph(6)
Greedy Algorithms (2)
Divide and Conquer (2)
Dynamic programming (2)
Backtracking (1)
Complexity Theory(1)
References:
Evaluation
•
•
•
•
•
•
Homework: 0
Quiz: 3
Project: 3
Midterm: 6
Final: 8
Extra: 2.5-3
– ACM
– Wiki
Course Notes
• Announcement, resources, grades
– Course website
– Piazza : Ce-40254-2
– Quera
• TA:
– [email protected]
• Monday, 15-18
Question?
Preliminaries
• Induction
• Recurrence relations