Analysis of Algorithm

First Half of 2023

Analysis of Algorithm Course File

Class/Sem:  IV                                                  Subject Code: CSC402

Course Outcomes (COs): 

At the end of the course the student should be able to:   

1. Analyze the running time and space complexity of algorithms. 

2. Describe, apply and analyze the complexity of divide and conquer strategy.

3. Describe, apply and analyze the complexity of greedy strategy. 

4. Describe, apply and analyze the complexity of dynamic programming strategy. 

5. Explain and apply backtracking, branch and bound. 6 Explain and apply string matching techniques.

• Theory Session Plan

• Lab Session Plan

• AOA_Lab_Manual

• Assignment No.1

• Assignment No.2

• Course Material

• Ch1_Introduction to Algorithms

• Ch2_Divide_Conquer_Stretegy

• Ch_3_Greedy Method Approach

• Ch_4_Dynamic Programming Approach

• Ch_4_Assembly_Line_Scheduling_TSP

• Ch5_Backtracking and Branch and bound 

• Ch6_String Matching Algorithms 

Course : First Half 2022

Name of the Course :  Analysis of Algorithm

Course Code : CSC 402

Course Outcomes: At the end of the course student will be able to

1. Analyze the running time and space complexity of algorithms.

2. Describe, apply and analyze the complexity of divide and conquer strategy.

3. Describe, apply and analyze the complexity of greedy strategy.

4. Describe, apply and analyze the complexity of dynamic programming strategy.

5. Explain and apply backtracking, branch and bound. 6 Explain and apply string matching technique.

Course Material:

Session Plan

Lab Session Plan

Assignment No.1

Assignment No.2

Unit Test I

Unit Test II

AOA Lab Manual

Course Content:

• Introduction to Complexity

• Recurrence Relation

• Divide and Conquer

• Selection Sort

• Travelling Salesman Problem

• TSP_Dynamic Programming