Course Description

Course CodeCourse NameCreditsHours
6105009 Computer Algorithms 3.0 3
Description 1.Mathematical background 1.1Asymptotic growth rate of functions 1.2Solving recurrence relations 1.3Mathematical induction 2.Basic analysis techniques 2.1 Computational complexities -lower bounds and upper bounds 2.2Worst case analysis and average case analysis 2.3Amortized analysis 3.Basic Design Paradigms 3.1Divide and conquer 3.2Greedy methods 3.3Dynamic Programming 3.4 Probabilistic algorithms 4.Computational Complexity 4.1Information-theoretic arguments 4.2Adversary arguments 4.3Linear reduction of problems 4.4NP-completeness