12/18/24, 12:34 PM about:blank

K L Deemed to be University
Department of Computer Science and Engineering-Honors -- KLVZA
Course Handout
2024-2025, Even Sem
Course Title :DESIGN AND ANALYSIS OF ALGORTHIMS
Course Code :23CS2205R
L-T-P-S Structure : 3-0-2-4
Pre-requisite :
Credits :5
Course Coordinator :Anantha Rao Gottimukkala
Team of Instructors :
Teaching Associates :
Syllabus :Introduction: Definition of an Algorithm- Algorithm Specification - Analysis of Algorithm.
PRAM Algorithms: MergingSorting. String Algorithms: The naïve string matching algorithm, Robin –
Karp algorithm. Divide and Conquer: Merge Sort-Quick - Sort- Strassen’s Matrix Multiplication – Convex
Hull. Greedy Method: The General Method - Job Sequencing with Deadlines -Knapsack Problem -
Minimum Cost Spanning Trees - Huffman Codes - Single Source Shortest Path Method. Dynamic
Programming: The General Method - Optimal Binary Search Tree - 0/1 Knapsack - Traveling Sales Person
Problem. Ford Fulkerson. Backtracking: The Eight Queens Problem - Sum Of Subset Problem - Graph
Coloring - Knapsack Problem. Brand Bound: 0/1 Knapsack Problem- Traveling Sales Person Problem.
NP-Hard and NP-Complete Problems: Basic Concepts - Cook’s Theorem, NP-Hard Graph Problems - CDP,
NCDP, AOG
Text Books :1. Ellis Horowitz, SartajSahni and SanguthevarRajasekaran, “Fundamentals of Computer
Algorithms”, 2nd Edition, University Press, 2008. 2. Cormen, Leizerson&Rivest, “Introduction to
algorithms”, 3rd Edition, Prentice-Hall, 2002. 3. Jon Kleinberg and Eva Tardos, “Algorithm Design”,
Pearson Education, 2006.
Reference Books :1. Robert Sedgewick and Kevin Wayne,” Algorithms”, 4th edition, Addison Wesley
Prof.,(2011). 2. Anny Levitin, “Introduction to Design and Analysis of Algorithms”, 2nd Edition, Person
Education Press. (2007). 3. Michael T.Goodrich and Roberto Tamassia, Algorithm Design: Foundations,
Analysis and Internet Examples, Second Edition, Wiley-India, (200)6. 4. Steven S. Skiena, “The Algorithm
Design Manual”, Second Edition, Springer, (2008)
Web Links :1. MIT Open Courseware : https://ocw.mit.edu/courses/6-046j-design-and-analysis-of-
algorithms-spring-2015/ 2. Pearson: https://www.cs.princeton.edu/~wayne/kleinberg-tardos/ 3. Berkeley:
https://www2.eecs.berkeley.edu/Courses/CS170/ 4. Illinois: https://jeffe.cs.illinois.edu/teaching/algorithms/
5. Khan Academy: https://www.khanacademy.org/computing/computer-science/algorithms
MOOCS :1. Algorithms Part-1: https://www.coursera.org/learn/algorithms-part1 2. Dynamic Programming,
Greedy Algorithms: https://www.coursera.org/learn/dynamic-programming-greedy-algorithms/home/info
Course Rationale :If we try to identify those contributions of Computer Science, that will be long-lasting,
surely one of these will be the refinement of the algorithm concept. Ever since man invented the idea of a
machine that could perform basic mathematical operations, the study of what can be computed and how it
can be done well was launched. This study, inspired by the computer, has led to the discovery of many
important algorithms and design methods. The computer Science and Engineering program has embraced
the study of algorithms as its own. The purpose of this course is to learn these methods to devise and
analyze new algorithms on their own.
Course Objectives :The objective of this course is to study paradigms and approaches used to analyze and
design algorithms and to appreciate the impact of algorithm design in practice.

COURSE OUTCOMES (COs):

about:blank 1/38
12/18/24, 12:34 PM about:blank

Blooms
CO Taxonomy
Course Outcome (CO) PO/PSO
NO Level
(BTL)
Apply concepts of mathematics to find space and time
CO1 complexities of various algorithms including string-matching PO1,PO2,PSO1 3
algorithms
Analyze the problems that can be solved by using the Divide
CO2 PSO2,PO2,PO5 4
and Conquer and the Greedy Method
Analyze the problems that can be solved by using Dynamic
CO3 PSO2,PO2,PO5 4
Programming and Backtracking
Analyze the problems that can be solved by using Branch and
CO4 PSO2,PO5,PO2 4
Bound and NPHard Graph problems
Analyze the various design techniques to solve any real-world
CO5 PSO2,PO2,PO5 4
problems.
Analyze the various design techniques to solve any real-world
CO6 PSO2,PO2,PO5 4
problems.

COURSE OUTCOME INDICATORS (COIs)::

Outcome Highest
COI-2 COI-3 COI-4
No. BTL
Btl-2 Btl-3
Understanding the concepts Apply string algorithms to
CO1 3
of merging and sorting using
check whether a pattern
parallel algorithms exists in the text or not.
Btl-3 Btl-4
Btl-2
Apply the divide and Analyze the problems that
CO2 4 Understanding the concepts
conquer technique to solve can be solved by using the
of the Greedy method.
problems. greedy method.
Btl-4
Btl-2 Btl-3
Analyze the state space tree
Understanding dynamic Apply dynamic
CO3 4 for the problems that can be
programming and Programming to solve
solved by using the
backtracking Techniques. problems.
backtracking method.
Btl-3
Btl-2 Btl-4
Apply branch and bound
Understanding the concepts Analyze NP-Hard and NP-
CO4 4 technique to solve 0/1
of NP-Hard and NP- complete concepts to solve
knapsack, traveling
Complete. decision problems.
salesperson problem
Btl-4
The student will be able to
analyze and apply suitable
CO5 4
design techniques to
implement given real-world
problems
Btl-4
The student will be able to
analyze and apply suitable
CO6 4
design techniques to
implement given real-time
skilling problems.

about:blank 2/38
12/18/24, 12:34 PM about:blank
PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs)

Po
Program Outcome
No.
Engineering Knowledge:Apply the knowledge of mathematics, science, engineering fundamentals,
PO1
and an engineering specialization to the solution of complex engineering problems.
Engineering Knowledge:Apply the knowledge of mathematics, science, engineering fundamentals,
PO1
and an engineering specialization to the solution of complex engineering problems.
Problem Analysis: Identify, formulate, review research literature, and analyse complex engineering
PO2 problems reaching substantiated conclusions using first principles of mathematics, natural sciences
and engineering sciences
Problem Analysis: Identify, formulate, review research literature, and analyse complex engineering
PO2 problems reaching substantiated conclusions using first principles of mathematics, natural sciences
and engineering sciences
Design/Development of Solutions: Design solutions for complex engineering problems and design
PO3 system components or processes that meet the specified needs with appropriate consideration for the
public health and safety, and the cultural, societal, and environmental considerations
Design/Development of Solutions: Design solutions for complex engineering problems and design
PO3 system components or processes that meet the specified needs with appropriate consideration for the
public health and safety, and the cultural, societal, and environmental considerations
Conduct Investigations of Complex Problems:Use research-based knowledge and research methods
including design of experiments, analysis and interpretation of data, and synthesis of the information
PO4
to provide valid conclusions for complex problems that cannot be solved by straightforward
application of knowledge, theories and techniques applicable to the engineering discipline.
Conduct Investigations of Complex Problems:Use research-based knowledge and research methods
including design of experiments, analysis and interpretation of data, and synthesis of the information
PO4
to provide valid conclusions for complex problems that cannot be solved by straightforward
application of knowledge, theories and techniques applicable to the engineering discipline.
Modern Tool Usage:Create, select, and apply appropriate techniques, resources, and modern
PO5 engineering and IT tools including prediction and modelling to complex engineering activities with
an understanding of the limitations.
Modern Tool Usage:Create, select, and apply appropriate techniques, resources, and modern
PO5 engineering and IT tools including prediction and modelling to complex engineering activities with
an understanding of the limitations.
The Engineer and Society:Apply reasoning informed by the contextual knowledge to assess societal,
PO6 health, safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice.
The Engineer and Society:Apply reasoning informed by the contextual knowledge to assess societal,
PO6 health, safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice.
Environment and Sustainability:Understand the impact of the professional engineering solutions in
PO7 societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development
Environment and Sustainability:Understand the impact of the professional engineering solutions in
PO7 societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development
Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of
PO8
the engineering practice
Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of
PO8
the engineering practice
Individual and Team Work: Function effectively as an individual, and as a member or leader in
PO9
diverse teams, and in multidisciplinary settings.

about:blank 3/38
12/18/24, 12:34 PM about:blank

Individual and Team Work: Function effectively as an individual, and as a member or leader in
PO9
diverse teams, and in multidisciplinary settings.
Communication:Communicate effectively on complex engineering activities with the engineering
PO10 community and with society at large, such as, being able to comprehend and write effective reports
and design documentation, make effective presentations, and give and receive clear instructions
Communication:Communicate effectively on complex engineering activities with the engineering
PO10 community and with society at large, such as, being able to comprehend and write effective reports
and design documentation, make effective presentations, and give and receive clear instructions
Project Management and Finance: Demonstrate knowledge and understanding of the engineering and
PO11 management principles and apply these to one’s own work, as a member and leader in a team, to
manage projects and in multidisciplinary environments.
Project Management and Finance: Demonstrate knowledge and understanding of the engineering and
PO11 management principles and apply these to one’s own work, as a member and leader in a team, to
manage projects and in multidisciplinary environments.
Life-long Learning: Recognize the need for, and have the preparation and ability to engage in
PO12
independent and lifelong learning in the broadest context of technological change.
Life-long Learning: Recognize the need for, and have the preparation and ability to engage in
PO12
independent and lifelong learning in the broadest context of technological change.
PSO1 An ability to design and develop software projects as well as Analyze and test user requirements.
PSO2 An Ability to gain working Knowledge on emerging software tools and technologies.

Lecture Course DELIVERY Plan:

Book No[CH No] Teaching-Learning
Sess.No. CO COI Topic EvaluationComponents
[Page No] Methods

Course Handout,
Definition of An T BOOK [1],CH
COI- End Semester
1 CO1 Algorithm, 1.1, 1.2 Page no Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM1
Algorithm 1-4, 5-13
specification

Space complexity, T BOOK [1],CH

COI- ALM,End Semester
2 CO1 time complexity 1.3.1, 1.3.2 Page Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM1
of algorithms no 15-17, 18-29

T BOOK [1],CH
COI- Asymptotic End Semester
3 CO1 1.3.3, Page no 29- Chalk,LTC,PPT,Talk
2 Notations Exam,SEM-EXAM1
37

PRAM
T BOOK [1],CH End Semester
Algorithms:
COI- 13.5,Page no636- Exam,Global
4 CO1 Merging, PRAM Chalk,LTC,PPT,Talk
2 641, 13.6, Challenges,SEM-
Algorithms:
Pageno643-647 EXAM1
Sorting

T BOOK [2],CH
COI- Naïve’s string End Semester
5 CO1 32.1,Page no 988- Chalk,LTC,PPT,Talk
3 algorithm Exam,SEM-EXAM1
990

T BOOK [2],CH
COI- Robin Karp String End Semester
6 CO1 32.1,Page no 988- Chalk,LTC,PPT,Talk
3 Algorithm Exam,SEM-EXAM1
990

about:blank 4/38
12/18/24, 12:34 PM about:blank

Book No[CH No] Teaching-Learning

Sess.No. CO COI Topic EvaluationComponents
[Page No] Methods

T BOOK [2],CH ALM,End Semester

COI- Knuth Morris
7 CO1 32.3,Page no 996- Chalk,LTC,PPT,Talk Exam,MOOCs
3 Pratt algorithm
998 Review,SEM-EXAM1

Introduction to T BOOK [1],CH

ALM,End Semester
COI- Divide and 3,3.5, 3.4 Page no
8 CO2 Chalk,LTC,PPT,Talk Exam,MOOCs
2 Conquer Method, 127-131,154-159,
Review,SEM-EXAM1
Merge Sort 145-154

T BOOK [1],CH
COI- End Semester
9 CO2 Quick Sort 3.5.1, Page no Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM1
159-164

T BOOK [1],CH
COI- Strassen’s Matrix End Semester
10 CO2 3.7, Page no Chalk,LTC,PPT,Talk
2 Multiplication Exam,SEM-EXAM1
162,179-184

T BOOK [1],CH
COI- End Semester
11 CO2 Convex Hull 3.8 Page no 185- Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM1
193

T BOOK [1],CH
COI- Greedy Method End Semester
12 CO2 4.1, Page no 197- Chalk,LTC,PPT,Talk
2 Introduction Exam,SEM-EXAM1
198

T BOOK [1],CH
COI- Knapsack End Semester
13 CO2 4.2, Page no 198- Chalk,LTC,PPT,Talk
3 Problem Exam,SEM-EXAM1
202

T BOOK [1],CH
COI- Job Sequencing End Semester
14 CO2 4.4 Page no 208- Chalk,LTC,PPT,Talk
3 with Deadlines Exam,SEM-EXAM1
260

Minimum Cost
T BOOK [1],CH
COI- Spanning Trees- End Semester
15 CO2 4.5, Page no 216- Chalk,LTC,PPT,Talk
4 Kruskal's Exam,SEM-EXAM1
227
algorithm

End Semester
Minimum Cost T BOOK [1],CH
COI- Exam,Global
16 CO2 Spanning Trees- 4.5, Page no 216- Chalk,LTC,PPT,Talk
2 Challenges,MOOCs
Prims algorithm 227
Review,SEM-EXAM1

ALM,End Semester
T BOOK [1],CH
COI- Exam,Global
17 CO2 Huffman Codes 4.7, Page no 238- Chalk,LTC,PPT,Talk
4 Challenges,MOOCs
240
Review,SEM-EXAM1

Single Source T BOOK [1],CH

COI- End Semester
18 CO2 Shortest Path 4.8, Page no 241- Chalk,LTC,PPT,Talk
4 Exam,SEM-EXAM1
Method 247
about:blank 5/38
12/18/24, 12:34 PM about:blank

Book No[CH No] Teaching-Learning

Sess.No. CO COI Topic EvaluationComponents
[Page No] Methods

ALM,End Semester
Introduction to T BOOK [1],CH
COI- Exam,Global
19 CO3 Dynamic 5.1, Page no 253- Chalk,LTC,PPT,Talk
2 Challenges,MOOCs
Programming 257
Review,SEM-EXAM2

T BOOK [1],CH
COI- Optimal Binary End Semester
20 CO3 5.5, Page no 275- Chalk,LTC,PPT,Talk
2 search trees Exam,SEM-EXAM2
284

T BOOK [1],CH
COI- 0/1 Knapsack End Semester
21 CO3 5.7, Page no 287- Chalk,LTC,PPT,Talk
3 problem Exam,SEM-EXAM2
295

T BOOK [1],CH
COI- Travelling Sales End Semester
22 CO3 5.9, Page no 298- Chalk,LTC,PPT,Talk
3 Person Problem Exam,SEM-EXAM2
301

T BOOK [2],CH
COI- End Semester
23 CO3 Ford Fulkerson 26.2, Page no Chalk,LTC,PPT,Talk
3 Exam,SEM-EXAM2
714-727

T BOOK
COI- BFS and DFS End Semester
24 CO3 [1],CH6.2, Page Chalk,LTC,PPT,Talk
2 Algorithms Exam,SEM-EXAM2
no318-325

Introduction of
Backtracking
T BOOK [1],CH
COI- methodology, End Semester
25 CO3 7.1, Page no 339- Chalk,LTC,PPT,Talk
2 Solution Space Exam,SEM-EXAM2
344
and Tree
Organization

8-Queens T BOOK [1],CH

COI- End Semester
26 CO3 Problem, Graph 7.2,7.6 Page no Chalk,LTC,PPT,Talk
4 Exam,SEM-EXAM2
coloring 355-357,360-364

T BOOK [1],CH
COI- End Semester
27 CO3 Sum of Subsets 7.2,7.6 Page no Chalk,LTC,PPT,Talk
4 Exam,SEM-EXAM2
355-357,360-364

T BOOK [1],CH
COI- 0/1 Knapsack End Semester
28 CO3 7.6, Page no 368- Chalk,LTC,PPT,Talk
4 problem Exam,SEM-EXAM2
374

Introduction to T BOOK [1],CH

COI- End Semester
29 CO4 Branch and 8.1, Page no 379- Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM2
Bound Technique 393

30 CO4 COI- 0/1 Knapsack T BOOK [1],CH Chalk,LTC,PPT,Talk ALM,End Semester

4 problem – FIFO 8.2.2, Page no Exam,Global
397-401
about:blank 6/38
12/18/24, 12:34 PM about:blank

Book No[CH No] Teaching-Learning

Sess.No. CO COI Topic EvaluationComponents
[Page No] Methods
Challenges,MOOCs
Review,SEM-EXAM2

Travelling T BOOK [1],CH

COI- End Semester
31 CO4 salesperson 8.3, Page no 403- Chalk,LTC,PPT,Talk
3 Exam,SEM-EXAM2
Algorithm 405

NP-H and NP-C

T BOOK [1],CH
COI- Problems: Basic End Semester
32 CO4 11.1-11.2, Page no Chalk,LTC,PPT,Talk
2 concepts, Cook’s Exam,SEM-EXAM2
495-507
Theorem

NP-Hard Graph
problems: Clique T BOOK [1],CH
Decision 11.3.1, Page no
COI- End Semester
33 CO4 Problem(CDP), 518-519, Chalk,LTC,PPT,Talk
4 Exam,SEM-EXAM2
Node Cover CH11.3.2, Page
Decision Problem no 519-520
(NCDP)

T BOOK
COI- And or Graph End Semester
34 CO4 [1],CH11.3.6,Page Chalk,LTC,PPT,Talk
4 Problem (AOG) Exam,SEM-EXAM2
no 526-530

Approximation
Algorithms: T BOOK [1],CH
COI- End Semester
35 CO4 Introduction, 12.1,Page no 557- Chalk,LTC,PPT,Talk
4 Exam,SEM-EXAM2
Planar Graph 560,561
Coloring

Maximum
Programs Stored T BOOK [1],CH
COI- End Semester
36 CO4 Problem, NP-hard 12.2.2,Page no Chalk,LTC,PPT,Talk
4 Exam,SEM-EXAM2
Absolute 562-565
Approximations

Lecture Session wise Teaching – Learning Plan

SESSION NUMBER : 1

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance/ Recap /Poll/Pop Question 2 Talk APPLICABLE
---
--- NOT
10 Explanation about course hand out. 2 PPT APPLICABLE
---

about:blank 7/38
12/18/24, 12:34 PM about:blank

--- NOT
Definition of an algorithm, characteristics & areas of
10 2 PPT APPLICABLE
algorithms
---
--- NOT
20 Representation and structure of an algorithm 2 PPT APPLICABLE
---

SESSION NUMBER : 2

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance/ Recap /Poll/Pop Question 2 Talk APPLICABLE
---
--- NOT
10 Space Complexity 2 PPT APPLICABLE
---
Immediate
10 Finding space for the given algorithm 2 PPT
feedback
--- NOT
20 Representation and structure of an algorithm 2 PPT APPLICABLE
---

SESSION NUMBER : 3

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 2 Talk APPLICABLE
---
--- NOT
10 Towers of Hanoi algorithm 2 PPT APPLICABLE
---
--- NOT
10 Asymptotic notations 2 PPT APPLICABLE
---
--- NOT
20 Problems solving using asymptotic notations 2 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 4

No Session Outcomes are mapped

Time(min) Topic BTL Teaching- Active

Learning Learning
about:blank 8/38
12/18/24, 12:34 PM about:blank

Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 2 Talk APPLICABLE
---
--- NOT
20 Parallel Machines 2 PPT APPLICABLE
---
--- NOT
10 PRAM Algorithms: Merging 2 PPT APPLICABLE
---
--- NOT
10 Problem Solving using PRAM Algorithms: Merging 2 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 5

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 2 Talk APPLICABLE
---
--- NOT
20 String algorithms 2 PPT APPLICABLE
---
--- NOT
10 Naive’s String Algorithm 3 PPT APPLICABLE
---
--- NOT
10 Finding pattern in the given text 3 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 6

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 2 Talk APPLICABLE
---
--- NOT
20 Robin karp introduction 2 PPT APPLICABLE
---

about:blank 9/38
12/18/24, 12:34 PM about:blank

--- NOT
10 Robin karp String Algorithm 3 PPT APPLICABLE
---
--- NOT
10 Finding pattern in the given text 3 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 7

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 2 Talk APPLICABLE
---
--- NOT
20 Knuth Morris String Algorithm - Introduction 2 PPT APPLICABLE
---
--- NOT
10 Knuth Morris String Algorithm 3 PPT APPLICABLE
---
--- NOT
10 Finding pattern in the given text 3 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 8

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 2 Talk APPLICABLE
---
--- NOT
Introduction to Divide and Conquer Method & Master’s
10 2 PPT APPLICABLE
theorem
---
--- NOT
10 Problem solving using Master's Theorem 2 PPT APPLICABLE
---
One minute
10 Merge Sort and its time complexity 2 PPT
paper
--- NOT
10 Sorting numbers using Merge Sort 2 PPT APPLICABLE
---
about:blank 10/38
12/18/24, 12:34 PM about:blank

--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 9

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Quick Sort 2 PPT APPLICABLE
---
--- NOT
20 Sorting Numbers using Quick Sort 2 PPT APPLICABLE
---
--- NOT
10 Quick Sort and its time complexity 2 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 10

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Traditional matrix multiplication 2 PPT APPLICABLE
---
--- NOT
Strassen’s matrix multiplication using divide and conquer
10 2 PPT APPLICABLE
method
---
--- NOT
20 Finding product of two matrices using strassen’s method 2 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 11

No Session Outcomes are mapped

about:blank 11/38
12/18/24, 12:34 PM about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Convex hull problem 2 PPT APPLICABLE
---
--- NOT
10 Graham’s scan algorithm 2 PPT APPLICABLE
---
--- NOT
20 Finding convex hull using Graham Scan algorithm 2 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 12

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Introduction to Optimization problem 2 PPT APPLICABLE
---
--- NOT
20 Greedy Strategy – Subset paradigm, Ordering paradigm 2 PPT APPLICABLE
---
--- NOT
10 Applications of Greedy Method 2 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 13

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
10 Knapsack Problem, its solution using Greedy 3 PPT --- NOT
methodology APPLICABLE
about:blank 12/38
12/18/24, 12:34 PM about:blank

---
--- NOT
20 Finding optimal solution for knapsack problem 3 PPT APPLICABLE
---
--- NOT
10 Knapsack algorithm with time complexity 3 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 14

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
Job Sequencing problem definition, formulation &
10 3 PPT APPLICABLE
Greedy methodology for job sequencing and dead lines
---
--- NOT
10 Finding optimal solution for job sequencing problem 3 PPT APPLICABLE
---
--- NOT
20 Job sequencing algorithm with time complexity 4 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 15

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
Spanning tree definition and Greedy methodology, &
10 4 PPT APPLICABLE
Prim’s algorithm with example
---
--- NOT
10 Kruskal’s algorithm Explanation 4 PPT APPLICABLE
---
--- NOT
20 Finding MST using Kruskal's algorithm 4 PPT APPLICABLE
---

about:blank 13/38
12/18/24, 12:34 PM about:blank

--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 16

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Prim’s algorithm Explanation 2 PPT APPLICABLE
---
--- NOT
20 Finding MST using Prim’s algorithm 2 PPT APPLICABLE
---
--- NOT
10 Comparison between Kruskals and prims algorithm 2 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 17

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Data compression 3 PPT APPLICABLE
---
--- NOT
10 Huffman codes 3 PPT APPLICABLE
---
--- NOT
20 Generating tree using Huffman codes 4 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 4 PPT APPLICABLE
---

SESSION NUMBER : 18

No Session Outcomes are mapped

about:blank 14/38
12/18/24, 12:34 PM about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
Definition of single source shortest path problem (SSSP)
10 2 PPT APPLICABLE
& Greedy methodology for SSSP
---
--- NOT
10 Finding shortest path using Dijkstras algorithm 3 PPT APPLICABLE
---
--- NOT
20 Dijkstras algorithm 4 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 19

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
Dynamic Programming- Principle of optimality,
20 3 PPT APPLICABLE
methodology.
---
--- NOT
10 Differentiate Greedy method and Dynamic Programming 2 PPT APPLICABLE
---
--- NOT
Differentiate Divide & Conquer and Dynamic
10 2 PPT APPLICABLE
Programming
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 20

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
10 binary search trees 2 PPT --- NOT
APPLICABLE
about:blank 15/38
12/18/24, 12:34 PM about:blank

---
--- NOT
10 optimal binary search trees 2 PPT APPLICABLE
---
--- NOT
20 Generating OBST for the given set of identifiers 2 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 21

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
Apply dynamic programming for solving 0/1 Knapsack
10 3 PPT APPLICABLE
problem
---
--- NOT
Generation of recursive equation for 0/1 Knapsack
10 3 PPT APPLICABLE
problem
---
--- NOT
20 Finding optimal solution for knapsack problem 2 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 22

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Recursive definition of Travelling Sales Person Problem 3 PPT APPLICABLE
---
--- NOT
10 Time Complexity 3 PPT APPLICABLE
---
20 Finding optimal solution for TSP 3 PPT Case Study
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---
about:blank 16/38
12/18/24, 12:34 PM about:blank

SESSION NUMBER : 23

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Recursive representation of Max flow 3 PPT APPLICABLE
---
--- NOT
10 Ford Fulkerson algorithm 3 PPT APPLICABLE
---
--- NOT
20 Finding max flow for the given graph 3 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 24

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 BFS Concept with Example 2 PPT APPLICABLE
---
--- NOT
10 DFS Concept with Example 2 PPT APPLICABLE
---
--- NOT
20 Generating spanning tree using BFS and DFS 2 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 25

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
5 Attendance/ Recap /Poll/Pop Question 1 Talk --- NOT
APPLICABLE
about:blank 17/38
12/18/24, 12:34 PM about:blank

---
--- NOT
10 Backtracking methodology 2 PPT APPLICABLE
---
--- NOT
20 State space tree terminology 2 PPT APPLICABLE
---
--- NOT
10 Applications of backtracking 2 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 26

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 8-Queen’s Problem definition 4 PPT APPLICABLE
---
--- NOT
10 Graph colouring problem and boundary conditions 3 PPT APPLICABLE
---
--- NOT
20 Generating state space tree for 4-Queens problem 4 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 27

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
Quiz/Test
10 Sum of subsets problem definition 4 PPT
Questions
--- NOT
10 Boundary condition formulation 4 PPT APPLICABLE
---
20 Generating state space tree for sum of subsets problem 4 PPT --- NOT
APPLICABLE
about:blank 18/38
12/18/24, 12:34 PM about:blank

---
--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 28

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
0/1 knapsack problem using dynamic programming
10 2 PPT APPLICABLE
technique
---
--- NOT
10 Difference between fixed and dynamic state space tree 2 PPT APPLICABLE
---
--- NOT
20 Generating state space tree for 4-Queens problem 4 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 29

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Branch and Bound Technique and its variations 2 PPT APPLICABLE
---
--- NOT
20 LC Search 2 PPT APPLICABLE
---
--- NOT
10 Applications of branch and bound 2 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 30

No Session Outcomes are mapped

about:blank 19/38
12/18/24, 12:34 PM about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
20 0/1 knapsack problem 3 PPT APPLICABLE
---
--- NOT
10 Algorithm 3 PPT APPLICABLE
---
--- NOT
10 Finding optimal solution for knapsack problem 3 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 31

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Travelling salesperson Problem 3 PPT APPLICABLE
---
--- NOT
20 boundary condition 3 PPT APPLICABLE
---
--- NOT
Difference between dynamic TSP and branch and bound
10 3 PPT APPLICABLE
TSP
---
--- NOT
5 Conclusion & Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 32

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
10 Introduction to NP-H and NP-C Problemsx 2 PPT --- NOT
APPLICABLE
about:blank 20/38
12/18/24, 12:34 PM about:blank

---
--- NOT
20 Relationship between P,NP,NP-Hard and NP-Complete 2 PPT APPLICABLE
---
--- NOT
10 Cooks theorem 2 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 33

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Procedure to prove given problem is NP-Hard. 4 PPT APPLICABLE
---
--- NOT
10 CDP definition & Prove that CDP is NP-Hard 3 PPT APPLICABLE
---
--- NOT
10 Node Cover Decision Problem(NCDP) Theorem 3 PPT APPLICABLE
---
--- NOT
10 Prove that NCDP is NP-Hard 3 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 34

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 And or Graph Decision Problem(AOG) Theorem 4 PPT APPLICABLE
---
--- NOT
10 Finding optimal solution for AOG graph 4 PPT APPLICABLE
---

about:blank 21/38
12/18/24, 12:34 PM about:blank

--- NOT
20 Prove that AOG is NP-Hard 4 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 35

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Introduction to Planar Graph Coloring 3 PPT APPLICABLE
---
--- NOT
10 Algorithm on Planar Graph Coloring 4 PPT APPLICABLE
---
--- NOT
20 Problem Solving on Planar Graph Coloring 4 PPT APPLICABLE
---
--- NOT
5 Conclusion & Summary 1 PPT APPLICABLE
---

SESSION NUMBER : 36

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Maximum Programs Stored Problem 4 PPT APPLICABLE
---
--- NOT
10 Problems on Maximum Programs Stored Problem 4 PPT APPLICABLE
---
--- NOT
10 NP-hard Absolute Approximations 4 PPT APPLICABLE
---
--- NOT
10 Problems on NP-hard Absolute Approximations 4 PPT APPLICABLE
---
5 Conclusion & Summary 1 PPT --- NOT
APPLICABLE
about:blank 22/38
12/18/24, 12:34 PM about:blank

---

Tutorial Course DELIVERY Plan: NO Delivery Plan Exists

Tutorial Session wise Teaching – Learning Plan

No Session Plans Exists

Practical Course DELIVERY Plan:

Tutorial
Session Topics CO-Mapping
no

1 Implement on Basic Programs on Arrays CO5

2 Implement programs on Performance analysis of Time and Space complexity CO5

3 Implementation of programs on Sorting and Searching problems. CO5

4 Implementation of Program on Naïve Based and KMP Algorithm. CO5

5 Implementation of Programs on Divide and Conquer Problems. CO5

Implement logic building or programs on Greedy Method: The General

6 CO5
Method-Job Sequencing with Deadlines, Knapsack Problem

Implement programs on Minimum Spanning Tree, Single Source Shortest

7 CO5
Path Method

Implement the programs on Dynamic Programming - OBST, 0/1 knapsack

8 CO5
problem, TSP

9 Implement programs on Graph Coloring Problem. Sum of subset problem CO5

Implement Programs on Backtracking problem-eight queen problem, 0/1

10 CO5
knapsack problem

Implementation Programs on the branch and Bound problems - TSP and 0/1
11 CO5
knapsack

12 Implement programs on NP-Hard and NP-Complete Problems CO5

13 Implement Programs on CDP, NCDP and ANDOR Graph Problem (AOG) CO5

Practical Session wise Teaching – Learning Plan

SESSION NUMBER : 1

No Session Outcomes are mapped

Time(min) Topic BTL Teaching- Active

Learning Learning
about:blank 23/38
12/18/24, 12:34 PM about:blank

Methods Methods
--- NOT
5 Attendance/ /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
45 Basic Programs on Arrays 4 PPT APPLICABLE
---
--- NOT
50 Advanced Programs on Ayyays 4 PPT APPLICABLE
---

SESSION NUMBER : 2

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/ Recap /Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Time Complexity 4 PPT APPLICABLE
---
--- NOT
50 Programs on Space Complexity 4 PPT APPLICABLE
---

SESSION NUMBER : 3

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Sortings 4 PPT APPLICABLE
---
--- NOT
50 Programs on Searching 4 PPT APPLICABLE
---

SESSION NUMBER : 4

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
about:blank 24/38
12/18/24, 12:34 PM about:blank

--- NOT
45 Programs on Strings 4 PPT APPLICABLE
---
--- NOT
50 Finding pattern matching using string algorithms 4 PPT APPLICABLE
---

SESSION NUMBER : 5

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 programs on Divide and conquer 4 PPT APPLICABLE
---
--- NOT
50 programs on Divide and conquer 4 PPT APPLICABLE
---

SESSION NUMBER : 6

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
Programs on Greedy Method - Job Sequence With
45 4 PPT APPLICABLE
Deadlines
---
--- NOT
50 Programs on Greedy Method - Knapsack Problem 4 PPT APPLICABLE
---

SESSION NUMBER : 7

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Greedy Method - Minimum Spanning Tree 4 PPT APPLICABLE
---

about:blank 25/38
12/18/24, 12:34 PM about:blank

--- NOT
Programs on Greedy Method - Single Souce Shortest
50 4 PPT APPLICABLE
Path
---

SESSION NUMBER : 8

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
Programs on Dynamic Programming - Optimal Binary
45 4 PPT APPLICABLE
Search Tree
---
--- NOT
Programs on Dynamic Programming - 0/1 Knapsack
25 4 PPT APPLICABLE
Problem
---
--- NOT
Programs on Dynamic Programming - Travelling Sales
25 4 PPT APPLICABLE
Person Problem
---

SESSION NUMBER : 9

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
programs on Graph Coloring Problem. Sum of subset
45 4 PPT APPLICABLE
problem
---
--- NOT
programs on Graph Coloring Problem. Sum of subset
50 4 PPT APPLICABLE
problem
---

SESSION NUMBER : 10

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Back Tracking - eight queen problem 4 PPT APPLICABLE
---

about:blank 26/38
12/18/24, 12:34 PM about:blank

--- NOT
50 Programs on Back Tracking - 0/1 knapsack problem 4 PPT APPLICABLE
---

SESSION NUMBER : 11

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
Programs on branch and bound technique - Travelling
45 4 PPT APPLICABLE
Sales Person
---
--- NOT
50 Programs on branch and bound technique - 0/1 Knapsack 4 PPT APPLICABLE
---

SESSION NUMBER : 12

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Non-Deterministic Algorithms 4 PPT APPLICABLE
---
--- NOT
50 Programs on Non-Deterministic Algorithms 4 PPT APPLICABLE
---

SESSION NUMBER : 13

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Clique Decision Problems 4 PPT APPLICABLE
---
--- NOT
25 Program on Node Cover Decision Problems 4 PPT APPLICABLE
---

about:blank 27/38
12/18/24, 12:34 PM about:blank

--- NOT
25 Programs on And Or Graph Problem 4 PPT APPLICABLE
---

Skilling Course DELIVERY Plan:

Skilling
session Topics/Experiments CO-Mapping
no

1 Basic data structures CO6

2 strings and pattern-matching problems CO6

3 Sorting and Searching CO6

4 Divide and conquer CO6

5 Greedy Method CO6

6 Greedy Method CO6

7 Dynamic Programming CO6

8 Dynamic Programming CO6

9 Dynamic Programming CO6

10 Backtracking CO6

11 Branch and Bound CO6

12 Non-Deterministic Algorithms CO6

Skilling Session wise Teaching – Learning Plan

SESSION NUMBER : 1

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Arrays 4 PPT APPLICABLE
---
--- NOT
50 Programs on Basic data structures 4 PPT APPLICABLE
---
about:blank 28/38
12/18/24, 12:34 PM about:blank

SESSION NUMBER : 2

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 programs on strings 4 PPT APPLICABLE
---
--- NOT
50 programs on strings 4 PPT APPLICABLE
---

SESSION NUMBER : 3

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Sortings 4 PPT APPLICABLE
---
--- NOT
50 Programs on Searching 4 PPT APPLICABLE
---

SESSION NUMBER : 4

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 programs on Divide and conquer 4 PPT APPLICABLE
---
--- NOT
50 programs on Divide and conquer 4 PPT APPLICABLE
---

SESSION NUMBER : 5

No Session Outcomes are mapped

about:blank 29/38
12/18/24, 12:34 PM about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Greedy Method 4 PPT APPLICABLE
---
--- NOT
50 Programs on Greedy Method 4 PPT APPLICABLE
---

SESSION NUMBER : 6

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Greedy Method 4 PPT APPLICABLE
---
--- NOT
50 Programs on Greedy Method 4 PPT APPLICABLE
---

SESSION NUMBER : 7

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Dynamic Programming 4 PPT APPLICABLE
---
--- NOT
50 Programs on Dynamic Programming 4 PPT APPLICABLE
---

SESSION NUMBER : 8

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods

about:blank 30/38
12/18/24, 12:34 PM about:blank

--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Dynamic Programming 4 PPT APPLICABLE
---
--- NOT
50 Programs on Dynamic Programming 4 PPT APPLICABLE
---

SESSION NUMBER : 9

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Dynamic Programming 4 PPT APPLICABLE
---
--- NOT
50 Programs on Dynamic Programming 4 PPT APPLICABLE
---

SESSION NUMBER : 10

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Back Tracking 4 PPT APPLICABLE
---
--- NOT
50 Programs on Back Tracking 4 PPT APPLICABLE
---

SESSION NUMBER : 11

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---

about:blank 31/38
12/18/24, 12:34 PM about:blank

--- NOT
45 Programs on branch and bound technique 4 PPT APPLICABLE
---
--- NOT
50 Programs on branch and bound technique 4 PPT APPLICABLE
---

SESSION NUMBER : 12

No Session Outcomes are mapped

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance /Poll Question 1 Talk APPLICABLE
---
--- NOT
45 Programs on Non-Deterministic Algorithms 4 PPT APPLICABLE
---
--- NOT
50 Programs on Non-Deterministic Algorithms 4 PPT APPLICABLE
---

WEEKLY HOMEWORK ASSIGNMENTS/ PROBLEM SETS/OPEN ENDEDED PROBLEM-SOLVING EXERCISES etc:

Assignment Assignment
Week Topic Details co
Type No

COURSE TIME TABLE:

Hour 1 2 3 4 5 6 7 8 9
Day Component
- - V-S11,V- V-S11,V- - V-S21,V- V-S21,V-
Theory - - --- --- S12,V-S13,V- S12,V-S13,V- - S22,V-S23,V- S22,V-S23,V-
- - S14 S14 - S24 S24
- - -
Tutorial - - --- --- -- -- - -- --
- - -
Mon
- - -
Lab - - --- --- -- -- - -- --
- - -
- - -
Skilling - - --- --- -- -- - -- --
- - -
Tue - - -
Theory - - --- --- -- -- - --- ---
- - -
- - -
Tutorial - - --- --- -- -- - --- ---
- - -
about:blank 32/38
12/18/24, 12:34 PM about:blank

- - -
Lab - - --- --- -- -- - --- ---
- - -
V-S21,V- V-S21,V-
- - S21,V-S22,V- S21,V-S22,V- -
Skilling - - --- --- S22,V-S23,V- S22,V-S23,V- - --- ---
- - S23,V-S24,V- S23,V-S24,V- -
S24 S24
- - - V-S31,V- V-S11,V-
Theory - - --- --- -- -- - S32,V-S33,V- S12,V-S13,V-
- - - S34 S14
- - -
Tutorial - - --- --- -- -- - -- --
- - -
Wed - - -
Lab - - --- --- -- -- - -- --
- - -
V-S21,V- V-S21,V-
- - S21,V-S22,V- S21,V-S22,V- -
Skilling - - --- --- S22,V-S23,V- S22,V-S23,V- - -- --
- - S23,V-S24,V- S23,V-S24,V- -
S24 S24
V-S31,V- V-S31,V-
- - -
S32,V- S32,V-
Theory - - -- -- - --- ---
S33,V- S33,V-
- - -
S34 S34
- - -
Tutorial - - -- -- -- -- - --- ---
- - -
Thu - - -
Lab - - -- -- -- -- - --- ---
- - -
V-S11,V- V-S11,V-
- - S11,V-S12,V- S11,V-S12,V- -
Skilling - - -- -- S12,V-S13,V- S12,V-S13,V- - --- ---
- - S13,V-S14,V- S13,V-S14,V- -
S14 S14
- - - V-S21,V-
Theory - - --- --- -- -- - S22,V-S23,V- ---
- - - S24
- - -
Tutorial - - --- --- -- -- - -- ---
- - -
Fri - - -
Lab - - --- --- -- -- - -- ---
- - -
V-S31,V- V-S31,V-
- - S31,V-S32,V- S31,V-S32,V- -
Skilling - - --- --- S32,V-S33,V- S32,V-S33,V- - -- ---
- - S33,V-S34,V- S33,V-S34,V- -
S34 S34
Sat - - -
Theory - - --- --- -- -- - -- --
- - -
about:blank 33/38
12/18/24, 12:34 PM about:blank

- - -
Tutorial - - --- --- -- -- - -- --
- - -
- - -
Lab - - --- --- -- -- - -- --
- - -
V-S31,V- V-S31,V- V-S11,V- V-S11,V-
- - S31,V-S32,V- S31,V-S32,V- - S11,V-S12,V- S11,V-S12,V-
Skilling - - --- --- S32,V-S33,V- S32,V-S33,V- - S12,V-S13,V- S12,V-S13,V-
- - S33,V-S34,V- S33,V-S34,V- - S13,V-S14,V- S13,V-S14,V-
S34 S34 S14 S14
- - -
Theory -- -- -- -- -- --
- - -
- - -
Tutorial -- -- -- -- -- --
- - -
Sun
- - -
Lab -- -- -- -- -- --
- - -
- - -
Skilling -- -- -- -- -- --
- - -

REMEDIAL CLASSES:

Supplement course handout, which may perhaps include special lectures and discussions that would be
planned, and schedule notified according

SELF-LEARNING:

Assignments to promote self-learning, survey of contents from multiple sources.

S.no Topics CO ALM References/MOOCS

DELIVERY DETAILS OF CONTENT BEYOND SYLLABUS:

Content beyond syllabus covered (if any) should be delivered to all students that would be planned, and
schedule notified accordingly.
Advanced Topics, Additional Reading, Research
S.no CO ALM References/MOOCS
papers and any

EVALUATION PLAN:

Evaluation Evaluation Assessment Duration

Weightage/Marks CO1 CO2 CO3 CO4 CO5 CO6
Type Component Dates (Hours)
Skill Sem- Weightage 8 8
120
End End Exam Max Marks 50 50
Semester Lab End Weightage 8 8
Summative Semester 120
Evaluation Exam Max Marks 50 50
Total= 40 End
% Weightage 24 6 6 6 6
Semester 180
Exam Max Marks 100 25 25 25 25
about:blank 34/38
12/18/24, 12:34 PM about:blank

Global Weightage 5 1.25 1.25 1.25 1.25

120
Challenges Max Marks 100 25 25 25 25
Skilling Weightage 5 5
Continuous 120
In Evaluation Max Marks 50 50
Semester Weightage 5 1.25 1.25 1.25 1.25
MOOCs
Formative 120
Review Max Marks 100 25 25 25 25
Evaluation
Total= 24 Continuous Weightage 5 5
% Evaluation -
120
Lab
Max Marks 50 50
Exercise
Weightage 4 1 1 1 1
ALM 120
Max Marks 100 25 25 25 25
Skill In-Sem Weightage 6 6
120
Exam Max Marks 50 50
In Lab In Weightage 6 6
Semester Semester 120
Summative Exam Max Marks 50 50
Evaluation
Total= 36 Semester in Weightage 12 6 6
90
% Exam-II Max Marks 50 25 25
Semester in Weightage 12 6 6
90
Exam-I Max Marks 50 25 25

ATTENDANCE POLICY:

Every student is expected to be responsible for regularity of his/her attendance in class rooms and
laboratories, to appear in scheduled tests and examinations and fulfill all other tasks assigned to him/her in
every course
In every course, student has to maintain a minimum of 85% attendance to be eligible for appearing in
Semester end examination of the course, for cases of medical issues and other unavoidable circumstances the
students will be condoned if their attendance is between 75% to 85% in every course, subjected to
submission of medical certificates, medical case file and other needful documental proof to the concerned
departments

DETENTION POLICY :

In any course, a student has to maintain a minimum of 85% attendance and In-Semester Examinations to be
eligible for appearing to the Semester End Examination, failing to fulfill these conditions will deem such
student to have been detained in that course.

PLAGIARISM POLICY :

Supplement course handout, which may perhaps include special lectures and discussions

COURSE TEAM MEMBERS, CHAMBER CONSULTATION HOURS AND CHAMBER VENUE DETAILS:

Supplement course handout, which may perhaps include special lectures and discussions
Chamber
Delivery Sections Chamber Chamber Signature
Consultation
Name of Faculty Component of Consultation Consultation of Course
Timings for
of Faculty Faculty Day (s) Room No: faculty:
each day
Raju Anitha P 34-C - - - -
about:blank 35/38
12/18/24, 12:34 PM about:blank

Anjali Devi Swarna P 13-C - - - -

Anjali Devi Swarna S 13-B - - - -
Radha Mothukuri S 23-B - - - -
Vidya Ponnam L 11-MA - - - -
23-C,11-
Vidya Ponnam P - - - -
A
Vidya Ponnam S 11-A - - - -
Tirandasu Kumar P 12-B - - - -
Venkata Suresh
P 33-C - - - -
Bhavanam
Palthiya Rao P 31-B - - - -
Palthiya Rao S 31-B - - - -
Anantha
L 21-MA - - - -
Gottimukkala
Anantha 32-B,21-
P - - - -
Gottimukkala A
Anantha 21-A,13-
S - - - -
Gottimukkala B,32-B
Deepa Amuth L 24-MA - - - -
24-A,33-
Deepa Amuth P - - - -
B
33-B,24-
Deepa Amuth S - - - -
A
14-B,24-
Gunti Surendra P - - - -
C
Gunti Surendra S 14-B - - - -
Bejjam Benarji L 12-MA - - - -
31-C,12-
Bejjam Benarji P - - - -
A
Bejjam Benarji S 12-A - - - -
34-B,13-
Tulasi Rajesh P - - - -
B
Tulasi Rajesh S 34-B - - - -
Vuyyuru Reddy P 32-C - - - -
Sreekanth Kavuri L 13-MA - - - -
24-B,13-
Sreekanth Kavuri P - - - -
A
13-A,32-
Sreekanth Kavuri S - - - -
B
Adapa Gopi P 11-C - - - -
Dayanidhi Mohapatra S 24-B - - - -
Anita Pradhan S 21-B - - - -
Sreenivasulu Bolla P 14-C - - - -
nuthakki praveena S 21-B - - - -
Jagan Sarihaddu P 12-C - - - -
komali Govindu P 21-C - - - -
KISHORE DASARI P 22-C - - - -
PINAPATI RAO L 34-MA - - - -
about:blank 36/38
12/18/24, 12:34 PM about:blank

PINAPATI RAO P 34-A - - - -

PINAPATI RAO S 34-A - - - -
RAMAKRISHNA
L 14-MA - - - -
REGULAGADDA
RAMAKRISHNA
P 14-A - - - -
REGULAGADDA
RAMAKRISHNA
S 14-A - - - -
REGULAGADDA
Venkata Kalavala L 31-MA - - - -
Venkata Kalavala P 31-A - - - -
Venkata Kalavala S 31-A - - - -
Goda Srinivasa Rao P 23-B - - - -
12-B,23-
Goda Srinivasa Rao S - - - -
B
Badde Prakash L 32-MA - - - -
22-B,32-
Badde Prakash P - - - -
A
22-B,32-
Badde Prakash S - - - -
A
BILLA RAO S 11-B - - - -
Boyina Kavya P 11-B - - - -
NIMMAGADDA
P 21-B - - - -
MURALIKRISHNA
Sampathirao
L 23-MA - - - -
Suneetha
Sampathirao
P 23-A - - - -
Suneetha
Sampathirao
S 23-A - - - -
Suneetha
shiyam v L 33-MA - - - -
shiyam v P 33-A - - - -
shiyam v S 33-A - - - -
Singaraju Srinivasulu L 22-MA - - - -
Singaraju Srinivasulu P 22-A - - - -
22-A,14-
Singaraju Srinivasulu S - - - -
B
Balaji Velchuri S 11-B - - - -
Chiranjeevi
S 12-B - - - -
Kothapalli

GENERAL INSTRUCTIONS

Students should come prepared for classes and carry the text book(s) or material(s) as prescribed by the
Course Faculty to the class.

NOTICES

Most of the notices are available on the LMS platform.

All notices will be communicated through the institution email.

about:blank 37/38
12/18/24, 12:34 PM about:blank

All notices concerning the course will be displayed on the respective Notice Boards.

Signature of COURSE COORDINATOR

(Anantha Rao Gottimukkala)

Signature of Department Prof. Incharge Academics & Vetting Team Member

Department Of CSE-Honors

HEAD OF DEPARTMENT:

Approval from: DEAN-ACADEMICS

(Sign with Office Seal) [object HTMLDivElement]

about:blank 38/38