| 1 |
- |
Mathematical repetition |
Explanation, Question-Answer, Problem-Solving Method |
| 2 |
- |
Fundamentals of Analysis 1 |
Explanation, Question-Answer, Problem-Solving Method |
| 3 |
- |
Fundamentals of Analysis 2-Non-recursive algorithms |
Explanation, Question-Answer, Problem-Solving Method |
| 4 |
- |
Counting analysis, Sequences, and repetition relations |
Explanation, Question-Answer, Problem-Solving Method |
| 5 |
- |
Solution of repetitive relations 1 |
Explanation, Question-Answer, Problem-Solving Method |
| 6 |
- |
Analysis of Recursive Algorithms |
Explanation, Question-Answer, Problem-Solving Method |
| 7 |
- |
Introduction to Design |
Explanation, Question-Answer, Problem-Solving Method |
| 8 |
- |
MID-TERM EXAM |
- |
| 9 |
- |
Introduction to Design |
Explanation, Question-Answer, Problem-Solving Method |
| 10 |
- |
Greedy Algorithms |
Explanation, Question-Answer, Problem-Solving Method |
| 11 |
- |
Dynamic Programming Algorithms |
Explanation, Question-Answer, Problem-Solving Method |
| 12 |
- |
Exception Handling |
Explanation, Question-Answer, Problem-Solving Method |
| 13 |
- |
Introduction to NP and NP-complete problems, understanding, backtracking method |
Explanation, Question-Answer, Problem-Solving Method |
| 14 |
- |
Approximation algorithms for NP problems |
Explanation, Question-Answer, Problem-Solving Method |
| 15 |
- |
General Review |
Explanation, Question-Answer, Problem-Solving Method |
| 16 |
- |
FINAL EXAM |
- |
| 17 |
- |
FINAL EXAM |
- |