Algorithms and Complexity Analysis (2 Units C: LH 30)
Course Contents
Basic algorithmic analysis. Asymptotic analysis of Upper and average complexity bounds. Standard Complexity Classes. Time and space trade-offs in analysis recursive Algorithms. Algorithmic Strategies. Fundamental computing algorithms. Numerical algorithms.
Sequential and Binary search algorithms. Sorting algorithms, Binary Search trees. Hash tables. Graphs and their representation.
- Teacher: LMS Admin