Course Outcomes:

1. Ability to Understand Mathematical Formulation, Complexity Analysis & Methodologies to Solve Reccurence Relation for Algorithms.

2. Ability to design Algorithms using Standard Paradigms like Divide& Conquer, Dynamic Programming & Greedy Approach.

3. Ability to Design Algorithms Using Advanced Data Structures and Implement Traversal Techniques.

4. Ability to understand NP class Problems and formulate solutions using Standard Approaches.

Lecture Plan