12/26/24, 6:59 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 :DATA STRUCTURES
Course Code :24SC1203
L-T-P-S Structure : 3-0-2-4
Pre-requisite :
Credits :5
Course Coordinator :Siva Kumar Pathuri
Team of Instructors :
Teaching Associates :
Syllabus :Algorithm Analysis: Mathematical Background, Model, Analyze, Running Time Calculations.
Sorting: Introduction to Sorting Algorithm, Insertion Sort, Shell sort, Heap sort, Merge sort, Quick sort,
Bucket Sort, External Sorting. Dynamic Memory implementation of linear data structures: Singly Linked
list, doubly linked list, circularly linked list, Applications of data structures: Polynomial Manipulation,
Implementation of Stacks and Queues using Linked Lists, Circular Queue, Deque(Double ended queue),
Applications of Stacks and Queues. Priority Queues (Heaps): Model, Simple Implementations, Binary
Heap, Applications of Priority Queues. Hashing: Introduction to Hashing, Hash Function, Separate
Chaining, Hash Tables without Linked Lists, Rehashing, Hash Tables in the Standard Library, Extendible
Hashing. Trees: Introduction to trees, Binary Trees, Tree Traversals, The Search Tree: Binary Search Trees,
AVL Trees, Splay Trees, B-Trees, Red black trees. Graph Data Structure: Introduction to Graph data
structure – basic terminologies- transitive closure -representation of graphs: adjacency matrix, linked list-
Graph traversals: Breadth First Search, Depth First Search)- minimal spanning trees: Prim’s &Kruskal’s
Algorithm.
Text Books :1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2010 , Second Edition,
PearsonEducation. 2. Ellis Horowitz, Fundamentals of Data Structures in C: Second Edition, 2015
Reference Books :1. A.V.Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures And Algorithms”,
Pearson Education, First Edition Reprint2003. 2. Horowitz, Sahni, Anderson Freed, “Fundamentals of
datastructures in C” , Second Edition-2007. 3. R. F. Gilberg, B. A. Forouzan, “Data Structures”, Second
Edition, Thomson India Ed ition, 2005 4. Robert Kruse, C.L. Tondo, Bruce Leung, Shashi Mogalla, “Data
Structures & Program Design in C”, FourthEdition-2007.
Web Links :1. https://nptel.ac.in/courses/106102064 2. https://nptel.ac.in/courses/106101060/4 3.
https://www.edx.org/course/algorithms-and-data-structures-1 4. https://in.udacity.com/course/intro-to-
algorithms--cs215 5. https://www.coursera.org/learn/data-structures?action=enroll
Course Rationale :Student will explore several fundamentals of data structures in computer science and
learns to implement them in C. Use of appropriate Data Structures enables a computer system to perform its
task more efficiently by influencing the ability of computer to store and retrieve data.
Course Objectives :The fundamental study, analysis, and implementation of basic data structures and
algorithms for the development of real time practical applications
Industry Specific Tools : Dev C++- Open source Link: https://www.bloodshed.net/
Sector Skill Council :CO1 - Understand various sorting algorithms and analyse the efficiency of the
algorithms.3IT-ITeS Sector Skill CouncilApparel - IT ServicesData ScientistsJunior Data Associate CO2 -
Implement and evaluate Linear Data Structures and Demonstrate their applications. 3 IT-ITeS Sector Skill
Council Engineering and R&D Product Manufacturing Support Design Engineer - PMS CO3 - Implement
and evaluate tree data structures and understand hashing techniques 3 IT-ITeS Sector Skill Council Apparel
- IT Services Data Scientists Junior Data Associate (Version 2) SSC/Q0401 CO4 - Understand graph data
structures and apply graphs to solve problems 2 IT-ITeS Sector Skill Council Apparel - Future Skills
Artificial Intelligence & Big Data Analytics AI - Data Engineer v2 SSC/Q8106 CO5 - Design, Develop and
about:blank 1/53
12/26/24, 6:59 PM about:blank

evaluate common practical applications for linear and nonlinear data structures. 3 IT-ITeS Sector Skill
Council Apparel - Future Skills Artificial Intelligence & Big Data Analytics AI - Data Engineer v2
SSC/Q8106 CO6 - Skill the students in such a way that students will be able to develop logic that help them
to create programs on both linear and non-linear datastructuresand its applications. 3 IT-ITeS Sector Skill
Council IT-Ites - Future Skills Internet of Things IoT - Solution Architect SSC/Q8202

COURSE OUTCOMES (COs):

Blooms
CO Taxonomy
Course Outcome (CO) PO/PSO
NO Level
(BTL)
Understand various sorting algorithms and analyze the
CO1 PO1,PO2 2
efficiency of the algorithms
Implement and evaluate Linear Data Structures and
CO2 PO1,PO2 3
Demonstrate their applications
Implement and evaluate tree data structures and understand
CO3 PO1,PO2 3
hashing techniques
Understand graph data structures and apply graphs to solve
CO4 PO1,PO2 2
problems
Design, Develop and evaluate common practical applications
CO5 PSO1,PO1,PO2,PO4 4
for linear and nonlinear data structures.
Skill the students in such a way that students will be able to
CO6 PO1,PO4,PO2 3
develop and create programs as well as applications in DS

COURSE OUTCOME INDICATORS (COIs)::

Outcome Highest
COI-1 COI-2 COI-3 COI-4 COI-5
No. BTL
Btl-3
Btl-3 Introduction to
Btl-2 Btl-4
Introduction to Divide and
Mathematical Demonstrate
sorting. Conquer
background, External sorting
CO1 2 Demonstrate and Approach.
model and and Bucket
Implement Demonstrate and
running time Sorting. Analyze
Insertion Sort, Implement
calculations its Efficiency
Shell Sort, and Merge Sort and
Quick Sort.
Btl-3
Introduction to
Btl-3
Dynamic
Model of
Memory Btl-3 Btl-3
priority queues
Allocation and List based List based
and
List-based implementations implementations
CO2 3 Implementation
implementation. of Stack and of Queue and
of Binary Heap
Illustrate Enumerate its Enumerate its
and
implementation applications. applications.
Demonstrate
of different Lists
applications.
and its
applications
CO3 3 Btl-4 Btl-3 Btl-3 Btl-3
Introduction to Double hashing, Tree traversal Demonstrate
Hashing table, Extendible and Search trees Red-Black tree,
Hashing Heap Sort,
about:blank 2/53
12/26/24, 6:59 PM about:blank

function, hashing and construction and Splay tree and

Separate Rehashing implementation B- tree
chaining and
open addressing
Btl-3 Btl-3
Introduction to Graph
Graph data Traversing Btl-3
Btl-3
structure – Basic techniques – Minimum
Minimum
CO4 2 terminologies. Demonstrate spanning tree –
spanning tree –
Transitive Breadth First Kruskal’s
Prim’s algorithm
closure and Search and algorithm.
representation of Depth First
graphs Search
Btl-4
Analyze and
differentiate the
linear and
CO5 4
nonlinear data
structures based
on their
properties
Btl-4
Discriminate
the
significance of
both linear and
nonlinear data
structures with
respect to real
CO6 3 world
applications.
And skill the
students so that
they develop
solutions for
some real
world
problems.

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
PO3 Design/Development of Solutions: Design solutions for complex engineering problems and design
system components or processes that meet the specified needs with appropriate consideration for the
about:blank 3/53
12/26/24, 6:59 PM about:blank

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.
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.

about:blank 4/53
12/26/24, 6:59 PM about:blank

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:

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

Introduction to data Ref Book

COI- End Semester
1 CO1 structures- Mathematical [1],CH 3.1Page Chalk,Talk
1 Exam,SEM-EXAM1
background, Model no 57-58

Algorithm Analysis -
Ref Book
COI- Running time End Semester
2 CO1 [1],CH 2.1Page Chalk,PPT,Talk
2 calculations(Asymptotic Exam,SEM-EXAM1
no 31-36
Notations)

Ref Book
COI- Insertion Sort Analysis End Semester
3 CO1 [1],CH 7.2Page Chalk,PPT,Talk
2 and Implementation Exam,SEM-EXAM1
no 235 -237

Ref Book
COI- Shell Sort Analysis and End Semester
4 CO1 [1],CH 7.4Page Chalk,PPT,Talk
3 Implementation Exam,SEM-EXAM1
no 238-240

Ref Book
COI- Quick Sort, Quick Sort End Semester
5 CO1 [1],CH 7.7Page Chalk,PPT,Talk
1 Implementation Exam,SEM-EXAM1
no 252-262

Ref Book
COI- End Semester
6 CO1 Quick Sort Analysis [1],CH 7.7Page Chalk,PPT,Talk
4 Exam,SEM-EXAM1
no 252-262

Ref Book
COI- Merge Sort Analysis and End Semester
7 CO1 [1],CH 7.6Page Chalk,PPT,Talk
4 Implementation Exam,SEM-EXAM1
no 246 -250

Ref Book
[1],CH 7.5Page
Demonstrate Bucket Sort, no 242- End Semester Exam,Lab
COI-
8 CO1 Demonstrate External 245,RefBook Chalk,PPT,Talk Weekly exercise,SEM-
4
Sorting [1],[1], CH EXAM1
7.11,Page no
250-252

Singly Linked List - Ref Book

COI- End Semester
9 CO2 Creation, Insertion, [1],CH 3.1Page Chalk,PPT,Talk
1 Exam,SEM-EXAM1
Deletion, Display no 57-58

Operations on SLL: Ref Book

COI- End Semester
10 CO2 ,Merge two Linked List , [1],CH 3.1Page Chalk,PPT,Talk
2 Exam,SEM-EXAM1
Sort SLL,Reverse SLL no 57-58
about:blank 5/53
12/26/24, 6:59 PM about:blank

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

Doubly Linked list - Ref Book

COI- End Semester
11 CO2 Creation, Insertion, [1],CH 3.2Page Chalk,PPT,Talk
2 Exam,SEM-EXAM1
Deletion, Display no 59-68

Circular Linked list - Ref Book

COI- End Semester
12 CO2 Creation, Insertion, [1],CH 3.2Page Chalk,PPT,Talk
2 Exam,SEM-EXAM1
Deletion, Display no 59-68

Ref Book
COI- Stack Using Singly End Semester
13 CO2 [1],CH 3.3Page Chalk,PPT,Talk
3 Linked list Exam,SEM-EXAM1
no 78-101

Ref Book
COI- Queue Using Singly End Semester
14 CO2 [1],CH 3.3Page Chalk,PPT,Talk
3 Linked List Exam,SEM-EXAM1
no 78-101

Ref Book
COI- Infix to Postfix End Semester
15 CO2 [1],CH 3.3Page Chalk,PPT,Talk
2 Expression Conversion Exam,SEM-EXAM1
no 78-93

Infix to Postfix Ref Book

COI- End Semester
16 CO2 Expression Conversion [1],CH 3.3Page Chalk,PPT,Talk
3 Exam,SEM-EXAM1
Implementation no 78-93

Evaluation of postfix Ref Book

COI- End Semester
17 CO2 expression, Balancing [1],CH 3.3Page Chalk,PPT,Talk
4 Exam,SEM-EXAM1
symbols no 88-90

Types of Queue –
Ref Book
COI- Circular End Semester
18 CO2 [1],CH 3.4Page Chalk,PPT,Talk
4 Queue(Implementation Exam,SEM-EXAM1
no 95-101
Using Arrays

Priority Queue
Priority Queue
COI- (Implementation End Semester
19 CO2 (Implementation Using Chalk,PPT,Talk
4 Using Linked Exam,SEM-EXAM1
Linked List),
List),

Ref Book End Semester Exam,Lab

COI- Types of Queues –
20 CO2 [1],CH 3.4Page Chalk,PPT,Talk Weekly exercise,SEM-
4 Dequeue
no 95-101 EXAM1

Hashing - Hash
function(Implementation
for Division and Mid- Ref Book
COI- End Semester
21 CO3 Square Method , Folded [1],CH 5.3Page Chalk,PPT,Talk
1 Exam,SEM-EXAM2
Method, Multiplication no 168 -172
Method, Separate
chaining(Implementation)

about:blank 6/53
12/26/24, 6:59 PM about:blank

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

Linear probing
Ref Book
COI- (Implementation)and End Semester
22 CO3 [1],CH 5.4Page Chalk,PPT,Talk
2 Quadratic Exam,SEM-EXAM2
no 173-180
probing(Implementation

Ref Book
[1],CH 5.4Page
COI- Double hashing, no 180-181,Ref End Semester
23 CO3 Chalk,PPT,Talk
3 Rehashing Book [1],CH Exam,SEM-EXAM2
5.4 Pageno 168-
180

Ref Book
[1],CH 5.4Page
COI- no 180-181,Ref End Semester
24 CO3 Extendible hashing Chalk,PPT,Talk
3 Book [1],CH Exam,SEM-EXAM2
5.4 Pageno 168-
180

Binary Tree - Tree Ref Book

COI- End Semester
25 CO3 Terminology, Expression [1],CH 4.2Page Chalk,PPT,Talk
3 Exam,SEM-EXAM2
tree construction no 108 -116

Binary Search Tree – Ref Book

COI- End Semester
26 CO3 Construction, Insertion [1],CH 4.3Page Chalk,PPT,Talk
3 Exam,SEM-EXAM2
(Implementation) no 116-123

Binary Search Tree Ref Book

COI- End Semester
27 CO3 Implementation: Deletion [1],CH 4.3Page Chalk,PPT,Talk
3 Exam,SEM-EXAM2
() no 116-123

Binary Search Tree Ref Book

COI- End Semester
28 CO3 operations: [1],CH 4.3Page Chalk,PPT,Talk
3 Exam,SEM-EXAM2
min(),max(),search(), no 116-123

Ref Book
COI- AVL Tree – Rotations End Semester
29 CO3 [1],CH 4.4Page Chalk,PPT,Talk
4 and Operations Exam,SEM-EXAM2
no 127-138

AVL Tree Ref Book

COI- End Semester
30 CO3 Implementation [1],CH 4.4Page Chalk,PPT,Talk
4 Exam,SEM-EXAM2
(Insertion no 127-138

T. Book [1],CH
Binary Heap, Heap Sort 3.4 Pageno 95-
COI- End Semester
31 CO3 Analysis and 108,Ref Book Chalk,PPT,Talk
4 Exam,SEM-EXAM2
Implementation [1],CH 7.5Page
no 242-245

about:blank 7/53
12/26/24, 6:59 PM about:blank

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

T. Book [1],CH
COI- End Semester
32 CO3 B – Tree Construction 4.7 Pageno 134- Chalk,PPT,Talk
4 Exam,SEM-EXAM2
138

RefBook
COI- [1],CH End Semester
33 CO3 Splay tree operations Chalk,PPT,Talk
4 4.5,Pageno 138 Exam,SEM-EXAM2
- 141

RefBook
End Semester Exam,Lab
COI- Construction of Red- [1],CH 4.6,
34 CO3 Chalk,PPT,Talk Weekly exercise,SEM-
4 Black trees Pageno 134-
EXAM2
140

Graphs Representation –
Adjacency Matrix, Ref Book
COI- End Semester
35 CO4 Graphs Representation – [1],CH 9.1Page Chalk,PPT,Talk
1 Exam,SEM-EXAM2
Linked List, Transitive no 300-302,
Closure

Ref Book
COI- End Semester
36 CO4 Graph Traversal – DFS [1],CH 9.2Page Chalk,PPT,Talk
2 Exam,SEM-EXAM2
no 302 -306

Ref Book
COI- End Semester
37 CO4 Graph Traversal- BFS [1],CH 9.2Page Chalk,PPT,Talk
2 Exam,SEM-EXAM2
no 302 -306

Ref Book
COI- Minimum Spanning Tree End Semester
38 CO4 [1],CH 9.5Page Chalk,PPT,Talk
4 – Prim’s Algorithm Exam,SEM-EXAM2
no 330-332

Ref Book End Semester Exam,Lab

COI- Minimum Spanning Tree
39 CO4 [1],CH 9.5Page Chalk,PPT,Talk Weekly exercise,SEM-
4 - Kruskal’s Algorithm
no 332 – 335 EXAM2

Lecture Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Students will able to understand the types of data structures.

Session Outcome: 2 Students will able to understand asymptotic notations and complexity analysis.

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

about:blank 8/53
12/26/24, 6:59 PM about:blank

Introducing Data Structures and Syllabus and LTPS --- NOT

20 Structure. Explain the classification of Data Structures - 2 Chalk APPLICABLE
Linear & Non-Linear. ---
Mathematical Background. Definitions of Asymptotic --- NOT
20 notations O(n), Ω(n) and Ɵ(n) – Best, Average and Worst 2 Talk APPLICABLE
Case ---
--- NOT
5 Conclusion and Summary 2 Talk APPLICABLE
---

SESSION NUMBER : 2

Session Outcome: 1 . Students to know about running time calculations.

Session Outcome: 2 Students can identify the incremental order of time complexity.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
Lecture-1: Running time calculations, A simple example
General rules Ask the students to find the running time of --- NOT
20 following problems. I) Problem for( i=0; i < n-1 ; i++) 2 Talk APPLICABLE
printf(“%d”, i+75); II) Problem for( i=0; i < n-1 ; i++) { ---
for (j=0; j
Lecture-2: Deliver a mathematical calculation of running
time of sample algorithm and ask the students to analyze
it. Algorithm: Time taken 1) Start ------ 0 2) Input: Read
Quiz/Test
20 ‘n’ ------ 1 3) initialize: sum=0, i=1 ------ 2 4) Process: 3 Talk
Questions
sum = sum + i ------ n 5) i = i +1 ------ n 6) if ( i < = n )
go to step 4 ------ n 7) print ‘sum’ ------ 1 8) Stop ------ 0
Total time in function f(n) = 3n + 4
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 3

Session Outcome: 1 Students able to understand insertion sort

Session Outcome: 2 Students can implement insertion sort

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
Explain How insertion sort works and analyze its time
20 3 Chalk APPLICABLE
complexity with an example
---
10 Practice session 1: Consider there are 10 group of 3 Talk --- NOT
members in cinema hall for taking tickets from counter, APPLICABLE

about:blank 9/53
12/26/24, 6:59 PM about:blank

arrange the group of members in a line according to the ---

height of a persons. The height of persons is given in
centimeters as follows. 165, 173, 195, 150, 179, 184,
139, 145, 169, 151. After each iteration, draw the
elements in array.
Practice session -2: Delhi City, where peace prevails
most of the time. Not everyone is a huge fan of peace,
though. Certainly not Mr. Rajesh, whose identity is not
known to us - yet. Mr. Rajesh has somehow managed to
bring zombies to Bangalore City to attack and destroy the
--- NOT
city. If he sees a zombie, he marks them in his list with
10 3 Talk APPLICABLE
their power. After generating the entire list of power of
---
these creatures, he decides to arrange this data. All the
zombies arranged in ascending sorted manner of their
power. The powers are given as: 12, 43, 10, 72, 55, 32,
21, 63, 18, 31 Implement insertion sort program to
arrange the powers in ascending order.
--- NOT
5 Conclusion 1 Talk APPLICABLE
---

SESSION NUMBER : 4

Session Outcome: 1 Students come to know about shell sort

Session Outcome: 2 Students can implement shell sort

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
Explain how shell sort works using shell's original
20 2 Talk APPLICABLE
sequence: N/2, N/4, ..., 1 (repeatedly divided by 2).
---
--- NOT
10 Ask the students to implement shell sort. 3 Talk APPLICABLE
---
Analyze the time complexity of shell sort. Discuss what --- NOT
10 disadvantages of insertion sort does the shell sort 4 Talk APPLICABLE
overcome. ---
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 5

Session Outcome: 1 Students able to understand the quick sort

Session Outcome: 2 Students able to analyze the time complexity of quick sort

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

about:blank 10/53
12/26/24, 6:59 PM about:blank

--- NOT
5 Atten 1 Talk APPLICABLE
---
--- NOT
20 Explain Quick sort algorithm with best case derivation. 2 Talk APPLICABLE
---
Ask the students to sort the following data using quick --- NOT
10 sort: 55,11,22,99,55,33, 77,88, 33 and then analyze the 3 Chalk APPLICABLE
Best case for Quick sort ---
--- NOT
Sub-topic 2 (Lecture): Explain Quick sort algorithm with
10 4 Chalk APPLICABLE
worst case derivation.
---
--- NOT
5 Conclusion 1 PPT APPLICABLE
---

SESSION NUMBER : 6

Session Outcome: 1 Students able to implement quick sort algorithm.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
10 Recap / Introduction 1 Talk APPLICABLE
---
Ask the students to sort the following data using quick
One minute
20 sort: 55,11,22,99,55,33, 77,88, 33 and then analyze the 3 Talk
paper
worst case for Quick sort
Ask the Students to analyze the following code for quick --- NOT
10 sort using the system. 3 Chalk APPLICABLE
https://www.geeksforgeeks.org/quick-sort/ ---
--- NOT
5 Conclusion 1 PPT APPLICABLE
---

SESSION NUMBER : 7

Session Outcome: 1 Students come to understand the concept and implementation of merge sort

Session Outcome: 2 Students able to analyze the time complexity of merge sort

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
10 Explain Merge sort and its basics with an example 2 Talk APPLICABLE
---

about:blank 11/53
12/26/24, 6:59 PM about:blank

Here is an array of ten integers: 5 3 8 9 1 7 0 2 6 4 Draw --- NOT

10 this array after the TWO recursive calls of merge sort are 3 Talk APPLICABLE
completed, and before the final merge step has occurred. ---
Lecture: Analyze the complexity of merge sort algorithm.
MergeSort(arr[], l, r) If r > l {1. Find the middle point
--- NOT
middle m = (l+r)/2 2. Call mergeSort for first half: Call
20 3 Talk APPLICABLE
mergeSort(arr, l, m) 3. Call mergeSort for second half:
---
Call mergeSort(arr, m+1, r) 4. Merge the two halves
sorted in step 2&3: Call merge(arr, l, m, r)
--- NOT
5 Conclusion 2 Talk APPLICABLE
---

SESSION NUMBER : 8

Session Outcome: 1 Students able to understand the basic concept of Bucket Sort

Session Outcome: 2 Students able to Understand External Sorting

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
20 Explain Bucket Sort and its Basic concept 2 Talk APPLICABLE
---
--- NOT
Ask the students to sort the following data using bucket
10 3 Talk APPLICABLE
sort: 55,11,22,99,55,33, 77,88, 33
---
--- NOT
Explain External sorting and two phases of external
10 2 Talk APPLICABLE
sorting (1. Sort phase 2. Merge phase) with an example
---
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 9

Session Outcome: 1 Students come to know about singly linked list operations

Session Outcome: 2 Students able to implement operations like Creation, Insertion, Deletion, Display SLL

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
Explain singly linked list operations operations like
20 2 Talk APPLICABLE
Creation, Insertion, SLL.
---
20 Explain singly linked list operations operations like 2 Talk --- NOT
Deletion, Display SLL with diagram’s APPLICABLE
about:blank 12/53
12/26/24, 6:59 PM about:blank

---
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 10

Session Outcome: 1 Students come to know about singly linked list operations

Session Outcome: 2 Students able to implement opeations like reverse SLL, Sort , Merge SLL

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
Explain singly linked list operations like reverse SLL
20 3 Talk APPLICABLE
with diagram’s
---
Lecture: Explain singly linked list operations like Sort --- NOT
20 SLL with diagram’s Lecture: Explain singly linked list 3 Talk APPLICABLE
operations to Merge SLL with diagram’s ---
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 11

Session Outcome: 1 Students come to know about doubly linked list operations

Session Outcome: 2 Students able to implement doubly linked list

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
20 Explain doubly linked list operations with diagram’s 2 Talk APPLICABLE
---
In a browsing center, the customer Kishore is sitting in a
computer and browses the face book. Once he opened the
face book, he wants to have a page of his friend Hari and
gave a friend request and come back to his home page One minute
20 3 Talk
and open his other friend Lalitha’s page and read all her paper
status and going on doing like this. Implement this as an
operation of creation, insertion, deletion and searching of
friends using Double Linked List.
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 12

about:blank 13/53
12/26/24, 6:59 PM about:blank

Session Outcome: 1 Students come to know about circular linked list operations

Session Outcome: 2 Students able to implement circular linked list

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
Explain the concept of CLL and its operations like
Insertion of elements at begin, at the given position and --- NOT
20 at end operations on Circular SLL Ask the students to 2 Talk APPLICABLE
execute deletion at begin and end operation on Circular ---
SLL and Display the elements in CLL
In a Coco game, Krishna, Vasu, Shiva, Ganesh, Sathesh,
Naveen and Anand are playing at an University ground.
The rally tag is given to Anand. Anand stood and ran --- NOT
20 around the players and push Krishna as his tag. Imitate it 3 Talk APPLICABLE
as a circular linked list of Single and Double direction list ---
and display all the players name in the list. Also Find
how is the shortest person in the list.
Leading
5 Conclusion 2 Chalk
question

SESSION NUMBER : 13

Session Outcome: 1 Students can understand stack operations

Session Outcome: 2 Students able to implement stack using linked list

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
20 Linked list implementation of stacks 2 Talk APPLICABLE
---
--- NOT
Ask the students to write and execute a program to
20 3 Talk APPLICABLE
implement Stack using Linked List
---
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 14

Session Outcome: 1 Students come to know about queue operations

Session Outcome: 2 Students able to implement queue using linked list

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
about:blank 14/53
12/26/24, 6:59 PM about:blank

--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
20 Linked list implementation of queue 2 Talk APPLICABLE
---
In a railway station an engine is connected with the N
number of Bogies which are connected in one direction --- NOT
20 from engine to the last bogie. Implement this as an 3 Talk APPLICABLE
operation of creation, insertion, deletion and searching of ---
a bogie using Single Linked List.
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 15

Session Outcome: 1 Students come to know about operations of stack

Session Outcome: 2 Students able to convert infix to postfix Expression

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
Explain how to convert an infix expression to postfix
20 2 Talk APPLICABLE
using stacks
---
Practice Session 1: Convert the given infix expression
(a*(b+ c))+ (b/d)*a into postfix expression . Suppose that
we are using the usual Stack concept to convert the --- NOT
20 expression from infix to postfix notation. What is the 3 Talk APPLICABLE
maximum number of symbols that will appear on the ---
stack at one time during the conversion of this
expression?
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 16

Session Outcome: 1 Students able to implement infix to postfix expression conversion

Session Outcome: 2 Students able to analyze the time complexity of infix to postfix expression conversion

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
20 Write a c-Program to convert an infix expression to 2 Talk --- NOT
postfix using stacks APPLICABLE

about:blank 15/53
12/26/24, 6:59 PM about:blank

---
The first input will be a single integer N denoting the
number of test cases to take. After this there will be
exactly N lines, each line a valid infix string. The string
--- NOT
will be a valid postfix expression consisting of integers,
20 3 Talk APPLICABLE
binary operators (+, -, *, / and $) and parenthesis. Every
---
integer, operator and parenthesis will be compulsorily
separated by a SPACE. The symbol „?‟ denotes the end
of expression.
--- NOT
5 Conclusion 2 Talk APPLICABLE
---

SESSION NUMBER : 17

Session Outcome: 1 Students able to evaluate postfix expressions using stack

Session Outcome: 2 Students able to use the recursion and to know types of recursions

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
Lecture: Explain the evaluation of postfix expression
10 2 Talk APPLICABLE
using stack
---
Ask the students to write a program for evaluating the --- NOT
10 following postfix expression using stack 1 2 3 * + 4 – 3 Talk APPLICABLE
Reference : http://scriptasylum.com/ ---
--- NOT
10 Explain about balancing symbols 2 Talk APPLICABLE
---
Given an expression string exp, write a program to --- NOT
10 examine whether the pairs and the orders of “{“, “}”, “(“, 3 Talk APPLICABLE
“)”, “[“, “]” are correct in exp ---
--- NOT
5 Conclusion 2 Talk APPLICABLE
---

SESSION NUMBER : 18

Session Outcome: 1 Students able to understand the types of queues- Circular Queue

Session Outcome: 2 Students able to solve real-time problems using queues

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
20 Explain the concept of Circular Queue and its advantage 2 Talk --- NOT
over Linear Queue APPLICABLE
about:blank 16/53
12/26/24, 6:59 PM about:blank

---
Use queue concept to implement the following to print 15
files. In the situation where there are multiple users or a
networked computer system, you probably share a printer
with other users. When you request to print a file, your
Quiz/Test
20 request is added to the print queue. When your request 3 Talk
Questions
reaches the front of the print queue, your file is printed.
This ensures that only one person at a time has access to
the printer and that this access shows the served user
leaves the queue first.- Circular queue implementation.
--- NOT
5 Conclision 2 PPT APPLICABLE
---

SESSION NUMBER : 19

Session Outcome: 1 Students come to know about priority Queues

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
Explain the concept of Priority queues and their --- NOT
20 applications. With its operations like Enqueue, Dequeue, 2 Talk APPLICABLE
Display. ---
Consider a bank with one service counter. The persons
will stand in a queue. For example if customer 1 needs 30
mins to finish and customer 2,3 needs only 2 mins each,
servicing the customer 1 and then 2,3 leads to --- NOT
20 unnecessary delay and thereby the decreases the 2 Talk APPLICABLE
efficiency. Eg: , , , is the queue along with service time of ---
each customer. Now remove the one with low service
time. Do this until all the customers are serviced and
show the queue configuration at each instant.
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 20

Session Outcome: 1 Students able to understand the application of queues- Double ended queue

Session Outcome: 2 Students able to implement real-time problems using queues

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
Explain the concept of Double Ended queue and its
20 2 Talk APPLICABLE
advantage.
---

about:blank 17/53
12/26/24, 6:59 PM about:blank

Given an integer m, size of double ended queue, and n

operations, implement the double ended queue. Queries
--- NOT
are defined as below. 1) 1 x --> insert an element x to the
20 3 Talk APPLICABLE
front end 2) 2 x --> insert an element x to the rear end 3)
---
3 --> delete an element from front end a) 4 --> delete an
element from rear end
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 21

Session Outcome: 1 Students come to know about the concept of separate chaining

Session Outcome: 2 Students able to resolve collisions using separate chaining

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
Explanation of separate chaining using hashing --- NOT
20 technique. Initialization routine for separate chaining 2 Talk APPLICABLE
hash table. ---
Ask the students to construct hash table using separate
chaining for the following elements of table size 15, --- NOT
10 design your own hash function. 3 Talk APPLICABLE
23,27,98,6,17,51,77,72,36,53. Ask the students to ---
implement initialization function
Ask the students to implement the following operations --- NOT
10 on hash table using separate chaining 1.insert () 2. search 3 Talk APPLICABLE
() ---
--- NOT
5 Conclusion 2 Talk APPLICABLE
---

SESSION NUMBER : 22

Session Outcome: 1 Students able to resolve collisions using different collision resolution techniques

Session Outcome: 2 Students able to implement linear probing, quadratic probing

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
Explanation of Open Addressing and different types of --- NOT
20 strategies to resolve Collision. Explanation of Linear 2 Talk APPLICABLE
probing and its implementation ---
--- NOT
10 Explanation of quadratic probing and its implementation. 2 PPT APPLICABLE
---

about:blank 18/53
12/26/24, 6:59 PM about:blank

--- NOT
*Ask the students to insert keys {43, 55, 27, 73, 67} in to
10 3 Talk APPLICABLE
hash table of size 11
---
--- NOT
5 Conclusion 2 Talk APPLICABLE
---

SESSION NUMBER : 23

Session Outcome: 1 Students able to resolve collisions using different collision resolution techniques

Session Outcome: 2 Students able to implement double hashing

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
Explanation of Open Addressing and different types of --- NOT
20 strategies to resolve Collision. Explanation of double 2 Talk APPLICABLE
hashing and its implementation. ---
--- NOT
*Ask the students to insert keys {18, 41, 22, 44, 59, 32,
20 3 Talk APPLICABLE
31, 73} in to hash table of size 13
---
--- NOT
5 Conclusion 2 Talk APPLICABLE
---

SESSION NUMBER : 24

Session Outcome: 1 Students able to understand the concept of Extensible Hashing

Session Outcome: 2 Students able to implement Extensible Hashing

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
Explanation of extendible hashing concept and its --- NOT
20 importance Ask the students to construct hash table with 2 Talk APPLICABLE
the keys 94, 82, 39, 29, 61, 13, 36, 45. with bucket size=3 ---
*Ask the students to perform Extensible Hashing for the
following keys {18, 41, 22, 44, 59, 32, 31, 73} in to hash Think-Pair-
20 3 Talk
table where hash function is given as H(K)= K %10.with Share
bucket size=3
--- NOT
5 Conclusion 2 Talk APPLICABLE
---

SESSION NUMBER : 25

Session Outcome: 1 Students come to know about tree traversals

about:blank 19/53
12/26/24, 6:59 PM about:blank

Session Outcome: 2 Students able to solve real world practical problems on expression tree

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
Explain expression tree construction, and tree traversals –
20 2 Talk APPLICABLE
In-order, Pre-order, and post-order
---
Ask the students to construct a binary tree for the given --- NOT
10 elements 77,44,58,19,29,25,31,12. And print inorder, 3 Chalk APPLICABLE
preorder, and postorder. ---
Ask the students to construct an expression tree for the --- NOT
10 following expression(A+B)*((C-D)/(E^F)) could be 3 Chalk APPLICABLE
represented thus [E^F means E raised to the F power] ---
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 26

Session Outcome: 1 Students come to know about construction of binary search tree

Session Outcome: 2 Students able to perform binary search tree operations

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
20 Explain Binary Search Tree – Construction and display. 2 Chalk APPLICABLE
---
--- NOT
Ask the students to construct a binary search tree for the
20 3 Talk APPLICABLE
given elements 21, 32, 19, -23, 15, 65, 48, 7, 9, 55.
---
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 27

Session Outcome: 1 Students able to implement binary search tree operations

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
20 Explanation of BST Tree - Construction and Display 2 Talk --- NOT
Write function to perform the following operations on a APPLICABLE
about:blank 20/53
12/26/24, 6:59 PM about:blank

BST: 1. Tree Traversals (Inorder, Preorder and Postorder) ---

2. Deletion of a node in BST.
Ask the students to write function in BST to perform the
--- NOT
following: 4. Deleting a child (leave) node. 5. Deleting a
20 3 Talk APPLICABLE
sub tree node that has one child. 6. Deleting a sub tree
---
node that has two child nodes.
--- NOT
5 conclusion 2 Chalk APPLICABLE
---

SESSION NUMBER : 28

Session Outcome: 1 Students come to know about construction of binary search tree

Session Outcome: 2 Students able to perform binary search tree operations

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
Explaining the various operations on Binary Search Tree --- NOT
20 – minimum element in BST ,max, search and sort the 2 Chalk APPLICABLE
elements in BST.. ---
Ask the students to construct a binary search tree for the --- NOT
20 given elements 21, 32, 19, -23, 15, 65, 48, 7, 9, 55 and 3 Talk APPLICABLE
implement the above operations. ---
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 29

Session Outcome: 1 Students come to know about AVL tree rotations

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
Explain AVL Tree and advantages of AVL Tree in the
20 2 Talk APPLICABLE
data organization.
---
a. Construct an AVL tree with the following data 25, 99, --- NOT
20 101, 15, 7, 32, 10 b. Find balancing factor of node 7. c. 2 Talk APPLICABLE
Find resultant AVL tree after deleting root. ---
--- NOT
5 Conclusion 2 Talk APPLICABLE
---

SESSION NUMBER : 30

Session Outcome: 1 Students able to implement operations on AVL tree

about:blank 21/53
12/26/24, 6:59 PM about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
--- NOT
Write a C-Program to implement AVL tree i.e to Insert an
20 2 Talk APPLICABLE
element in AVL Tree
---
--- NOT
Ask students to draw the final AVL after inserting an
20 3 Talk APPLICABLE
element implement an AVL Tree.
---
--- NOT
5 Conclusion 2 Talk APPLICABLE
---

SESSION NUMBER : 31

Session Outcome: 1 Students able to implement heap sort

Session Outcome: 2 Students able to analyze time complexities of heap sort

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
Explain Heap order property and two phases of heap sort
(1. Heap Creation 2. Sorting via deletion) with an
example Explain Max and Min Heap: Heap Property: All
--- NOT
nodes are either greater than or equal to or less than or
20 2 Talk APPLICABLE
equal to each of its children. If the parent nodes are
---
greater than their child nodes, heap is called a Max-Heap,
and if the parent nodes are smaller than their child nodes,
heap is called Min-Heap.
Ask the students to write an algorithm to sort the --- NOT
10 elements using heap sort technique and also analyse its 3 Chalk APPLICABLE
time complexity. ---
Suppose we are sorting an array of eight integers using
heapsort, and we have just finished some heapify (either --- NOT
10 maxheapify or minheapify) operations. The array now 3 Chalk APPLICABLE
looks like this: 16 14 15 10 12 27 28 How many heapify ---
operations have been performed on root of heap?
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 32

Session Outcome: 1 Students come to know about B tree construction

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
about:blank 22/53
12/26/24, 6:59 PM about:blank

--- NOT
5 Attendance 2 Talk APPLICABLE
---
--- NOT
Explain construction of B tree with an example. Give the
20 2 Chalk APPLICABLE
importance of M-way search tree.
---
--- NOT
Ask the students to construct B tree with the keys 23, 85
20 3 Talk APPLICABLE
34, 51, 45, 10, 28, 41, 67, 19, 7, 30 and order 4
---
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 33

Session Outcome: 1 Students comes to know about splay tree construction

Session Outcome: 2 Students are able to perform splay tree operations

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
--- NOT
Explain selective splaying. zig-zig and zig-zag rotations
20 2 Talk APPLICABLE
and how it overcomes normal splaying
---
Create splay Tee with following keys with root 38. --- NOT
20 1,32,3,4,8,65,42,34,81,9,32,56,54,38,66,77,44 apply 3 Talk APPLICABLE
splaying at node 54. ---
--- NOT
5 Conclusion 2 Chalk APPLICABLE
---

SESSION NUMBER : 34

Session Outcome: 1 Students comes to know about red black tree construction

Session Outcome: 2 Students are able to perform red black tree operations

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
--- NOT
20 Explain Red Black tree and its properties 2 Chalk APPLICABLE
---
Quiz/Test
20 Explain Insert operation of Red Black tree(ReColoring) 3 Talk
Questions
--- NOT
5 Conclusion 2 PPT APPLICABLE
---
about:blank 23/53
12/26/24, 6:59 PM about:blank

SESSION NUMBER : 35

Session Outcome: 1 Students come to understand the representing of graphs and Transitive Closure

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
--- NOT
20 Explanation of Graph representation – adjacency matrix 2 Chalk APPLICABLE
---
--- NOT
represent the given graph in adjacency matrix ,Transitive
20 3 Talk APPLICABLE
closure
---
--- NOT
5 Conclusion 2 Talk APPLICABLE
---

SESSION NUMBER : 36

Session Outcome: 1 Students come to know about graph traversal – DFS

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
--- NOT
Definitions of graph traversals and introduce graph
20 2 Talk APPLICABLE
traversal technique – DFS
---
One minute
20 Find DFS for the given graph 3 Talk
paper
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

SESSION NUMBER : 37

Session Outcome: 1 Students come to know about graph traversal – BFS

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
--- NOT
Explain Definitions of graph traversals and introduce
20 2 PPT APPLICABLE
graph traversal technique – BFS
---
--- NOT
20 Find BFS for the given graph 3 Talk APPLICABLE
---
about:blank 24/53
12/26/24, 6:59 PM about:blank

--- NOT
5 Conclusion 2 Talk APPLICABLE
---

SESSION NUMBER : 38

Session Outcome: 1 Students able to derive minimum spanning tree from a given graph.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
--- NOT
Explain the Minimum spanning tree. Explain Prim’s
20 2 Talk APPLICABLE
algorithm with the help of weighted graph
---
--- NOT
Apply Prim’s algorithm on a weighted graph to get
20 3 Talk APPLICABLE
minimum spanning tree
---
--- NOT
5 Conclusion 2 Talk APPLICABLE
---

SESSION NUMBER : 39

Session Outcome: 1 Students able to understand the use and applications of minimum spanning tree

Session Outcome: 2 Students able to understand Kruskal’s minimum spanning tree algorithm.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
--- NOT
Explain what is spanning tree and minimum spanning
20 2 Chalk APPLICABLE
tree. Explain applications of minimum spanning tree
---
Explain about Krushkal’s minimum spanning tree
Quiz/Test
20 algorithm and how it used to find minimum spanning tree 3 Talk
Questions
using diagrams.
--- NOT
5 Conclusion 2 PPT APPLICABLE
---

Tutorial Course DELIVERY Plan: NO Delivery Plan Exists

Tutorial Session wise Teaching – Learning Plan

No Session Plans Exists

Practical Course DELIVERY Plan:

about:blank 25/53
12/26/24, 6:59 PM about:blank

Tutorial
Session Topics CO-Mapping
no

1 Introduction to data structures- Mathematical background, Model CO5

Develop a program to implement below sorting techniques a. Insertion Sort

2 CO5
b. Shell Sort

Develop a program to implement below sorting techniques a. Quick Sort,

3 CO5
Merge

4 List Implementation - Single Linked List CO5

5 Doubly Linked list -Insertion,Creation,Deletion CO5

stack operations. And how can you determine stack is empty when
6 CO5
implemented with a linked list.

7 Stack Applications CO5

Linked List Implementation. Queue and its applications. a. Circular Queue

8 CO5
Implementation

9 hashing CO5

10 binary tree and BST CO5

11 AVL tree CO5

12 Graphs Representation and Traversals, MST CO5

Practical Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Students will be able to analyze various time complexities for an Algorithm

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
25 1. Calculate the time complexity. 2 Chalk APPLICABLE
---
--- NOT
25 2. Calculate the time complexity. 2 Talk APPLICABLE
---
25 3. Calculate the time complexity. 2 Talk --- NOT
https://leetcode.com/discuss/interview- APPLICABLE
about:blank 26/53
12/26/24, 6:59 PM about:blank

question/5750835/Understanding-Time-Complexity%3A- ---
A-Guide-for-Beginners/
--- NOT
20 VIVA 2 Talk APPLICABLE
---

SESSION NUMBER : 2

Session Outcome: 1 Implement a. Insertion Sort b. Shell Sort

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
25 Implement a. Insertion Sort 3 LTC APPLICABLE
---
--- NOT
25 Implement a. Insertion Sort,Shell Sort 3 LTC APPLICABLE
---
--- NOT
25 Implement a. Shell Sort, 3 LTC APPLICABLE
---
--- NOT
20 Viva 2 Talk APPLICABLE
---

SESSION NUMBER : 3

Session Outcome: 1 Develop a program to implement below sorting techniques a. Quick Sort, Merge

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
--- NOT
Develop a program to implement below sorting
25 3 LTC APPLICABLE
techniques a. Quick Sort
---
--- NOT
Develop a program to implement below sorting
25 3 LTC APPLICABLE
techniques a. Quick Sort, Merge
---
--- NOT
Develop a program to implement below sorting
25 3 LTC APPLICABLE
techniques a.Merge
---
--- NOT
5 Viva 2 LTC APPLICABLE
---

SESSION NUMBER : 4

Session Outcome: 1 List Implementation - Single Linked List

about:blank 27/53
12/26/24, 6:59 PM about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
Insertion at end is fairly straight forward. See the
--- NOT
following steps: 1. Make a new node with the desired
25 3 LTC APPLICABLE
value. 2. Start at the head and move to the last node of
---
the linked list. 3. Insert the new node after the last node.
You are given two non-empty linked lists representing
two non-negative integers. The digits are stored in --- NOT
25 reverse order, and each of their nodes contains a single 3 LTC APPLICABLE
digit. Add the two numbers and return the sum as a ---
linked list
--- NOT
25 inked List - Insertion at k-th position 3 LTC APPLICABLE
---
--- NOT
5 viva 2 Talk APPLICABLE
---

SESSION NUMBER : 5

Session Outcome: 1 Develop Pgorams on Doubly Linked list -Insertion,Creation,Deletion

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
--- NOT
25 Doubly Linked list -Insertion 3 LTC APPLICABLE
---
--- NOT
25 Doubly Linked list -Creation, 3 LTC APPLICABLE
---
--- NOT
25 Doubly Linked list -Deletion 3 LTC APPLICABLE
---
--- NOT
20 viva 2 LTC APPLICABLE
---

SESSION NUMBER : 6

Session Outcome: 1 Studetns can determine stack is empty when implemented with a linked list.

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

about:blank 28/53
12/26/24, 6:59 PM about:blank

--- NOT
5 Attendance 2 Talk APPLICABLE
---
--- NOT
25 stack operations. 3 LTC APPLICABLE
---
--- NOT
25 stack operations. 3 LTC APPLICABLE
---
--- NOT
25 stack Programs 3 LTC APPLICABLE
---
--- NOT
20 viva 2 LTC APPLICABLE
---

SESSION NUMBER : 7

Session Outcome: 1 Stack Applications

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
25 Infix to Postfix Expression conversion 3 LTC APPLICABLE
---
--- NOT
25 Post Fix Evaluation 3 LTC APPLICABLE
---
--- NOT
25 Balancing Parentheses 3 LTC APPLICABLE
---
--- NOT
20 Viva 3 Talk APPLICABLE
---

SESSION NUMBER : 8

Session Outcome: 1 Linked List Implementation- Queue and its applications.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 attendance 1 Talk APPLICABLE
---
--- NOT
25 1. Implement a Queue using Linked List 3 LTC APPLICABLE
---
25 Circular Queue using Arrays 3 LTC --- NOT
APPLICABLE
about:blank 29/53
12/26/24, 6:59 PM about:blank

---
--- NOT
25 Queue using Two Stacks 3 LTC APPLICABLE
---
--- NOT
20 Viva 3 LTC APPLICABLE
---

SESSION NUMBER : 9

Session Outcome: 1 Hashing - Hash function(Implementation

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 attendance 1 Talk APPLICABLE
---
Key mod K is a hash function used for a particular
--- NOT
hashing. Print the keys corresponding to every hash value
25 3 LTC APPLICABLE
in increasing order on separate lines where collision
---
occurs. Using Division Method
--- NOT
25 Frequency of each element in the array 3 LTC APPLICABLE
---
Key mod K is a hash function used for a particular
hashing. In Case of collision Linear Probing is used to --- NOT
25 link key with hash value. Print the keys corresponding to 3 LTC APPLICABLE
every hash value in increasing order on separate lines ---
where collision occurs
--- NOT
5 Viva 3 Talk APPLICABLE
---

SESSION NUMBER : 10

Session Outcome: 1 Binary tree and BST

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
25 Insert into a Binary Search 3 LTC APPLICABLE
---
--- NOT
25 Delete Node in a BST 3 LTC APPLICABLE
---
--- NOT
25 BST CREATION 1 3 LTC APPLICABLE
---

about:blank 30/53
12/26/24, 6:59 PM about:blank

--- NOT
20 Viva 2 Talk APPLICABLE
---

SESSION NUMBER : 11

Session Outcome: 1 AVL tree Implementation

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
Given n number each representing value of a node,
construct a tree in the following manner: Let's say node
to be inserted has value x If x is less than or equal to
value of the current root node then insert to the left of the
current root If x is greater than the value of the current --- NOT
25 root then insert node in the right of this node The above 3 LTC APPLICABLE
insertion will make a special tree known as Binary ---
Search Tree. Determine whether the tree is balanced or
not. A tree is said to be balanced if the absolute
difference between the depth of left subtree and the right
subtree of each node does not differ by more than 1.
--- NOT
Write a program to input an array and sort it in ascending
25 3 LTC APPLICABLE
order using the heap sort algorithm.
---
To delete the top element from a heap:  Swap the
desired element with the last element  decrement the --- NOT
25 size of the array  check all the children of the index 3 LTC APPLICABLE
which is deleted and if the heap property is violated swap ---
the elements and recursively check for the child.
--- NOT
20 Viva 2 LTC APPLICABLE
---

SESSION NUMBER : 12

Session Outcome: 1 Graphs Representation

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
1. What will be the adjacency matrix for the below
25 3 LTC APPLICABLE
directed weighted graph?
---
2. Construct the weighted directed graph represented by
the adjacency matrix given below. A non-zero value at --- NOT
25 [row, column] indicates that the vertex in the row is 3 LTC APPLICABLE
adjacent to the vertex in the column and apply DFS to the ---
graph

about:blank 31/53
12/26/24, 6:59 PM about:blank

--- NOT
3. Apply Prim’s Algorithm to generate minimum
25 3 LTC APPLICABLE
Spanning Tree for the following graph?
---
--- NOT
20 Viva 2 LTC APPLICABLE
---

Skilling Course DELIVERY Plan:

Skilling
session Topics/Experiments CO-Mapping
no

1 Algorithmic Analysis and Finding Time Complexity CO6

2 Algorithmic Analysis and Finding Time Complexity CO6

3 a. Insertion Sort b. Shell Sort CO6

4 a. Insertion Sort b. Shell Sort CO6

Develop a program to implement below sorting techniques a. Quick Sort b.

5 CO6
Merge Sort

Develop a program to implement below sorting techniques a. Quick Sort b.

6 CO6
Merge Sort

7 List Implementation - Single Linked List CO6

8 List Implementation - Single Linked List CO6

9 List Implementation- Doubly Linked List CO6

10 List Implementation- Doubly Linked List CO6

11 Linked List Implementation-Stack CO6

12 Linked List Implementation-Stack CO6

Stack Applications- a. Infix to Postfix Expression conversion b. Post Fix

13 CO6
Evaluation c. Balancing Parentheses

14 Stack Applications CO6

Linked List Implementation- Queue and its applications. a. Circular Queue

15 CO6
Implementation

Linked List Implementation- Queue and its applications. a. Circular Queue

16 CO6
Implementation

17 Hashing – a. Separate chaining b. Open Addressing CO6

about:blank 32/53
12/26/24, 6:59 PM about:blank

Skilling
session Topics/Experiments CO-Mapping
no

18 a. Separate chaining b. Open Addressing CO6

Binary search Tree a. Creation of BST b. Traversal – In-order, Pre-order,

19 CO6
post-order

Binary search Tree a. Creation of BST b. Traversal – In-order, Pre-order,

20 CO6
post-order

21 AVL Tree – Self Balancing Tree CO6

22 AVL Tree – Self Balancing Tree CO6

23 Implementation of Graphs a. Breadth First Search b. Depth First Search CO6

24 Implementation of Graphs a. Breadth First Search b. Depth First Search CO6

Skilling Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Algorithmic Analysis and Finding Time Complexity

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 attendance 1 Talk APPLICABLE
---
--- NOT
25 Skill-Problem1 3 LTC APPLICABLE
---
--- NOT
25 Skill-Problem2 3 LTC APPLICABLE
---
--- NOT
25 Skill-Problem3 4 LTC APPLICABLE
---
--- NOT
20 Viva 2 Talk APPLICABLE
---

SESSION NUMBER : 2

Session Outcome: 1 Algorithmic Analysis and Finding Time Complexity

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

about:blank 33/53
12/26/24, 6:59 PM about:blank

--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
25 Skil-Problem4 3 LTC APPLICABLE
---
--- NOT
25 Skil-Problem5 4 LTC APPLICABLE
---
--- NOT
25 Skil-Problem6 3 LTC APPLICABLE
---
--- NOT
20 Viva 2 Talk APPLICABLE
---

SESSION NUMBER : 3

Session Outcome: 1 a. Insertion Sort b. Shell Sort

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
25 Skill-Problem 1 3 LTC APPLICABLE
---
--- NOT
25 Skill-Problem 2 3 LTC APPLICABLE
---
--- NOT
25 Skill-Problem 3 3 LTC APPLICABLE
---
--- NOT
20 Viva 2 Talk APPLICABLE
---

SESSION NUMBER : 4

Session Outcome: 1 a. Insertion Sort b. Shell Sort

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
25 Skill-Problem 4 3 LTC APPLICABLE
---
25 Skill-Problem 5 3 LTC --- NOT
APPLICABLE
about:blank 34/53
12/26/24, 6:59 PM about:blank

---
--- NOT
25 Skill-Problem 6 3 LTC APPLICABLE
---
--- NOT
20 Viva 2 LTC APPLICABLE
---

SESSION NUMBER : 5

Session Outcome: 1 Quick Sort b. Merge Sort

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
25 Skill-Problem1 3 LTC APPLICABLE
---
--- NOT
25 Skill-Problem2 3 LTC APPLICABLE
---
--- NOT
25 Skill-Problem3 3 LTC APPLICABLE
---
--- NOT
20 Viva 2 Talk APPLICABLE
---

SESSION NUMBER : 6

Session Outcome: 1 Quick Sort b. Merge Sort

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
25 Skill-Problem4 3 LTC APPLICABLE
---
--- NOT
25 Skill-Problem5 3 LTC APPLICABLE
---
--- NOT
25 Skill-Problem6 3 LTC APPLICABLE
---
--- NOT
20 Viva 2 LTC APPLICABLE
---

about:blank 35/53
12/26/24, 6:59 PM about:blank

SESSION NUMBER : 7

Session Outcome: 1 List Implementation - Single Linked List

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
40 Sikll Problem1 3 LTC APPLICABLE
---
--- NOT
35 Sikll Problem2 3 LTC APPLICABLE
---
--- NOT
20 Viva 2 LTC APPLICABLE
---

SESSION NUMBER : 8

Session Outcome: 1 List Implementation - Single Linked List

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
45 List Implementation - Single Linked List 2 LTC APPLICABLE
---
--- NOT
30 Skill Problem6 3 LTC APPLICABLE
---
--- NOT
20 viva 2 Talk APPLICABLE
---

SESSION NUMBER : 9

Session Outcome: 1 List Implementation- Doubly Linked List

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
40 List Implementation- Doubly Linked List 2 LTC APPLICABLE
---
35 Skill Problem3 3 LTC --- NOT
APPLICABLE
about:blank 36/53
12/26/24, 6:59 PM about:blank

---
--- NOT
20 viva 2 Talk APPLICABLE
---

SESSION NUMBER : 10

Session Outcome: 1 List Implementation- Doubly Linked List

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
40 List Implementation- Doubly Linked List 3 LTC APPLICABLE
---
--- NOT
35 Skill Problem-6 3 LTC APPLICABLE
---
--- NOT
20 viva 2 LTC APPLICABLE
---

SESSION NUMBER : 11

Session Outcome: 1 Linked List Implementation-Stack

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
40 Linked List Implementation-Stack 3 LTC APPLICABLE
---
--- NOT
35 Linked List Implementation-Stack 3 LTC APPLICABLE
---
--- NOT
20 Viva 3 LTC APPLICABLE
---

SESSION NUMBER : 12

Session Outcome: 1 Linked List Implementation-Stack

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 2 Talk APPLICABLE
---
about:blank 37/53
12/26/24, 6:59 PM about:blank

--- NOT
40 Skill problem 5 3 LTC APPLICABLE
---
--- NOT
35 Skill problem 6 3 LTC APPLICABLE
---
--- NOT
20 Project Review 3 Talk APPLICABLE
---

SESSION NUMBER : 13

Session Outcome: 1 Stack Applications-

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
25 Infix to Postfix Expression conversion 3 LTC APPLICABLE
---
--- NOT
25 Post Fix Evaluation 3 LTC APPLICABLE
---
--- NOT
25 . Balancing Parentheses 3 LTC APPLICABLE
---
--- NOT
20 Viva 3 LTC APPLICABLE
---

SESSION NUMBER : 14

Session Outcome: 1 Stack Applications

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
40 Stack Applications 3 LTC APPLICABLE
---
--- NOT
35 Skill Problems-5,6 3 LTC APPLICABLE
---
--- NOT
20 Viva 2 LTC APPLICABLE
---

SESSION NUMBER : 15

about:blank 38/53
12/26/24, 6:59 PM about:blank

Session Outcome: 1 Linked List Implementation- Queue and its applications.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
40 Skill Problem1,2 3 LTC APPLICABLE
---
--- NOT
35 Skill Problem3 3 LTC APPLICABLE
---
--- NOT
20 Viva 3 LTC APPLICABLE
---

SESSION NUMBER : 16

Session Outcome: 1 Linked List Implementation- Queue and its applications.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
40 Skill Problem5 2 LTC APPLICABLE
---
--- NOT
35 Skill Problem6 3 LTC APPLICABLE
---
--- NOT
20 Viva 2 LTC APPLICABLE
---

SESSION NUMBER : 17

Session Outcome: 1 a. Separate chaining b. Open Addressing

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
40 a. Separate chaining b. Open Addressing 3 LTC APPLICABLE
---
--- NOT
30 a. Separate chaining b. Open Addressing 3 LTC APPLICABLE
---

about:blank 39/53
12/26/24, 6:59 PM about:blank

--- NOT
20 Viva 2 LTC APPLICABLE
---

SESSION NUMBER : 18

Session Outcome: 1 Hashing

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendnace 1 Talk APPLICABLE
---
--- NOT
40 Separate chaining 3 LTC APPLICABLE
---
--- NOT
30 Open Addressing 3 LTC APPLICABLE
---
--- NOT
20 Via 2 LTC APPLICABLE
---

SESSION NUMBER : 19

Session Outcome: 1 Binary search Tree

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
40 Skill Problems 3 LTC APPLICABLE
---
--- NOT
35 Skill Problems 3 LTC APPLICABLE
---
--- NOT
20 viva 2 LTC APPLICABLE
---

SESSION NUMBER : 20

Session Outcome: 1 Binary search Tree

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendnace 1 Talk APPLICABLE
---

about:blank 40/53
12/26/24, 6:59 PM about:blank

--- NOT
45 Skill Problems 3 LTC APPLICABLE
---
--- NOT
30 Skill Problems 3 LTC APPLICABLE
---
--- NOT
20 Viva 2 Talk APPLICABLE
---

SESSION NUMBER : 21

Session Outcome: 1 AVL Tree – Self Balancing Tree

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
40 Skill Problems 3 LTC APPLICABLE
---
--- NOT
35 Skill Problems 3 LTC APPLICABLE
---
--- NOT
20 Viva 2 Talk APPLICABLE
---

SESSION NUMBER : 22

Session Outcome: 1 AVL Tree – Self Balancing Tree

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendnace 2 Talk APPLICABLE
---
--- NOT
40 Skill Problems 3 LTC APPLICABLE
---
--- NOT
35 Skill Problems 3 LTC APPLICABLE
---
--- NOT
20 Viva 2 LTC APPLICABLE
---

SESSION NUMBER : 23

Session Outcome: 1 Implementation of Graphs

about:blank 41/53
12/26/24, 6:59 PM about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attemdance 1 Talk APPLICABLE
---
--- NOT
40 Skill Problems 3 LTC APPLICABLE
---
--- NOT
35 Skill Problems 3 LTC APPLICABLE
---
--- NOT
20 Viva 2 LTC APPLICABLE
---

SESSION NUMBER : 24

Session Outcome: 1 Implementation of Graphs

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
40 Skill Problems 3 LTC APPLICABLE
---
--- NOT
35 Skill Problems 3 LTC APPLICABLE
---
--- NOT
20 Viva 2 LTC 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
Mon Theory V- -- V-S7,V- V-S7,V- V-S1,V- V-S1,V- V- V- V-
S25,V- S8,V- S8,V- S2,V- S2,V- S37,V- S37,V- S49,V-
S26,V- S21,V- S21,V- S13,V- S13,V- S38 S38 S50
S27,V- S22,V- S22 S14 S14
S28 S33,V-
S34,V-

about:blank 42/53
12/26/24, 6:59 PM about:blank

S35,V-
S36
Tutorial -- -- -- -- -- -- -- -- --
V- V- V- V- V-
V-S9,V- V-S9,V-
S17,V- S17,V- S53,V- S53,V- S41,V-
S9,V- S9,V-
S17,V- S17,V- S53,V- S53,V- S41,V-
S9,V- S9,V-
Lab S17,V- S17,V- -- -- S53,V- S53,V- S41,V-
S10,V- S10,V-
S18,V- S18,V- S54,V- S54,V- S42,V-
S10,V- S10,V-
S18,V- S18,V- S54,V- S54,V- S42,V-
S10 S10
S18 S18 S54 S54 S42
V-S5,V- V-S5,V-
S5,V- S5,V-
V- V- V-
S6,V- S6,V- V-S3,V- V-S3,V-
S39,V- S39,V- S43,V-
S6,V- S6,V- S3,V- S3,V-
V- V- S39,V- S39,V- S43,V-
S11,V- S11,V- S4,V- S4,V-
S19,V- S19,V- S40,V- S40,V- S44,V-
S11,V- S11,V- S4,V- S4,V-
Skilling S19,V- S19,V- S40,V- S40,V- S44,V-
S12,V- S12,V- S15,V- S15,V-
S20,V- S20,V- S55,V- S55,V- S51,V-
S12,V- S12,V- S15,V- S15,V-
S20 S20 S55,V- S55,V- S51,V-
S23,V- S23,V- S16,V- S16,V-
S56,V- S56,V- S52,V-
S23,V- S23,V- S16 S16
S56 S56 S52
S24,V- S24,V-
S24 S24
V-
S25,V-
V-S9,V- V-S9,V-
S26,V- V- V-S5,V- V- V- V-
S10,V- S10,V-
Theory S45,V- S25,V- S6,V- -- S39,V- S39,V- S51,V-
S15,V- S15,V-
S46,V- S26 S7,V-S8 S40 S40 S52
S16 S16
S47,V-
S48
Tutorial -- -- -- -- -- -- -- -- --
V- V- V- V- V-
V-S11,V- V-S11,V-
S19,V- S19,V- S55,V- S55,V- S43,V-
S11,V- S11,V-
S19,V- S19,V- S55,V- S55,V- S43,V-
S11,V- S11,V-
Tue Lab S19,V- S19,V-
S12,V- S12,V-
-- -- S55,V- S55,V- S43,V-
S20,V- S20,V- S56,V- S56,V- S44,V-
S12,V- S12,V-
S20,V- S20,V- S56,V- S56,V- S44,V-
S12 S12
S20 S20 S56 S56 S44
V- V- V- V- V- V- V-
S17,V- S17,V- S11,V- S11,V- S37,V- S37,V- S41,V-
S17,V- S17,V- S11,V- S11,V- S37,V- S37,V- S41,V-
V-S9,V- V-S9,V-
S18,V- S18,V- S12,V- S12,V- S38,V- S38,V- S42,V-
S9,V- S9,V-
Skilling S18,V- S18,V- S12,V- S12,V- S38,V- S38,V- S42,V-
S10,V- S10,V-
S27,V- S27,V- S13,V- S13,V- S53,V- S53,V- S49,V-
S10 S10
S27,V- S27,V- S13,V- S13,V- S53,V- S53,V- S49,V-
S28,V- S28,V- S14,V- S14,V- S54,V- S54,V- S50,V-
S28 S28 S14 S14 S54 S54 S50
Wed V-
S17,V- V-S1,V-
S18,V- V- S2,V- V- V-
V-S5,V-
Theory S49,V- S17,V- -- -- S3,V- S41,V- S41,V- --
S6
S50,V- S18 S4,V- S42 S42
S51,V- S5,V-S6
S52
Tutorial -- -- -- -- -- -- -- -- --

about:blank 43/53
12/26/24, 6:59 PM about:blank

V- V- V- V- V-
S21,V- S21,V- V-S1,V- V-S1,V- S45,V- S45,V- S33,V-
S21,V- S21,V- S1,V- S1,V- S45,V- S45,V- S33,V-
Lab S21,V- S21,V- S1,V- S1,V- -- -- S45,V- S45,V- S33,V-
S22,V- S22,V- S2,V- S2,V- S46,V- S46,V- S34,V-
S22,V- S22,V- S2,V-S2 S2,V-S2 S46,V- S46,V- S34,V-
S22 S22 S46 S46 S34
V- V- V- V-
S19,V- S19,V- S43,V- S43,V-
S19,V- S19,V- S43,V- S43,V- V-
S20,V- S20,V- V-S3,V- V-S3,V- V-S7,V- V-S7,V- S44,V- S44,V- S35,V-
Skilling S20,V- S20,V- S3,V- S3,V- S7,V- S7,V- S44,V- S44,V- S35,V-
S23,V- S23,V- S4,V-S4 S4,V-S4 S8,V-S8 S8,V-S8 S47,V- S47,V- S36,V-
S23,V- S23,V- S47,V- S47,V- S36
S24,V- S24,V- S48,V- S48,V-
S24 S24 S48 S48
V- V- V-
V-S37,V-
S13,V- S19,V- S19,V- V- V- V-
S38,V-
Theory S14,V- -- -- S20,V- S20,V- S43,V- S43,V- S55,V-
S39,V-
S15,V- S27,V- S27,V- S44 S44 S56
S40
S16 S28 S28
Tutorial -- -- -- -- -- -- -- -- --
V- V- V- V- V-
S23,V- S23,V- V-S3,V- V-S3,V- S47,V- S47,V- S35,V-
S23,V- S23,V- S3,V- S3,V- S47,V- S47,V- S35,V-
Lab S23,V- S23,V- S3,V- S3,V- -- -- S47,V- S47,V- S35,V-
Thu S24,V- S24,V- S4,V- S4,V- S48,V- S48,V- S36,V-
S24,V- S24,V- S4,V-S4 S4,V-S4 S48,V- S48,V- S36,V-
S24 S24 S48 S48 S36
V- V- V- V- V-
S17,V- S17,V- S41,V- S41,V- S33,V-
V- V- S17,V- S17,V- S41,V- S41,V- S33,V-
S21,V- S21,V- V-S1,V- V-S1,V- S18,V- S18,V- S42,V- S42,V- S34,V-
Skilling S21,V- S21,V- S1,V- S1,V- S18,V- S18,V- S42,V- S42,V- S34,V-
S22,V- S22,V- S2,V-S2 S2,V-S2 S25,V- S25,V- S45,V- S45,V- S53,V-
S22 S22 S25,V- S25,V- S45,V- S45,V- S53,V-
S26,V- S26,V- S46,V- S46,V- S54,V-
S26 S26 S46 S46 S54
Fri V-S3,V-
S4,V-
S17,V-
S18,V-
S19,V-
S20,V- V-S9,V-
V- V- V- V- V-
S41,V- V-S3,V- S10,V-
Theory S23,V- S23,V- -- S33,V- S33,V- S45,V-
S42,V- S4 S11,V-
S24 S24 S34 S34 S46
S43,V- S12
S44,V-
S53,V-
S54,V-
S55,V-
S56
Tutorial -- -- -- -- -- -- -- -- --
Lab V- V- V-S5,V- V-S5,V- V- V- V- V- V-
S13,V- S13,V- S5,V- S5,V- S25,V- S25,V- S49,V- S49,V- S37,V-

about:blank 44/53
12/26/24, 6:59 PM about:blank

S13,V- S13,V- S5,V- S5,V- S25,V- S25,V- S49,V- S49,V- S37,V-

S13,V- S13,V- S6,V- S6,V- S25,V- S25,V- S49,V- S49,V- S37,V-
S14,V- S14,V- S6,V-S6 S6,V-S6 S26,V- S26,V- S50,V- S50,V- S38,V-
S14,V- S14,V- S26,V- S26,V- S50,V- S50,V- S38,V-
S14 S14 S26 S26 S50 S50 S38
V- V- V- V- V-
S15,V- S15,V- V-S1,V- V-S1,V- S35,V- S35,V- S39,V-
S15,V- S15,V- S1,V- S1,V- V- V- S35,V- S35,V- S39,V-
S16,V- S16,V- S2,V- S2,V- S27,V- S27,V- S36,V- S36,V- S40,V-
Skilling S16,V- S16,V- S2,V- S2,V- S27,V- S27,V- S36,V- S36,V- S40,V-
S21,V- S21,V- S7,V- S7,V- S28,V- S28,V- S51,V- S51,V- S47,V-
S21,V- S21,V- S7,V- S7,V- S28 S28 S51,V- S51,V- S47,V-
S22,V- S22,V- S8,V-S8 S8,V-S8 S52,V- S52,V- S48,V-
S22 S22 S52 S52 S48
V-
S11,V-
S12,V- V- V- V- V-
V-S53,V- V-S53,V-
Theory -- -- S21,V- S11,V- S35,V- S35,V- S47,V-
S54 S54
S22,V- S12 S36 S36 S48
S23,V-
S24
Tutorial -- -- -- -- -- ---- -- --
V- V- V- V-V- V- V-
S15,V- S15,V- V-S7,V- V-S7,V- S27,V- S27,V-
S51,V- S51,V- S39,V-
S15,V- S15,V- S7,V- S7,V- S27,V- S27,V-
S51,V- S51,V- S39,V-
Sat Lab S15,V- S15,V- S7,V- S7,V- S27,V- S27,V-
S51,V- S51,V- S39,V-
S16,V- S16,V- S8,V- S8,V- S28,V- S28,V-
S52,V- S52,V- S40,V-
S16,V- S16,V- S8,V-S8 S8,V-S8 S28,V- S28,V-
S52,V- S52,V- S40,V-
S16 S16 S28 S28
S52 S52 S40
V- V- V-
V-S5,V- V-S5,V- V-S9,V- V-S9,V-
S33,V- S33,V- S37,V-
S5,V- S5,V- S9,V- S9,V-
V- V- S33,V- S33,V- S37,V-
S6,V- S6,V- S10,V- S10,V-
S13,V- S13,V- S34,V- S34,V- S38,V-
S6,V- S6,V- S10,V- S10,V-
Skilling S13,V- S13,V- S34,V- S34,V- S38,V-
S55,V- S55,V- S25,V- S25,V-
S14,V- S14,V- S49,V- S49,V- S45,V-
S55,V- S55,V- S25,V- S25,V-
S14 S14 S49,V- S49,V- S45,V-
S56,V- S56,V- S26,V- S26,V-
S50,V- S50,V- S46,V-
S56 S56 S26 S26
S50 S50 S46
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

about:blank 45/53
12/26/24, 6:59 PM about:blank
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
100
End End Exam Max Marks 50 50
Semester Lab End Weightage 8 8
Summative Semester 100
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
Skilling Weightage 15 15
Continuous 100
In Evaluation Max Marks 50 50
Semester Continuous
Formative Evaluation - Weightage 5 5
Evaluation Lab 100
Total= 30 Exercise Max Marks 50 50
%
Lab Weekly Weightage 10 2.5 2.5 2.5 2.5
100
exercise Max Marks 40 10 10 10 10
Lab In Weightage 6 6
In Semester 100
Semester Exam Max Marks 50 50
Summative Semester in Weightage 12 6 6
Evaluation Exam-II 90
Max Marks 50 25 25
Total= 30
% 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
about:blank 46/53
12/26/24, 6:59 PM about:blank

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
Shaik Razia L 45-MA - - - -
4-B,26-
B,45-
Shaik Razia P - - - -
A,54-
C,55-B
Shaik Razia S 45-A - - - -
Haritha Donavalli L 7-MA - - - -
Haritha Donavalli S 7-A - - - -
Sridevi Emandi L 25-MA - - - -
15-C,21-
Sridevi Emandi P - - - -
B,25-A
21-B,25-
Sridevi Emandi S - - - -
A
Pavan Kumar
L 46-MA - - - -
Nidumolu
Pavan Kumar 46-A,54-
P - - - -
Nidumolu B,56-B
Pavan Kumar 46-A,52-
S - - - -
Nidumolu B
Zeelan CMAK L 36-MA - - - -
36-A,42-
Zeelan CMAK P - - - -
C,44-B
36-A,38-
Zeelan CMAK S - - - -
B,48-B
Dama Anand L 17-MA - - - -
Dama Anand P 17-A - - - -
17-A,55-
Dama Anand S - - - -
B
Siva Kumar Pathuri L 37-MA - - - -
37-A,42-
Siva Kumar Pathuri P - - - -
B,43-B
33-B,37-
Siva Kumar Pathuri S - - - -
A
Sudarsa Dora Babu L 33-MA - - - -
Sudarsa Dora Babu P 33-A - - - -
33-A,46-
Sudarsa Dora Babu S - - - -
B

about:blank 47/53
12/26/24, 6:59 PM about:blank

Velagapalli
L 14-MA - - - -
Premalatha
Velagapalli 14-A,49-
P - - - -
Premalatha B
Velagapalli
S 8-B,14-A - - - -
Premalatha
Gopala Gupta Amara
L 40-MA - - - -
SALG
34-B,40-
Gopala Gupta Amara A,44-
P - - - -
SALG C,45-
B,50-B
Gopala Gupta Amara 34-B,40-
S - - - -
SALG A
Sreeram
L 41-MA - - - -
Nimmagadda
10-C,41-
Sreeram
P A,50- - - - -
Nimmagadda
C,51-B
Sreeram
S 41-A - - - -
Nimmagadda
E Rajesh Kumar L 22-MA - - - -
11-B,15-
E Rajesh Kumar P B,22- - - - -
A,25-C
E Rajesh Kumar S 22-A - - - -
Karimunnisa Syed L 21-MA - - - -
2-C,21-
Karimunnisa Syed P A,26- - - - -
C,46-B
Karimunnisa Syed S 21-A - - - -
T Ganesan L 49-MA - - - -
36-C,49-
T Ganesan P - - - -
A
39-B,45-
T Ganesan S - - - -
B,49-A
U Harita L 18-MA - - - -
8-B,14-
U Harita P B,18- - - - -
A,27-B
U Harita S 4-B,18-A - - - -
Madupu Kumar L 11-MA - - - -
11-A,18-
Madupu Kumar P - - - -
C,21-C
Madupu Kumar S 11-A - - - -
Anusha Marouthu L 5-MA - - - -
3-C,5-
Anusha Marouthu P - - - -
A,20-C
Anusha Marouthu S 5-A,20-B - - - -
Yamini Tondepu L 3-MA - - - -
about:blank 48/53
12/26/24, 6:59 PM about:blank

3-A,11-
Yamini Tondepu P - - - -
C,13-B
Yamini Tondepu S 3-A,18-B - - - -
Aravindan Srinivasan L 47-MA - - - -
5-B,41-
Aravindan Srinivasan P - - - -
B,47-A
47-A,54-
Aravindan Srinivasan S - - - -
B
Agraharam Kumar L 1-MA - - - -
1-A,14-
Agraharam Kumar P - - - -
C,20-B
1-A,11-
Agraharam Kumar S - - - -
B,25-B
Lavanya Chunduri P 6-C - - - -
Lavanya Chunduri S 24-B - - - -
Alangudi Rama
L 13-MA - - - -
Krishnan
Alangudi Rama 13-A,28-
P - - - -
Krishnan B
Alangudi Rama
S 13-A - - - -
Krishnan
Ramesh Mylapalli L 15-MA - - - -
Ramesh Mylapalli P 15-A - - - -
15-A,26-
Ramesh Mylapalli S - - - -
B
Bechoo Lal L 28-MA - - - -
Bechoo Lal P 28-A - - - -
13-B,23-
Bechoo Lal S - - - -
B,28-A
Karri Bhaskar L 54-MA - - - -
Karri Bhaskar P 54-A - - - -
44-B,50-
Karri Bhaskar S - - - -
B,54-A
Supriya Menon L 19-MA - - - -
19-A,27-
Supriya Menon P - - - -
C,55-C
Supriya Menon S 19-A - - - -
Pothula Hymavathi L 8-MA - - - -
8-A,16-
Pothula Hymavathi P C,19- - - - -
B,23-B
Pothula Hymavathi S 8-A,16-B - - - -
Chintalapudi Anil L 2-MA - - - -
2-A,9-
Chintalapudi Anil P - - - -
B,16-B
2-A,10-
Chintalapudi Anil S - - - -
B,17-B
Manjusha Mandava P 49-C - - - -
Manjusha Mandava S 56-B - - - -
about:blank 49/53
12/26/24, 6:59 PM about:blank

Chopparapu
L 16-MA - - - -
Gowthami
Chopparapu
P 7-C,16-A - - - -
Gowthami
Chopparapu
S 16-A - - - -
Gowthami
Hanumantha Rao
L 42-MA - - - -
Battu
Hanumantha Rao
P 42-A - - - -
Battu
Hanumantha Rao 36-B,42-
S - - - -
Battu A
Alapati Kranthi L 53-MA - - - -
37-C,53-
Alapati Kranthi P - - - -
A
43-B,49-
Alapati Kranthi S - - - -
B,53-A
Dasari Manasa L 43-MA - - - -
34-C,35-
B,43-
Dasari Manasa P - - - -
A,52-
C,53-B
37-B,43-
Dasari Manasa S - - - -
A
Anantharamaiah
L 44-MA - - - -
Vengala
4-C,37-
Anantharamaiah
P B,40- - - - -
Vengala
B,44-A
Anantharamaiah
S 44-A - - - -
Vengala
Macherla Vathi L 35-MA - - - -
Macherla Vathi P 35-A - - - -
35-A,40-
Macherla Vathi S - - - -
B,42-B
Arumalla Raju L 50-MA - - - -
50-A,53-
Arumalla Raju P - - - -
C
Arumalla Raju S 50-A - - - -
Ushasree Linginedi L 27-MA - - - -
22-C,27-
Ushasree Linginedi P - - - -
A
12-B,22-
Ushasree Linginedi S - - - -
B,27-A
Manasa Adusumilli L 26-MA - - - -
7-A,22-
Manasa Adusumilli P - - - -
B,26-A
7-A,7-
Manasa Adusumilli S - - - -
B,26-A
Inakollu Aswani L 12-MA - - - -
about:blank 50/53
12/26/24, 6:59 PM about:blank

7-B,12-
Inakollu Aswani P - - - -
A,24-C
3-B,7-
Inakollu Aswani S - - - -
B,12-A
Dharmendra Pilli L 6-MA - - - -
6-A,23-
Dharmendra Pilli P - - - -
C,25-B
Dharmendra Pilli S 6-A - - - -
Vuyyuru Lalitha L 39-MA - - - -
33-C,39-
Vuyyuru Lalitha P - - - -
A,45-C
5-B,39-
Vuyyuru Lalitha S - - - -
A,41-B
Dhanesh Kumar L 4-MA - - - -
Dhanesh Kumar P 4-A,17-B - - - -
4-A,27-
Dhanesh Kumar S - - - -
B,53-B
Rajani Gorrepati L 9-MA - - - -
9-A,24-
Rajani Gorrepati P - - - -
B,47-B
Rajani Gorrepati S 9-A,15-B - - - -
G Venkatesh L 52-MA - - - -
G Venkatesh P 52-A - - - -
G Venkatesh S 52-A - - - -
Nagagopi Karanki L 38-MA - - - -
33-B,35-
Nagagopi Karanki P - - - -
C,38-A
9-B,38-
Nagagopi Karanki S - - - -
A,51-B
Krupadanam Rayi L 56-MA - - - -
9-C,43-
Krupadanam Rayi P - - - -
C,56-A
35-B,56-
Krupadanam Rayi S - - - -
A
Krishna Suresh L 24-MA - - - -
Krishna Suresh P 24-A - - - -
14-B,24-
Krishna Suresh S - - - -
A
Radha Kowtharapu L 10-MA - - - -
Radha Kowtharapu P 1-B,10-A - - - -
10-A,19-
Radha Kowtharapu S - - - -
B
Padyala Priyadarsan L 23-MA - - - -
1-C,6-
Padyala Priyadarsan P B,12- - - - -
C,23-A
Padyala Priyadarsan S 23-A - - - -
39-C,48-
Pallapati Kumar P - - - -
C
about:blank 51/53
12/26/24, 6:59 PM about:blank

Bellam Babu L 55-MA - - - -

12-B,40-
Bellam Babu P C,46- - - - -
C,55-A
Bellam Babu S 55-A - - - -
Lanka Virajitha P 38-C - - - -
Komatigunta
L 51-MA - - - -
Nagaraju
Komatigunta 47-C,51-
P - - - -
Nagaraju A
Komatigunta 47-B,51-
S - - - -
Nagaraju A
SAI E L 20-MA - - - -
SAI E P 2-B,20-A - - - -
SAI E S 6-B,20-A - - - -
28-C,38-
Sireesha Gundu P - - - -
B
5-C,18-
KONDAYAPALEPU B,39-
P - - - -
V V SIVA PRASAD B,51-
C,56-C
KONDAYAPALEPU
S 28-B - - - -
V V SIVA PRASAD
Alluri Swathi L 48-MA - - - -
36-B,41-
Alluri Swathi P C,48- - - - -
A,52-B
Alluri Swathi S 1-B,48-A - - - -
17-C,48-
Repudi Pitchiah P - - - -
B
Anka Siva Sonti L 34-MA - - - -
Anka Siva Sonti P 34-A - - - -
Anka Siva Sonti S 2-B,34-A - - - -
3-B,8-
C,10-
Kumuda Alparthi P - - - -
B,13-
C,19-C

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.

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

about:blank 52/53
12/26/24, 6:59 PM about:blank

Signature of COURSE COORDINATOR

(Siva Kumar Pathuri)

Signature of Department Prof. Incharge Academics & Vetting Team Member

Department Of DBES-1

HEAD OF DEPARTMENT:

Approval from: DEAN-ACADEMICS

(Sign with Office Seal) [object HTMLDivElement]

about:blank 53/53