Final Lesson Plan DAA
Final Lesson Plan DAA
Lesson plan
SUBJECT : Design and analysis of algorithm
SEMESTER : IV
1. Time table
2. Syllabus-text books, reference books, online resources
3. Course objectives
4. Course outcomes (level in blooms taxonomy-knowledge, skill, attitude)
5. CO , PO Mapping and justification
6. Lecture plan (lectures, presentations, homework, videos, case study, social media)
7. Lab/assignments/mini-project plan
8. Curriculum gap (topic, action taken)
9. Content beyond syllabus (topic, action taken)
10. Guest lecture(invitation letter, attendance, thanks letter)
11. List of experiments
12. List of assignments/quiz/presentations
13. Lab manual
14. Unit test question papers with marking scheme
15. Sample answer sheets for unit test/sample answer script
16. University question papers
17. Mini project list with some sample reports
18. Course exit survey form
19. Result analysis of previous semester (no. Of students appeared, passed, percentage, students> 60%)
21. Identified strong and weak students on the basis of test/assignment (>90% and <50%)
22. Assistance to weak students with remedial classes (attendance-contents)
23. Student feedback
24. Audit report
25. Attendance sheets
26. Attendance defaulters till test1/test2
27. Lecture Notes
Time Table
Monday Theory
Lab Group-1
Tuesday Theory
L
U
Wednesday Theory N
C
H
Thursday
B Lab Group-2
R
E
Friday Theory
A
K
Saturday Theory
best, average and worst-case behavior; Performance measurements of Algorithm, Time and space trade-offs,
Analysis of recursive algorithms through recurrence relations: Substitution method, Recursion tree method and
Masters’ theorem.
Module-II: (12 Hrs.) Fundamental Algorithmic Strategies: Brute-Force: : Linear search, selection sort, Greedy:
Huffman coding, Fractional knapasack problem, Activity selection Problem, Dynamic Programming: matrix
chain multiplication, Longest common subsequence, Travelling Salesman Problem, Branch- and-Bound and
Backtracking methodologies for the design of algorithms; Illustrations of these techniques for Problem-Solving ,
Bin Packing, Knap Sack TSP. Heuristics – characteristics and their application domains.
Module-III: ( 08 Hrs.)
Graph and Tree Algorithms: Traversal algorithms: Depth First Search (DFS) and Breadth First Search (BFS);
Shortest path algorithms, Transitive closure, Minimum Spanning Tree, Topological sorting, Network Flow
Algorithm.
Module-IV: ( 10 Hrs.)
Tractable and Intractable Problems: Computability of Algorithms, Computability classes – P, NP, NP-complete
and NP-hard. Cook’s theorem, Standard NP-complete problems(Clique Decision, Node cover Decision and
Module-V: ( 10 Hrs.)
Advanced Topics: Approximation algorithms: Node cover problem, Travelling sales man problem, Randomized
algorithms: Quick sort, n-queen problem, Min cut, Class of problems beyond NP – P SPACE
Text Books:
• Algorithm Design: Foundations, Analysis, Second Edition, Michael T Goodrich Tamassia, Wiley.
REFERENCE BOOKS
COURSE OUTCOMES:
Cognitive
Sl No Course Outcomes PO mapping PSO mapping
Level
PO1, PO2,
Able to Argue the correctness of algorithms using
PO3, PO4,
CO:1 inductive proofs and Analyze worst-case running Analyze PSO1,PSO2
PO8, PO9,
times of algorithms using asymptotic analysis.
PO10
Able to explain important algorithmic design PO1, PO2,
paradigms (divide-and-conquer, greedy method, PO3, PO4,
CO:2 Create PSO1,PSO2
dynamic-programming and Backtracking) and apply PO8, PO9,
when an algorithmic design situation calls for it. PO10, PO12
PO1, PO2,
Able to Explain the major graph algorithms and
PO3, PO4,
CO:3 Employ graphs to model engineering problems, when Create PSO1,PSO2
PO8, PO9,
appropriate.
PO10,, PO12
PO1, PO2,
Able to Compare between different data structures
PO3, PO4,
CO:4 and pick an appropriate data structure for a design Analyze PSO1,PSO2
PO8, PO9,
situation.
PO10, PO12
PO1, PO2,
Able to Describe the classes P, NP, and NP-
PO3, PO4,
CO:5 Complete and be able to prove that a certain problem Evaluat PSO1,PSO2
PO8, PO9,
is NP-Complete. e
PO10
PO1, PO2,
PO3, PO4,
CO:6 Able to analyze Approximation algorithms. Analyze PSO1,PSO2
PO8, PO9,
PO10, PO12
CO MAPPING WITH PO/PSO
Course: DESIGN AND ANALYSIS OF ALGORITHMS
Code: RCS4C002
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
2 2 -
CO1 2 3 2 2 - - - 1 1 2 - -
2 2 -
CO2 3 3 3 2 - - - 1 1 2 - 3
2 2 -
CO3 2 3 3 3 - - - 1 1 2 - 3
2 2 -
CO4 2 3 2 2 - - - 1 1 2 - 3
2 2 -
CO5 2 3 2 3 - - - 1 1 2 - -
CS6 2 2 3 2 - - - 1 1 2 - - 2 2 -
For Entire Course, PO/PSO Mapping; 1 (Low); 2 (Medium); 3 (High) Contribution to PO/PSO
JUSTIFICATION FOR MAPPING:
PO1, PO2,
CO1 PO3, PO4, 2, 3, 2, This is highly correlated with engineering knowledge and problem
PO8, PO9, 2, 1, 1, 2 analysis since it deals with correctness and running time of algorithms.
PO10
PO1, PO2,
3, 3, 3, Most importantly this is the main CO in Design and Analysis of Algorithm
CO2 PO3, PO4, 2, 1, 1, course by providing the different design techniques to develop an
PO8, PO9, 2, 3 efficient algorithms
PO10, PO12
PO1, PO2,
2, 3, 3,
CO3 PO3, PO4, Essentially this CO relates to different graph traversal algorithms which
3, 1, 1,
PO8, PO9, are used for social network analysis and our day to day problem.
2, 3
PO10, PO12
PO1, PO2,
2, 3, 2,
CO4 PO3, PO4, This is related to different types of data structure which are playing
2, 1, 1,
PO8, PO9, important role for designing algorithm.
2, 3
PO10, PO12
PO1, PO2,
This CO relates to understand, analysis, design and application of the
CO5 PO3, PO4, 2, 3, 2,
notion of Polynomial and Non-polynomial time algorithms and
PO8, PO9, 3, 1, 1, 2
categorized by P, NP – Complete and NP – Hard.
PO10
PO1, PO2,
CO6 PO3, PO4, 2, 3, 2, This CO relates to the analysis of approximation algorithms and its
PO8, PO9, 3, 1, 1, 2 applications.
PO10
PSO
CO LEVEL JUSTIFICATION
MAPPED
This CO talks about time complexity of algorithms is required for AI and
PSO1, PSO2 2, 2 Embedded systems development.
CO1
This CO talks about state of the art algorithm design to develop efficient
PSO1, PSO2 2, 2 algorithm.
CO2
This CO talks about state of the art Graph algorithm is required for computer
PSO1, PSO2 2, 2
vision and embedded system development.
CO3
This CO talks about state of the art Data Structure is required to design
PSO1, PSO2 2, 2 algorithms.
CO4
This CO talks about NP problems is required for Artificial Intelligence and
PSO1, PSO2 2, 2 Distributed computing leads to embedded systems development.
CO5
This CO talks about approximation algorithms is required for real life
PSO1, PSO2 2,2
applications
CO6
Expected Prior Knowledge and Skills:
i Class Room Teaching/Black Board v. Self Learning Online Resources Ix. Industry Visit
ii Tutorial vi. Slide x. GD
iii Remedial Coaching vii. Simulations/Demonstrations x. Seminar
iv Lab Experiment viii Expert Lecture xi. Case Study
Session Topics to be covered No of Plane Actual date Teaching Signature of
No class d date method the Faculty
3 Sorting techniques
3 Growth of Functions
5 Common Functions
8 Master method
13 Selection sort
14 Introduction to dynamic
programming
15 Elements of dynamic programming
21
Activity- Selection Problem
22
Travelling salesman problem
23
Huffman code
24 Branch and bound
26 Heuristics – characteristics
31 Prims Algorithm
33 Dijikstra Algorithm
35 Topological sorting
36 Module wise question answer discussion
38 Computability of Algorithms,
40 Cook’s theorem
41 Clique Decision
44 Approximation algorithms
47 Randomized algorithms
49 Min cut
53
51
52
Course Delivery
Unit 1 2 3 4 5
Week 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15