CS302 Design and Analysis of Algorithms KTU Notes | KTU DAA Notes | KTU Students Note| Textbook | Syllabus | Question Paper

CS302 Design and Analysis of Algorithms KTU Notes | KTU DAA Notes | KTU Students Note| Textbook | Syllabus | Question Paper

MODULE I

• Introduction to Algorithm AnalysisTime and Space Complexity-Elementary operations and Computation of Time Complexity-Best, worst and Average Case Complexities- ComplexityCalculation of simple algorithms

• Recurrence Equations:Solution of Recurrence Equations –Iteration Method and Recursion Tree Methods

MODULE II

• Master’s Theorem(Proof not required) – examples

• Asymptotic Notations and their properties- Application of Asymptotic Notations in Algorithm Analysis- Common Complexity Functions

• AVL Trees – rotations, Red-Black Trees insertion and deletion (Techniques only; algorithms not expected).

• B-Trees – insertion and deletion operations.

• Sets- Union and find operations on disjoint sets.