The document is a lesson plan for the Design and Analysis of Algorithms course at Jaya Sakthi Engineering College, detailing the course objectives, topics, and teaching methods for the academic year 2025-26. It outlines the structure of the course across five units, covering various algorithmic techniques and their applications. Each unit includes specific topics, teaching modes, and the number of hours allocated for each lecture.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
27 views3 pages
Ad3351 Daa Lesson Plan
The document is a lesson plan for the Design and Analysis of Algorithms course at Jaya Sakthi Engineering College, detailing the course objectives, topics, and teaching methods for the academic year 2025-26. It outlines the structure of the course across five units, covering various algorithmic techniques and their applications. Each unit includes specific topics, teaching modes, and the number of hours allocated for each lecture.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3
COLLEGE: JAYA SAKTHI ENGINEERING COLLEGE
LESSON PLAN
DEPARTMENT : AI&DS NAME OF THE STAFF : Ms.K.Nandhini
SEMESTER : III/V SUBJECT CODE & NAME : AD3351 / Design and Analysis of Algorithms ACADEMIC YEAR : 2025-26 TIME CUMULATIVE SI NO DATE LECTURE NOTE OBJECTIVE MODE MEDIA REQUIRED NO OF HOURS Introduction to Course Objectives & Course To Understand the Concepts of Course Objectives & 0 0 Outcomes(CO1,CO2,CO3,CO4.CO5) Course Outcomes UNIT- 1 TOPIC: INTRODUCTION TARGET PERIOD: 8 INTRODUCTION Notion of an Algorithm – 1 1. 1 Period PPT Projector Fundamentals of Algorithmic Problem Solving Important Problem Type Black 2 2. 1 Period LECTURE Board Fundamentals of the Analysis of Algorithm To critically Black 3 3. Efficiency 1 Period LECTURE analyze the Board Analysis Framework efficiency of Black 4 4. 1 Period LECTURE alternative Board AsymptoticNotations and their properties algorithmic 5 5. 1 Period PPT Projector solutions for Empirical analysis the same Black 6 6. 1 Period LECTUR problems Board Mathematical analysis of Recursive and Non- 7 7. 1 Period PPT Projector Recursive algorithms Visualization. Black 8 8. 1 Period LECTURE Board UNIT- II TOPIC: BRUTE FORCE AND DIVIDE AND CONQUER TARGET PERIOD: 10 Brute Force – String Matching Black 9 9. 1 Period LECTURE Board To illustrate Exhaustive Search- Traveling Salesman Problem Black 10 10. brute force and 1 Period LECTURE Board divide and Knapsack 11 11. conquer design 1 Period PPT Projector Problem - Assignment problem techniques. Divide and Conquer Methodology Black 12 12. 1 Period LECTURE Board COLLEGE: JAYA SAKTHI ENGINEERING COLLEGE Multiplication of Large Black 13 13. 1 Period LECTURE Integers and Strassen’s Matrix Multiplication Board 14. Closest-Pair and Convex 1 Period PPT Projector 14 15. Hull Problems. Decrease and Conquer 1 Period PPT Projector 15 Topological Sorting Black 16 16. 1 Period LECTURE Board Transform and Conquer: Presorting Black 17 17. 1 Period LECTURE Board Heaps and Heap Sort. Black 18 18. 1 Period LECTURE Board UNIT- III TOPIC: DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE TARGET PERIOD: 10 Dynamic programming – Principle of optimality Black 19 19. 1 Period LECTURE Board Coin changing problem Black 20 20. 1 Period LECTURE Board Warshall’s and Floyd‘s 21 21. 1 Period PPT Projector algorithms To explain Optimal Binary Search Trees Black 22 22. dynamic 1 Period LECTURE Board programming Multi stage graph Black 23 23. and greedy 1 Period LECTURE Board techniques for Knapsack Problem and Memory Black 24 24. solving various 1 Period LECTURE functions. Board problems 25. Greedy Technique 1 Period PPT Projector 25 Dijkstra’s algorithm Black 26 26. 1 Period LECTURE Board 27. Huffman Trees and codes 1 Period PPT Projector 27 0/1 Knapsack problem. Black 28 28. 1 Period LECTURE Board UNIT- IV TOPIC: ITERATIVE IMPROVEMENT TARGET PERIOD: 8 The Simplex Method To apply Black 29 29. 1 Period LECTURE iterative Board The Maximum improvement Black 30 30. 1 Period LECTURE technique to Board 31. Flow Problem solve 1 Period PPT Projector 31 Maximum Matching in Bipartite Graphs optimization Black 32 32. problems 1 Period LECTURE Board COLLEGE: JAYA SAKTHI ENGINEERING COLLEGE The Stable marriage Problem Black 33 33. 1 Period LECTURE Board 34. Lower - Bound Arguments 1 Period PPT Projector 34 P, NP, NP Complete Black 35 35. 1 Period LECTURE Board NP Hard Problems. Black 36 36. 1 Period LECTURE Board UNIT- V TOPIC: LIMITATIONS OF ALGORITHM POWER TARGET PERIOD: 9 37. Backtracking- N-Queen problem 1 Period PPT Projector 37 Hamiltonian Circuit Problem – Subset Sum Black 38 38. 1 Period LECTURE Problem. Board 39. Branch and Bound 1 Period PPT Projector 39 LIFO Search and FIFO search To examine the Black 40 40. 1 Period LECTURE limitations of Board 41. Assignment problem algorithmic 1 Period PPT Projector 41 Knapsack Problem power and Black 42 42. 1 Period LECTURE handling it in Board Traveling Salesman different Black 43 43. 1 Period LECTURE Problem problems. Board Approximation Algorithms for NP-Hard Black 44 44. 1 Period LECTURE Problems Board Traveling Salesman problem Black 45 45. 1 Period LECTURE Board
Staff Acad. Coordinator HOD Principal Director (Acad)