Course Outline
Design Analysis of Algorithm
Semester III
B.Tech 2024-2028
School of Technology
4 Credits
Prepared by Dr. Rajkumar Kalimuthu, Associate Professor, School of Technology
Email ID rajkumar.kalimuthu@woxsen.edu.in
Course Code: Course Title:
L T P O Total
24TU03MJM2 Design and Analysis Credits
3 0 1 0 4
of Algorithms
Objectives
The course aims to equip students with
1. The objective of this course is to introduce the fundamentals of algorithm design and analysis, Equip
students with skills to select and implement appropriate algorithms, Develop the ability to solve
complex problems using various algorithmic paradigms.
Outcomes PLO Mapping
CLO 1: Explain and analyze the time and space
complexity of algorithms, and interpret their practical
implications in real-world scenarios. 1,2
CLO 2: Apply efficient searching, sorting, and data
structuring techniques, and compare algorithmic
paradigms (Divide & Conquer, Greedy, Dynamic
Programming) to solve computational problems. 1, 2 ,3,5
CLO 3: Evaluate NP-class problems to differentiate
between tractable and intractable cases and
understand their significance in algorithmic theory. 1, 2 ,3, 5, 6
CLO 4: Design and develop an optimized solution
using algorithmic paradigms as part of a team-based
project and communicate technical findings clearly. 1, 2, 6, 9, 12
Reference Materials
Textbooks (T) T1 Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein
Per availability in the (CLRS), MIT Press, 2009.
library
T2 Fundamentals of Computer Algorithms by Horowitz, Sahni, and
Rajasekaran, University Press.
R1 Algorithm Design by Jon Kleinberg and Éva Tardos, Pearson, 2005.
Reference Books ®
Journal Articles (J)
J1 NA
provide link only
Case Material/
Whitepaper C1 NA
provide link only
CL
Weeks Concept Method Assessment
O
Unit I
Week 1- Introduction to Algorithms
3
(9 Space and Time Complexity Classical
1 Written Exam
lectures Method
Asymptotic Notations
)
Complexity Calculation
Linear Sorting Algorithms
Unit II
Advance Data Structure
Divide and Conquer
Unit III
Greedy Algorithms
Job Scheduling, Fractional
Knapsack
Week 4-
6 Kruskal’s and Prim’s Classical
(12 Algorithms 1,2 Written Exam
Method
lectures
) Huffman Tree
Unit IV
Dynamic Programming
Paradigm
0-1 Knapsack, Matrix Chain
Multiplication
Longest Subsequence
Three
All-Pairs Shortest Path Case
Week
studies
7-9 Backtracking: N-Queens, Graph projects Written
(9 Coloring 2,3 that exam/presentatio
lectures
cover all n
) Unit V
Branch and Bound Methods
the
CLOs**
Travelling Salesman Problem (TSP) *
Hamiltonian Cycle
NP-Hard and NP-Complete Problems
Week Team
10-15 Non-deterministic Algorithms, Cook’s 3, 4 Based Weekly sprint
Theorem Project
Resources: 2 Peer Learning students, 2 PhD
***Projects undertaken during Weeks 8 to 15 will be carefully selected and designed
to comprehensively reflect the entire course syllabus.
Assessments
CLO AI Level (0-
Session No Weightage Description
Alignment 5)
Written Test Testing fundamental
CLO 1 12 10 0
(Phase 1) knowledge
Written Test Testing fundamental
CLO 2,3 20 10 0
(Phase 1) knowledge
Case Study CLO 2, 3,
32 10 2 Presentation
(Phase 2) 4
Project weekly Code review and
CLO 1, 2,
(Phase 3) 42, 52, 60 30 3 implementation
3, 4
Sprint (x3) updates
Evaluation on
External projects done by
Project All CLOs - 40 3
whole class with
Evaluation industrial mentors
Rubrics
Internal Presentation & Leadership/
Problem Code Execution
Report contribution
Project Understanding (15)
(10) (5)
Evaluation (10)
Mapped CLOs CLO1, CLO 2 CLO 3 CLO 4 CLO 4
Code Presentation & Leadership/
External Problem
Execution Report contribution
Project Understanding
(15) (10) (5)
Evaluation (10)
Mapped
CLO 1 CLO 2 CLO 3 CLO 4 CLO 4
CLOs
