Scribd
Upload
27 views4 pages

2 2023 Lesson Plan CS2012 DAA

1) The document provides a lesson plan for the subject "Design & Analysis of Algorithm" for the 5th semester of B.Tech programs in computer science, information technology, computer science and engineering, and computer science engineering at Kalinga Institute of Industrial Technology for the autumn semester of 2023-24. 2) The lesson plan outlines 6 modules that will be covered over 37 lectures, including topics like algorithm analysis, divide and conquer methods, greedy algorithms, dynamic programming, graph algorithms, and computational complexity. 3) Student performance will be evaluated through mid-semester and end-semester exams, as well as other activities like assignments, quizzes, projects, and class participation.

Uploaded by

Abhishek Raj
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
27 views4 pages

2 2023 Lesson Plan CS2012 DAA

1) The document provides a lesson plan for the subject "Design & Analysis of Algorithm" for the 5th semester of B.Tech programs in computer science, information technology, computer science and engineering, and computer science engineering at Kalinga Institute of Industrial Technology for the autumn semester of 2023-24. 2) The lesson plan outlines 6 modules that will be covered over 37 lectures, including topics like algorithm analysis, divide and conquer methods, greedy algorithms, dynamic programming, graph algorithms, and computational complexity. 3) Student performance will be evaluated through mid-semester and end-semester exams, as well as other activities like assignments, quizzes, projects, and class participation.

Uploaded by

Abhishek Raj
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 4

School of Computer Engineering

Autumn Semester 2023-24


Kalinga Institute of Industrial Technology (KIIT)
Deemed to be University
Bhubaneswar-751024

-----------------------------------------------------------------------------------------------
====================|| Lesson Plan ||===================
-----------------------------------------------------------------------------------------------

Program : B.Tech. (CS, IT, CSSE, CSCE)


Academic Session : Autumn
Semester : 5th
Subject Code : CS-2012
Subject : Design & Analysis of Algorithm
L-T-P : 2-1-0
Course Faculty : Dr Rabi Shaw

Mod. Module Name Topics to be covered Lecture


No. of
No. serial
lectures
nos.
 Concepts in algorithm analysis &
design - motivation
 Complexity of an algorithm (Space
and time Complexity)
 Analysis of time complexity of
Insertion Sort by step count method
1. Introduction  Growth of functions 8 1-8
 Asymptotic notations (O, Θ
 Solving recurrences
(Iterative/Substitution/ Recurrence
Tree/Master theorem/Change of
variable method)
Tutorials / Activity

1
 Structure of Divide-and-Conquer
algorithm
 Analysis of divide-and-conquer run
time recurrence relations of
 Binary Search
Divide and
 Merge Sort
2. Conquer 9 9-17
 Quick Sort
Method, Heap
 Randomized Quick Sort
 Building a heap
 Heap sort algorithm
 Priority queue
Tutorials / Activity
 Overview of Greedy paradigm
 Fractional knapsack problem
3. Greedy Method  Activity selection problem 4 18-21
 Huffman’s code
Tutorials / Activity
 Overview of Dynamic
Programming paradigm
 Difference between Divide and
Dynamic Conquer and Dynamic
4. 4 22-25
Programming Programming
 Matrix Chain Multiplication
 Longest Common Subsequence
Tutorials / Activity

2
 Dis-joint Set Data Structure
 Representation Of Graph
 Graph Traversals :: BFS DFS
 Single Source Shortest Path
- Dijkstra’s Algorithm
Graph -Bellman–Ford Algorithm
5. 10 26-35
Algorithms  All Pair Shortest Path
- Floyd-Warshall Algorithm
 Minimum Cost Spanning Tree
- Kruskal’s Algorithm
- Prim’s Algorithm
Tutorials / Activity
 Complexity Classes: P, NP, NP-
Computational
6. Hard and NP-Complete 2 36-37
Complexity
Tutorials / Activity

Course Outcome :: At the end of the course, the students will be

 Able to analyse the asymptotic performance of algorithms.


 Able to understand different algorithm design techniques.
 Able to apply important algorithm design paradigms and methods of analysis.
 Able to demonstrate familiarity with major algorithms and data structures
 Able to modify existing algorithms to apply in common engineering design situations.
 Able to understand different classes of problems P, NP, NP-Complete and NP-Hard.

Text Books:
 T. H. Coreman, C. E. Leiserson, R. L. Rivest, C. Stein, “Introduction to Algorithms”,
PHI.
 E. Harwitz, S. Sahani, S. Rajsekharan, Galgotia “Fundamentals of Computer
Algorithms”, Galgotia Publication.

Reference Books:
 J. Kleinberg, E. Tardos, “Algorithms Design”, Pearson International 1st Edition.
 Michael Goodrich, Roberto Tamassia, “Algorithm Design: Foundations, Analysis &
Internet Examples”, John Wiley & Sons.

Pedagogy: Lecture, Assignments, Quiz, Debate, Summarization, Short Projects


Evaluation Methodology: Internal: 50 (20- Midterm Exam & 30 Activity), End Term: 50

3
Distribution of Marks:

SL Evaluation Evaluation Course Lecture No. Mode


No. Component Marks
From To

1 Mid-Semester 20 1 20 Closed
Examination Book

2 Activity based 30 NA NA Open Book,


Teaching and Closed
Learning Book and
Presentation
, Short quiz

3 End-Semester 50 1 37 Closed
Examination Book

Note ::
 Tentative Mid-Semester Syllabus would be up to Greedy Method as per the Lesson
Plan.
 Modifications to the above-mentioned structure (Lesson Plan / Examination
Process / Any other modifications) may take place as per the University Guidelines.

=======================XXXXXXXX======================

You might also like