1/24/23, 9:23 PM about:blank

K L Deemed to be University
Department of Computer Science and Engineering-Honors -- KLVZA
Course Handout
2022-2023, Even Sem
Course Title :DATA STRUCTURES
Course Code :22SC1202
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 OUTCOMES (COs):

Blooms
CO Taxonomy
Course Outcome (CO) PO/PSO
NO Level
(BTL)
CO1 Understand various sorting algorithms and analyse the efficiency of the algorithms PO1,PO2 4
CO2 Implement and evaluate Linear Data Structures and Demonstrate their applications. PO2,PO3,PO1 4
CO3 Implement and evaluate tree data structures and understand hashing techniques PO1,PO2,PO3 4
CO4 Understand graph data structures and apply graphs to solve problems PO1,PO2 4
Design, Develop and evaluate common practical applications for linear and nonlinear data
CO5 PO10,PO9 4
structures.

COURSE OUTCOME INDICATORS (COIs)::

Outcome Highest
COI-1 COI-2 COI-3 COI-4 COI-5
No. BTL
Btl-2 Btl-3
Btl-1 Btl-4
Introduction to sorting. Introduction to Divide
Mathematical Demonstrate External
Demonstrate and and Conquer Approach.
CO1 4 background, model and sorting and Bucket
Implement Insertion Demonstrate and
running time Sorting. Analyze its
Sort, Shell Sort, and Implement Merge Sort
calculations Efficiency.
Heap Sort. and Quick Sort.
Btl-1
Introduction to Dynamic Btl-4
Btl-2 Btl-3
Memory Allocation and Model of priority queues
List based List based
List-based and Implementation of
CO2 4 implementations of implementations of
implementation. Binary Heap and
Stack and Enumerate its Queue and Enumerate its
Illustrate implementation Demonstrate
applications. applications.
of different Lists and its applications.
applications
Btl-1
Btl-2 Btl-3 Btl-4
Introduction to Hashing
Double hashing, Tree traversal and Demonstrate Red-Black
CO3 4 table, Hashing function,
Extendible hashing and Search trees construction tree, Splay tree and B-
Separate chaining and
Rehashing and implementation tree
open addressing
CO4 4 Btl-1 Btl-2 Btl-3 Btl-4
Introduction to Graph Graph Traversing Minimum spanning tree Minimum spanning tree

about:blank 1/24
1/24/23, 9:23 PM about:blank
data structure – Basic techniques – – Prim’s algorithm – Kruskal’s algorithm.
terminologies. Transitive Demonstrate Breadth
closure and First Search and Depth
representation of graphs First Search
Btl-5
Evaluate and
Discriminate the
CO5 4 significance of both
linear and nonlinear data
structures with respect to
real world applications.

PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs)

Po
Program Outcome
No.
Engineering Knowledge:Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization to the
PO1
solution of complex engineering problems.
Problem Analysis: Identify, formulate, review research literature, and analyse complex engineering problems reaching substantiated
PO2
conclusions using first principles of mathematics, natural sciences and engineering sciences
Design/Development of Solutions: Design solutions for complex engineering problems and design system components or processes that meet
PO3
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
PO4 and interpretation of data, and synthesis of the information 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 engineering and IT tools including prediction and
PO5
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, health, safety, legal and cultural issues
PO6
and the consequent responsibilities relevant to the professional engineering practice.
Environment and Sustainability:Understand the impact of the professional engineering solutions in societal and environmental contexts, and
PO7
demonstrate the knowledge of, and need for sustainable development
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice
PO9 Individual and Team Work: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary settings.
Communication:Communicate effectively on complex engineering activities with the engineering community and with society at large, such
PO10 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 management principles and apply these
PO11
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 independent and lifelong learning in the broadest
PO12
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

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Introduction to data structures- Mathematical Ref Book [1], CH 3.1
1 CO1 Chalk,PPT,Talk Platforms,SEM-EXAM1,Skill
1 background, Model Page no 57- 58
In-Sem Exam,Skilling
Continuous Evaluation

ALM,Continuous Evaluation -
Lab Exercise,End Semester
Exam,Home Assignment,Lab
End Semester Exam,Lab In
COI- Ref Book [1], CH 2.1 Semester Exam,Ratings on
2 CO1 Algorithm Analysis - Running time calculations Chalk,PPT,Talk
2 Page no 31- 36 Global Platforms,SEM-
EXAM1,Skill In-Sem
Exam,Skill Sem-End
Exam,Skilling Continuous
Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 7.2
3 CO1 Insertion Sort Analysis and Implementation Chalk,PPT,Talk Platforms,SEM-EXAM1,Skill
3 Page no 235 -237
In-Sem Exam,Skilling
Continuous Evaluation

4 CO1 COI- Shell Sort Analysis and Implementation Ref Book [1], CH 7.4 Chalk,PPT,Talk ALM,End Semester Exam,Home
3 Page no 238- 240 Assignment,Ratings on Global
Platforms,SEM-EXAM1,Skill

about:blank 2/24
1/24/23, 9:23 PM about:blank

Book No[CH No] Teaching-Learning

Sess.No. CO COI Topic EvaluationComponents
[Page No] Methods
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 7.7
5 CO1 Quick Sort Chalk,PPT,Talk Platforms,SEM-EXAM1,Skill
3 Page no 252- 262
In-Sem Exam,Skilling
Continuous Evaluation

ALM,Continuous Evaluation -
Lab Exercise,End Semester
Exam,Home Assignment,Lab In
COI- Ref Book [1], CH 3.1
6 CO1 Quick Sort Implementation Chalk,PPT,Talk Semester Exam,Ratings on
2 Page no 57- 58
Global Platforms,SEM-
EXAM1,Skilling Continuous
Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 7.6
7 CO1 Merge Sort Analysis and Implementation Chalk,PPT,Talk Platforms,SEM-EXAM1,Skill
3 Page no 246 - 250
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 7.5
8 CO1 bucket Sort ,analyze the time complexity Chalk,PPT,Talk Platforms,SEM-EXAM1,Skill
4 Page no 242- 245
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- RefBook [1],[1], CH
9 CO1 External sorting Chalk,PPT,Talk Platforms,SEM-EXAM1,Skill
4 7.11,Page no 250-252
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Singly Linked List - Creation, Insertion, Ref Book [1], CH 3.1
10 CO2 Chalk,PPT,Talk Platforms,SEM-EXAM1,Skill
1 Deletion, Display Page no 57- 58
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Doubly Linked list -Creation, Insertion, Ref Book [1], CH 3.2
11 CO2 Chalk,PPT,Talk Platforms,SEM-EXAM1,Skill
1 Deletion, Display Page no 59- 68
In-Sem Exam,Skilling
Continuous Evaluation

ALM,Continuous Evaluation -
Lab Exercise,End Semester
Exam,Home Assignment,Ratings
COI- Ref Book [1], CH 3.2 on Global Platforms,SEM-
12 CO2 circular linked list operations Chalk,PPT,Talk
2 Page no 59- 68 EXAM1,Skill In-Sem
Exam,Skill Sem-End
Exam,Skilling Continuous
Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 3.3
13 CO2 Stack Using Singly Linked list Chalk,PPT,Talk Platforms,SEM-EXAM1,Skill
2 Page no 78- 101
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1],CH
14 CO2 Queue Using Singly Linked List Chalk,LTC,PPT,Talk Platforms,SEM-EXAM1,Skill
3 3.3Page no 78-101
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1],CH
15 CO2 Infix to Postfix Expression Conversion Chalk,LTC,PPT,Talk Platforms,SEM-EXAM1,Skill
2 3.3Page no 78-93
In-Sem Exam,Skilling
Continuous Evaluation

about:blank 3/24
1/24/23, 9:23 PM about:blank

Book No[CH No] Teaching-Learning

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

ALM,End Semester
Exam,HA,Ratings on Global
COI- Infix to Postfix Expression Conversion Ref Book [1], CH 3.3
16 CO2 Chalk,PPT,Talk Platforms,SEM-EXAM1,Skill
2 Implementation Page no 78- 93
Sem-End Exam,Skilling
Continuous Evaluation

ALM,End Semester
Exam,HA,Home
COI- Evaluation of postfix expression, Balancing Ref Book [1], CH 3.3
17 CO2 Chalk,PPT,Talk Assignment,Ratings on Global
2 symbols Page no 88- 90
Platforms,SEM-EXAM1,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Types of Queue –
18 CO2 Types of Queue – Circular Queue Chalk,PPT,Talk Platforms,SEM-EXAM1,Skill
3 Circular Queue
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 3.4
19 CO2 Types of Queue – Dequeue Chalk,PPT,Talk Platforms,SEM-EXAM1,Skill
3 Page no 95- 101
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 3.4
20 CO2 Types of Queue – Dequeue Chalk,PPT,Talk Platforms,SEM-EXAM1,Skill
4 Page no 95- 101
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 5.3
21 CO3 Hashing - Hash function, Separate chaining Chalk,PPT,Talk Platforms,SEM-EXAM2,Skill
1 Page no 168 -172
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 5.4
22 CO3 Linear probing and Quadratic probing Chalk,PPT,Talk Platforms,SEM-EXAM2,Skill
1 Page no 173- 180
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 5.4
23 CO3 Double hashing Chalk,PPT,Talk Platforms,SEM-EXAM2,Skill
2 Page no 180- 181
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 5.4
24 CO3 Rehashing and Extendible hashing Chalk,PPT,Talk Platforms,SEM-EXAM2,Skill
2 Page no 168-180
In-Sem Exam,Skilling
Continuous Evaluation

ALM,Home Assignment,Ratings
on Global Platforms,SEM-
COI- Binary Tree - Tree traversals, Expression tree Ref Book [1], CH 4.2
25 CO3 Chalk,PPT,Talk EXAM2,Skill In-Sem
3 construction Page no 108 - 116
Exam,Skilling Continuous
Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Binary Search Tree – Construction, Insertion, Ref Book [1],CH
26 CO3 Chalk,PPT,Talk Platforms,SEM-EXAM2,Skill
3 Deletion 4.3Page no 116-123
In-Sem Exam,Skilling
Continuous Evaluation

ALM,Global
Certification,HA,Home
COI- Ref Book [1],CH Assignment,Lab In Semester
27 CO3 Binary Search Tree Implementation Chalk,PPT,Talk
3 4.3Page no 116-123 Exam,Ratings on Global
Platforms,SEM-EXAM2,Skilling
Continuous Evaluation

about:blank 4/24
1/24/23, 9:23 PM about:blank

Book No[CH No] Teaching-Learning

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

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 4.4
28 CO3 AVL Tree – Rotations and Operations Chalk,PPT,Talk Platforms,SEM-EXAM2,Skill
3 Page no 127- 138
In-Sem Exam,Skilling
Continuous Evaluation

ALM,Continuous Evaluation -
Lab Exercise,End Semester
Exam,Home Assignment,Ratings
COI- Ref Book [1], CH 4.4
29 CO3 AVL Tree Implementation Chalk,PPT,Talk on Global Platforms,SEM-
3 Page no 127- 138
EXAM2,Skill In-Sem
Exam,Skilling Continuous
Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 7.5
30 CO3 Heap Sort Analysis and Implementation Chalk,PPT,Talk Platforms,SEM-EXAM2,Skill
3 Page no 242- 245
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- T. Book [1], CH 4.7
31 CO3 B – Tree Construction Chalk,PPT,Talk Platforms,SEM-EXAM2,Skill
4 Page no 134-138
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH
32 CO3 Splay tree operations Chalk,PPT,Talk Platforms,SEM-EXAM2,Skill
4 4.5,Page no 138 - 141
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH
33 CO3 Construction of Red-Black trees Chalk,PPT,Talk Platforms,SEM-EXAM2,Skill
4 4.6, Page no 134- 140
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 9.1
34 CO4 Graphs Representation – Adjacency Matrix Chalk,PPT,Talk Platforms,SEM-EXAM2,Skill
1 Page no 300-302
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 9.1
35 CO4 Graphs Representation – Linked List Chalk,PPT,Talk Platforms,SEM-EXAM2,Skill
1 Page no 300- 302
In-Sem Exam,Skilling
Continuous Evaluation

ALM,Continuous Evaluation -
Lab Exercise,End Semester
Exam,Home Assignment,Ratings
COI- Ref Book [1], CH 9.1 on Global Platforms,SEM-
36 CO4 Transitive Closure Chalk,PPT,Talk
3 Page no 299- 300 EXAM2,Skill In-Sem
Exam,Skill Sem-End
Exam,Skilling Continuous
Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 9.5
38 CO4 Minimum Spanning Tree – Prim’s Algorithm Chalk,PPT,Talk Platforms,SEM-EXAM2,Skill
3 Page no 330- 332
In-Sem Exam,Skilling
Continuous Evaluation

ALM,End Semester Exam,Home

Assignment,Ratings on Global
COI- Ref Book [1], CH 9.5
39 CO4 Minimum Spanning Tree - Kruskal’s Algorithm Chalk,PPT,Talk Platforms,SEM-EXAM2,Skill
4 Page no 332 – 335
In-Sem Exam,Skilling
Continuous Evaluation

Lecture Session wise Teaching – Learning Plan

about:blank 5/24
1/24/23, 9:23 PM about:blank
SESSION NUMBER : 1

Session Outcome: 1 Students come to know the types of data structures.

Session Outcome: 2 Students come to know asymptotic notations and complexity analysis.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance 1 Talk
APPLICABLE ---
Introducing about Data Structures and Syllabus and LTPS StructureLecture 1: Explain --- NOT
10 1 Talk
the classification of Data Structures - Linear & Non-Linear. APPLICABLE ---
--- NOT
10 Lecture 1: Explain the classification of Data Structures - Linear & Non-Linear. 2 Talk
APPLICABLE ---
Lecture 2: Mathematical Background. Definitions of Asymptotic notations O(n), Ω(n)
--- NOT
20 and Ɵ(n) – Best, Average and Worst Case Ref: chapter-2 of Data structures and 2 Talk
APPLICABLE ---
algorithm analysis in C by Mark Allen Weiss
--- NOT
5 Conclusion and Summary 1 Talk
APPLICABLE ---

SESSION NUMBER : 2

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

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

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction 1 Talk
APPLICABLE ---
Lecture-1: Running time calculations, A simple example General rules Ask the
--- NOT
20 students to find the running time of following problems. I) Problem for( i=0; i < n-1 ; 3 PPT
APPLICABLE ---
i++) 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 ‘n’ ------ 1 3) initialize: sum=0, i=1 ------ 2 4) Process: sum = sum + i ------ n 5) --- NOT
20 3 Talk
i = i +1 ------ n 6) if ( i < = n ) go to step 4 ------ n 7) print ‘sum’ ------ 1 8) Stop ------ APPLICABLE ---
0 Total time in function f(n) = 3n + 4 Ref: chapter-2 of Data structures and algorithm
analysis in C by Mark Allen Weiss
--- NOT
5 Conclusion & Recap 1 Talk
APPLICABLE ---

SESSION NUMBER : 3

Session Outcome: 1 Students able to understand insertion sort

Session Outcome: 2 Students can implement insertion sort

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance 1 Talk
APPLICABLE ---
Subtopic -1 (Lecture): Explain How insertion sort works and analyze its time --- NOT
20 2 Talk
complexity with an example APPLICABLE ---
Practice session 1: Consider there are 10 group of members in cinema hall for taking
tickets from counter, arrange the group of members in a line according to the height --- NOT
10 2 Talk
of a persons. The height of persons is given in centimeters as follows. 165, 173, 195, APPLICABLE ---
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 city. If he sees a zombie, he marks them in his list with their --- NOT
10 2 Talk
power. After generating the entire list of power of these creatures, he decides to APPLICABLE ---
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 and Summary 2 Talk
APPLICABLE ---

SESSION NUMBER : 4

Session Outcome: 1 Students will able to know about shell sort

Session Outcome: 2 Students can implement shell sort

about:blank 6/24
1/24/23, 9:23 PM about:blank

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance 1 Talk
APPLICABLE ---
Subtopic -1 (Lecture): Explain how shell sort works using shell's original sequence: --- NOT
10 2 Talk
N/2, N/4, ..., 1 (repeatedly divide by 2). Explain Hibbard, Sedgwick increments. APPLICABLE ---
Practice session 1: Ask the students to implement shell sort by using insertion sort
independently for each pass. Algorithm: 1) Read “n” elements as input in array. 2) --- NOT
20 2 Talk
Process /* Identify and print the each passes elements */ 3) Display the sorted as APPLICABLE ---
elements output.
Subtopic -2 (Lecture): Analyze the time complexity of shell sort. Discuss what
--- NOT
10 disadvantages of insertion sort does the shell sort overcome. [ Classic Data Structures 2 Talk
APPLICABLE ---
2Nd Ed. By Samanta, SamantaDebasis]
--- NOT
5 Conclusion and Summary 2 Talk
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- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance 1 Talk
APPLICABLE ---
--- NOT
20 Sub-topic 1(Lecture): Explain Quick sort algorithm with best case derivation. 2 Talk
APPLICABLE ---
Practice session 1: Ask the students to sort the following data using quick sort: --- NOT
10 2 Talk
55,11,22,99,55,33, 77,88, 33 and then analyze the Best case for Quick sort APPLICABLE ---
--- NOT
10 Sub-topic 2 (Lecture): Explain Quick sort algorithm with worst case derivation. 2 Talk
APPLICABLE ---
--- NOT
5 Conclusion and Summary 2 Talk
APPLICABLE ---

SESSION NUMBER : 6

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

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction 1 Talk
APPLICABLE ---
--- NOT
20 Implemetation of Quick sort 3 Talk
APPLICABLE ---
20 ALM 3 LTC Leading question
--- NOT
5 Conclusion & Recap 1 Talk
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- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction 2 Chalk
APPLICABLE ---
--- NOT
10 Subtopic-1(lecture): Explain Merge sort and its basics with an example. 2 Talk
APPLICABLE ---
Practice session - 1: Here is an array of ten integers: 5 3 8 9 1 7 0 2 6 4 Draw this
--- NOT
20 array after the TWO recursive calls of merge sort are completed, and before the final 2 Talk
APPLICABLE ---
merge step has occurred.
Subtopic-2(lecture): Analyze the complexity of merge sort algorithm.
MergeSort(arr[], l, r) If r > l {1. Find the middle point middle m = (l+r)/2 2. Call
--- NOT
10 mergeSort for first half: Call mergeSort(arr, l, m) 3. Call mergeSort for second half: 3 Talk
APPLICABLE ---
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
about:blank 7/24
1/24/23, 9:23 PM about:blank
Session Outcome: 2 Students able to analyze the time complexity

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 recap 2 Chalk
APPLICABLE ---
--- NOT
10 Sub topic – 1 (Lecture): Explain Bucket Sort and its Basic concept 2 Talk
APPLICABLE ---
Practical session – 1: Ask the students to sort the following data using bucket sort: --- NOT
20 3 PPT
55,11,22,99,55,33, 77,88, 33 APPLICABLE ---
--- NOT
10 Sub topic –3 (Lecture): Analyze the complexity of bucket sort algorithm 4 PPT
APPLICABLE ---
--- NOT
5 Conclusion 2 Talk
APPLICABLE ---

SESSION NUMBER : 9

Session Outcome: 1 Students able understand the external sorting

Session Outcome: 2 Students able to analyze the time complexity of external sorting

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction: 1 Talk
APPLICABLE ---
Sub-topic-1(lecture): Explain External sorting and two phases of external sorting (1. --- NOT
10 2 Talk
Sort phase 2. Merge phase) with an example. APPLICABLE ---
Practice session - 1: Ask the students to write an algorithm to sort the elements using --- NOT
10 2 Talk
External sorting technique and also analyze its time complexity. APPLICABLE ---
Practice Session(LTC): Ask the students to write and execute a C program to solve the
following example. N = 14, M = 3 (14 records on tape Ta1, memory capacity: 3
--- NOT
20 records.) T1: 17, 3, 29, 56, 24, 18, 4, 9, 10, 6, 45, 36, 11, 43 [Donald Knuth, The Art 3 Talk
APPLICABLE ---
of Computer Programming, Volume 3: Sorting and Searching, Second Edition.
Addison-Wesley]
5 Conclusion 1 Talk Quiz/Test Questions

SESSION NUMBER : 10

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

Session Outcome: 2 Students able to implement singly linked list

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction: 2 Chalk
APPLICABLE ---
Lecture: Explain singly linked list operations with diagram’s Ref: chapter-3 of Data --- NOT
20 1 Talk
structures and algorithm analysis in C by Mark Allen Weiss APPLICABLE ---
Practice Session 1: Suppose the Personnel file of a small company contain the
following data for all its employees SSN (social security number), Name and salary. A
Linked list is used to store the data. Ask the students to write a function to sort the --- NOT
20 3 Talk
records based on SSN? struct node { int train_no; char train_name[20], source[20], APPLICABLE ---
destination[20]; float AC1_ fare, AC2_fare, AC3_fare, SL_fare, Gen_fare; } t[20];
Ref : “Data Structures “by Forozan
--- NOT
5 Conclusion 1 Talk
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- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction: 2 Chalk
APPLICABLE ---
Lecture: Explain doubly linked list operations with diagram’s Ref: chapter-3 of Data --- NOT
20 3 Talk
structures and algorithm analysis in C by APPLICABLE ---
Practice Session-1: 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 and open --- NOT
20 3 Talk
his other friend Lalitha’s page and read all her status and going on doing like this. APPLICABLE ---
Implement this as an operation of creation, insertion, deletion and searching of friends
using Double Linked List.

about:blank 8/24
1/24/23, 9:23 PM about:blank

--- NOT
5 Conclusion 1 Talk
APPLICABLE ---

SESSION NUMBER : 12

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

Session Outcome: 2 Students able to implement circular linked list

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction 1 Talk
APPLICABLE ---
Lecture: Explain Insertion of elements at begin, at the given position and at end
--- NOT
20 operations of SLL, Circular SLL, and DLL Ask the students to execute deletion at 3 Talk
APPLICABLE ---
begin and end operation on SLL, Circular SLL, and DLL
20 ALM 3 Talk Case Study
--- NOT
5 Conclusion & Recap 1 Talk
APPLICABLE ---

SESSION NUMBER : 13

Session Outcome: 1 Students can understand stack operations

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

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap/Introduction 1 Chalk
APPLICABLE ---
--- NOT
20 Linked list implementation of stacks 2 Talk
APPLICABLE ---
Ask the students to write and execute a program to implement Stack using Linked --- NOT
20 3 Talk
List APPLICABLE ---
--- NOT
5 Conclusion 1 Talk
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- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap/Introduction: 1 Chalk
APPLICABLE ---
--- NOT
20 Lecture Linked list implementation of queue 2 PPT
APPLICABLE ---
Practice Session: In a railway station an engine is connected with the N number of
Bogieswhich are connected in one direction from engine to the last bogie. --- NOT
20 3 Chalk
Implementthis as an operation of creation, insertion, deletion and searching of a APPLICABLE ---
bogieusingSingleLinkedList.
--- NOT
5 Conclusion 1 Talk
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- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
25 Lecture: Explain how to convert an infix expression to postfix using stacks 1 Chalk
APPLICABLE ---
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
25 expression from infix to postfix notation. What is the maximum number of symbols 2 PPT
APPLICABLE ---
that will appear on the stack at one time during the conversion of this expression?
Reference : http://cs.nyu.edu/courses/Fall12/CSCI-GA.1133-002

SESSION NUMBER : 16

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

about:blank 9/24
1/24/23, 9:23 PM about:blank
Session Outcome: 2 Students able to analyze the time complexity of infix to postfix expression conversion

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap/Introduction 1 Chalk
APPLICABLE ---
--- NOT
20 Lecture: Explain how to convert an infix expression to postfix using stacks 2 Talk
APPLICABLE ---
Practice Session 1: Thefirstinputwillbea singleintegerN denoting the numberof
testcases to take. After this there will be exactly N lines, each line a valid infix string.
The stringwill be a valid postfix expression consisting of integers, binary operators (+, --- NOT
20 2 PPT
-, *, / and $) andparenthesis. Every integer, operator and parenthesis will be APPLICABLE ---
compulsorily separated by aSPACE.Thesymbol„?‟denotestheendof expression.
Reference : http://cs.nyu.edu/courses/Fall12/CSCI-GA.1133-002
--- NOT
5 Conclusion and Summary 1 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- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap/Introduction: 1 Chalk
APPLICABLE ---
--- NOT
10 Explain the evaluation of postfix expression using stack 2 Talk
APPLICABLE ---
Practice Session 1: Ask the students to write a program for evaluating the following --- NOT
10 2 PPT
postfix expression using stack 1 2 3 * + 4 – Reference : http://scriptasylum.com/ APPLICABLE ---
--- NOT
10 Explain about balancing symbols 1 Talk
APPLICABLE ---
Practice Session 2: Given an expression string exp, write a program to examine --- NOT
10 1 Talk
whether the pairs and the orders of “{“, “}”, “(“, “)”, “[“, “]” are correct in exp APPLICABLE ---
--- NOT
5 Conclusion and Summary 1 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 Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
5 Recap / Introduction 1 Chalk
APPLICABLE ---
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 request is added to the print --- NOT
20 2 Talk
queue. When your request reaches the front of the print queue, your file is printed. APPLICABLE ---
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.
Use Queue data structure to print binary numbers from 1 to n. 1) Create an empty
queue of strings 2) Enqueue the first binary number “1” to queue. 3) Now run a loop
--- NOT
20 for generating and printing n Binary Numbers. a) Dequeue and Print the front of 2 Talk
APPLICABLE ---
queue. b) Append“0”attheendoffrontitemandenqueueit. c) Append “1” at the end of
front item and enqueue it. 2 Input: n=5 Output: 1,10,11,100,101
--- NOT
5 Conclusion and Summary 1 Talk
APPLICABLE ---

SESSION NUMBER : 19

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 Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
5 Recap / Introduction 1 Chalk
APPLICABLE ---
20 Given an integer m, size of double ended queue, and n operations, implement the 3 LTC Quiz/Test Questions
double ended queue. Queries are defined as below. • 1 x --> insert an element x to the

about:blank 10/24
1/24/23, 9:23 PM about:blank
front end • 2 x --> insert an element x to the rear end • 3 --> delete an element from
front end • 4 --> delete an element from rear end
Use Queue data structure to print binary numbers from 1 to n. 1) Create an empty
queue of strings 2) Enqueue the first binary number “1” to queue. 3) Now run a loop
--- NOT
10 for generating and printing n Binary Numbers. a) Dequeue and Print the front of 2 Talk
APPLICABLE ---
queue. b) Append“0”attheendoffrontitemandenqueueit . c) Append “1” at the end of
front item and enqueue it. 2 Input: n=5 Output: 1,10,11,100,101
--- NOT
10 Ask the students to execute practice session-2. 3 Talk
APPLICABLE ---
--- NOT
5 Conclusion and Summary 1 Talk
APPLICABLE ---

SESSION NUMBER : 20

Session Outcome: 1 Students come to know about priority queues

Session Outcome: 2 Students able to implement binary heap

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Explain the concept of Priority queues and their applications 1 Chalk
APPLICABLE ---
Practice Session 1: 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 unnecessary delay --- NOT
20 3 Talk
and thereby the decreases the efficiency. Eg: , , , is the queue along with service time APPLICABLE ---
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
Subtopic -1: Types of priority queues 1. Ascending PQ-Element with least priority
removed first 2.Descending PQ- Element with highest priority removed first. --- NOT
20 3 PPT
Subtopic 2- Operations on Priority Queue 1. Creation 2. Insertion 3. Deletion 4. APPLICABLE ---
Display
--- NOT
5 Conclusion 1 Talk
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- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction: 1 Chalk
APPLICABLE ---
Subtopic -1 (Lecture): Explanation of separate chaining using hashing technique.
--- NOT
10 Initialization routine for separate chaining hash table. Reference: Data structures by 1 Talk
APPLICABLE ---
Mark Allen Weiss.
10 Subtopic -2 (Lecture): Explanation of separate chaining using hashing technique.
--- NOT
10 Initialization routine for separate chaining hash table. Reference: Data structures by 1 Talk
APPLICABLE ---
Mark Allen Weiss. 1
10 Practice session: Ask the students to construct hash table using separate chaining
--- NOT
10 for the following elements of table size 15, design your own hash function. 2 PPT
APPLICABLE ---
23,27,98,6,17,51,77,72,36,53. Ask the students to implement initialization function 2
10 Practice session: Ask the students to implement the following operations on hash
--- NOT
10 table using separate chaining 1.insert () 2. search () Reference: Data structures by 4 PPT
APPLICABLE ---
Mark Allen Weiss. 4
--- NOT
5 5 Conclusion 5 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- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction 1 Chalk
APPLICABLE ---
Sub topic -1 (Lecture): Explanation of Open Addressing and different types of
strategies to resolve Collision. Explanation of Linear probing and its implementation.
--- NOT
20 Reference: Data structures by Mark Allen Weiss Sub topic -1 (Lecture): Explanation 1 Talk
APPLICABLE ---
of quadratic probing and its implementation. Reference: Data structures by Mark
Allen Weiss

about:blank 11/24
1/24/23, 9:23 PM about:blank

Practice session 1: *Ask the students to insert keys {43, 55, 27, 73, 67} in to hash --- NOT
20 3 Chalk
table of size 11 APPLICABLE ---
--- NOT
5 Summary &conclusion 1 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 Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
5 Recap / Introduction: 1 Chalk
APPLICABLE ---
Sub topic -1 (Lecture): Explanation of Open Addressing and different types of
--- NOT
20 strategies to resolve Collision. Explanation of double hashing and its implementation. 3 Talk
APPLICABLE ---
Reference: Data structures by Mark Allen Weiss
Practice session 1 *Ask the students to insert keys {18, 41, 22, 44, 59, 32, 31, 73} in to
--- NOT
20 hash table of size 13 Reference:http://www.eecs.yorku.ca/course_archive/2004- 3 Talk
APPLICABLE ---
05/W/2011N/Notes/hash_tables_2.pdf *Implement double hashing to insert keys.
--- NOT
5 Summary &conclusion 1 Talk
APPLICABLE ---

SESSION NUMBER : 24

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

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

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction: 1 Chalk
APPLICABLE ---
Sub topic -1 (Lecture): Explanation of rehashing concept and its importance Ask the
--- NOT
20 students to construct hash table with the keys 19, 28, 93, 72, 10, 31, 63, 54. 1 PPT
APPLICABLE ---
Reference: Data structures by Mark Allen Weiss
Sub topic -1 (Lecture): Explanation of extendible hashing concept and its importance
--- NOT
20 Ask the students to construct hash table with the keys 94, 82, 39, 29, 61, 13, 36, 45. 3 Talk
APPLICABLE ---
Reference: Data structures by Mark Allen Weiss
--- NOT
5 Summary &conclusion 2 Chalk
APPLICABLE ---

SESSION NUMBER : 25

Session Outcome: 1 Students come to know about tree traversals

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

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap/Introduction: 1 Chalk
APPLICABLE ---
Subtopic – 1 (Lecture): Explain expression tree construction, and tree traversals – In- --- NOT
20 2 PPT
order, Pre-order, and Post-order. APPLICABLE ---
Practice session 1: Ask the students to construct a binary tree for the given elements --- NOT
10 2 Talk
77,44,58,19,29,25,31,12. And print inorder, preorder, and postorder. APPLICABLE ---
Explain Expression Tree construction. Practice session -2: Ask the students to
construct an expression tree for the following expression(A+B)*((C-D)/(E^F)) could --- NOT
10 2 Talk
be represented thus [E^F means E raised to the F power] [Data Structures and APPLICABLE ---
Algorithm Analysis in C, Mark Allen Weiss, 4thchapter question]
--- NOT
5 Conclusion 4 Chalk
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- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction 1 Chalk
APPLICABLE ---

about:blank 12/24
1/24/23, 9:23 PM about:blank

--- NOT
20 Explain Tree terminology, Binary Tree – Construction and display. 1 Talk
APPLICABLE ---

SESSION NUMBER : 27

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

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap/Introduction: 1 Chalk
APPLICABLE ---
Explanation of BST Tree - Construction and Display Write function to perform the
following operations on a BST: 1.Tree Traversals (Inorder, Preorder and Postorder) --- NOT
20 1 Talk
2.Insert a node in BST. Finding the minimum and maximum in BST using recursive APPLICABLE ---
and iterative approaches.
Ask the students to write function in BST to perform the following: 4.Deleting a child
--- NOT
20 (leave) node. 5.Deleting a sub tree node that has one child. Deleting a sub tree node 1 PPT
APPLICABLE ---
that has two child nodes.

SESSION NUMBER : 28

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

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap/Introduction 1 Chalk
APPLICABLE ---
Sub-topic-1 (Lecture): Explain AVL Tree and advantages of AVL Tree in the data --- NOT
10 1 Talk
organization. Reference: Data Structures by Mark Allen Weiss APPLICABLE ---
Practice session -1: a. Construct an AVL tree with the following data 25, 99, 101, 15,
--- NOT
20 7, 32, 10 b. Find balancing factor of node 7. c. Find resultant AVL tree after deleting 2 PPT
APPLICABLE ---
root. Reference:www.sanfoundary.com
Sub-topic-3 (Lecture): Need for rebalancing the AVL Tree using Single rotation.
Discussion of single left rotation and single right rotation. Construct an AVL tree with --- NOT
10 3 Talk
the following node values: 13, 10, 7, 30, 35, 5, 3 and identify the single left rotations APPLICABLE ---
and single right rotations. Reference:www.cprograms.com
--- NOT
5 Conclusion 1 Talk
APPLICABLE ---

SESSION NUMBER : 29

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

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction 1 Talk
APPLICABLE ---
Sub-topic – 1 (Lecture) AVL tree ADT creation along with required function --- NOT
20 1 Talk
prototypes. Reference: Data Structures by Mark Allen Weiss APPLICABLE ---
20 ALM 3 LTC One minute paper
--- NOT
5 Conclusion & Recap 1 Talk
APPLICABLE ---

SESSION NUMBER : 30

Session Outcome: 1 Students able to implement heap sort

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

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction: 2 Chalk
APPLICABLE ---
Subtopic-1(lecture): 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 nodes are either greater than or equal to or less than or equal to --- NOT
10 2 Talk
each of its children. If the parent nodes are greater than their child nodes, heap is APPLICABLE ---
called a Max-Heap, and if the parent nodes are smaller than their child nodes, heap is
called Min-Heap.
Practice session - 1: Ask the students to write an algorithm to sort the elements using
--- NOT
20 heap sort technique and also analyse its time complexity. Analysis time Complexity of 3 PPT
APPLICABLE ---
Heap Sort
10 Practice session - 2: Suppose we are sorting an array of eight integers using heapsort, 4 Talk --- NOT
and we have just finished some heapify (either maxheapify or minheapify) operations. APPLICABLE ---

about:blank 13/24
1/24/23, 9:23 PM about:blank
The array now looks like this: 16 14 15 10 12 27 28 How many heapify operations
have been performed on root of heap?
--- NOT
5 Conclusion 1 Talk
APPLICABLE ---

SESSION NUMBER : 31

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

Session Outcome: 2 Students able to perform insert and delete operation on B tree

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction: 1 Chalk
APPLICABLE ---
Subtopic – 1 (Lecture): Explain construction of B tree (BST) with an example. Give --- NOT
20 2 Talk
the importance of M-way search tree APPLICABLE ---
Practice session 1: Ask the students to construct B tree with the keys 23, 85 34, 51, --- NOT
20 2 PPT
45, 10, 28, 41, 67, 19, 7, 30 and order 4 APPLICABLE ---
--- NOT
5 Conclusion 1 Talk
APPLICABLE ---

SESSION NUMBER : 32

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

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

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
5 Recap / Introduction: 1 Talk
APPLICABLE ---
Sub-topic-1 (Lecture) Explain selective splaying. zig-zig and zig-zag rotations and --- NOT
20 2 Chalk
how it overcomes normal splaying. Reference: Data Structures by Mark Allen Weiss. APPLICABLE ---
Practice session -1: Create splay Tee with following keys with root 38.
--- NOT
25 1,32,3,4,8,65,42,34,81,9,32,56,54,38,66,77,44 apply splaying at node 54. Reference: 3 PPT
APPLICABLE ---
Data Structures by Mark Allen Weiss.
--- NOT
5 Conclusion 1 Talk
APPLICABLE ---

SESSION NUMBER : 33

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- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction: 1 Talk
APPLICABLE ---
--- NOT
10 Sub topic – 1 (Lecture): Explain Red Black tree and its properties 2 Chalk
APPLICABLE ---
--- NOT
10 Sub topic – 2 (Lecture): Explain Insert operation of Red Black tree(ReColoring) 2 Chalk
APPLICABLE ---
20 Sub topic – 2 (Lecture): Explain Insert operation of Red Black tree(Rotation) 2 LTC Quiz/Test Questions
--- NOT
5 Conclusion 2 Talk
APPLICABLE ---

SESSION NUMBER : 34

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

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction 1 Talk
APPLICABLE ---
--- NOT
20 Explanation of Graph representation – adjacency matrix 2 PPT
APPLICABLE ---
--- NOT
20 Practice session1: represent the given graph in adjacency matrix 2 Chalk
APPLICABLE ---
--- NOT
5 Conclusion 1 Talk
APPLICABLE ---

SESSION NUMBER : 35

about:blank 14/24
1/24/23, 9:23 PM about:blank
Session Outcome: 1 Students come to understand the representing of graphs

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction 1 Talk
APPLICABLE ---
--- NOT
20 Explanation of Graph representation –adjacency list representation 2 PPT
APPLICABLE ---
--- NOT
20 Practice session1: represent the given graph in list representation 2 Chalk
APPLICABLE ---
--- NOT
5 Conclusion 1 Talk
APPLICABLE ---

SESSION NUMBER : 36

Session Outcome: 1 Students come to understand the transitive closure

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction 1 Talk
APPLICABLE ---
Explain Definitions of DAG, Transitive closure. Lecture: Example applications of
--- NOT
20 graphs such as the airport system, Traffic flow modeling etc. Practice Session: Ask 3 Talk
APPLICABLE ---
students to find transitive closure for the given graph
20 ALM 3 LTC Think / Pair / Share
--- NOT
5 Conclusion & Recap 1 Talk
APPLICABLE ---

SESSION NUMBER : 38

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

Session Outcome: 2 Students able to use prim’s algorithm.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction: 1 Chalk
APPLICABLE ---
Explain the Minimum spanning tree. Explain Prim’s algorithm with the help of --- NOT
20 1 Talk
weighted graph APPLICABLE ---
--- NOT
20 Apply Prim’s algorithm on a weighted graph to get minimum spanning tree 2 PPT
APPLICABLE ---
--- NOT
5 Conclusion 1 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- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Recap / Introduction: 1 Talk
APPLICABLE ---
Explain what is spanning tree and minimum spanning tree. Explain applications of --- NOT
10 2 Talk
minimum spanning tree APPLICABLE ---
Explain about Krushkal’s minimum spanning tree algorithm and how it used to find
20 3 LTC Quiz/Test Questions
minimum spanning tree using diagrams.
--- NOT
10 Ask the students to analyze the time complexity of Krushkal’s algorithm. 4 Chalk
APPLICABLE ---
--- NOT
5 Conclusion 1 Talk
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 15/24
1/24/23, 9:23 PM about:blank

Tutorial
Session Topics CO-Mapping
no

1) ImplementInsertionSort GivenalistofNarrayelements applyinsertionsortonarray. InputFormat

ThefirstlinecontainstheintegerN,thesizeofthearray.ThenextlinecontainsN space-separatedintegers. Constraints •
1 CO5
1<=N<=1000 • -1000<=a[i]<=1000 Output Format: Print the array as a row of space-separated integers each
iteration

1. Implement Quick sort: GivenalistofNarrayelements applyshellsortonarray. There will be two lines of input: • -
2 CO5
the size of the array • - the n numbers of the array Print every partitioned sub-array on a new line.

Given a list of N array element apply Merge sort. Merge Sort is a Divide and Conquer algorithm. It divides
inputarrayintwohalves,callsitselfforthetwohalvesandthenmergesthetwosortedhalves.Thefirstlinecontainsan
3 CO5
integer, N, the number of elements in Array. The second line contains N space-separated integers. Print the
arrayasarowofspace-separatedintegersineachiteration.

1. InsertingaNodeIntoaSortedDoublyLinkedList Given a reference to the head of a doubly-linked list and an

4 integer,data, create anewDoublyLinkedListNodeobjecthaving datavaluedataandinsertitattheproperlocationto CO5
maintainthesort.

5 Reverse a List CO5

6 Maximum Element CO5

7 1. Max in Queue CO5

8 Evaluate Postfix Expression CO5

9 Hashing– a. Separate chaining b. Open Addressing CO5

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

11 AVL Tree–Self Balancing Tree CO5

12 Graphs– a. BFS b. DFS CO5

Practical Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Student will able to apply sort

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
GivenalistofNarrayelements applyinsertionsortonarray. InputFormat
--- NOT
50 ThefirstlinecontainstheintegerN,thesizeofthearray.ThenextlinecontainsN space- 3 Chalk
APPLICABLE ---
separatedintegers.
https://www.hackerrank.com/contests/17cs1102/challenges/3-a-implement-insertion- --- NOT
50 3 Chalk
sort APPLICABLE ---

SESSION NUMBER : 2

Session Outcome: 1 Student will able to Quick sort

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
GivenalistofNarrayelements applyshellsortonarray. There will be two lines of input: • -
--- NOT
50 the size of the array • - the n numbers of the array Print every partitioned sub-array on 3 Chalk
APPLICABLE ---
a new line.
--- NOT
50 https://www.hackerrank.com/challenges/quicksort2/problem 3 Chalk
APPLICABLE ---

SESSION NUMBER : 3

Session Outcome: 1 Student will able to Quick sort

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
50 Given a list of N array element apply Merge sort. Merge Sort is a Divide and Conquer algorithm. It 3 Chalk --- NOT
divides APPLICABLE
inputarrayintwohalves,callsitselfforthetwohalvesandthenmergesthetwosortedhalves.Thefirstlinecontainsan ---

about:blank 16/24
1/24/23, 9:23 PM about:blank
integer, N, the number of elements in Array. The second line contains N space-separated integers. Print
the arrayasarowofspace-separatedintegersineachiteration.
--- NOT
50 https://www.hackerrank.com/contests/17cs1102/challenges/merge-sort-6 3 Talk APPLICABLE
---

SESSION NUMBER : 4

Session Outcome: 1 Student will able to Inserting a node in doubly linked list

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
1. InsertingaNodeIntoaSortedDoublyLinkedList Given a reference to the head of a
doubly-linked list and an integer,data, create --- NOT
50 3 Talk
anewDoublyLinkedListNodeobjecthaving APPLICABLE ---
datavaluedataandinsertitattheproperlocationto maintainthesort.
https://www.hackerrank.com/challenges/insert-a-node-into-a-sorted-doubly-linked- --- NOT
50 3 Talk
list/problem?h_r=internal-search APPLICABLE ---

SESSION NUMBER : 5

Session Outcome: 1 Students will be able to apply the concepts of linked list

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
50 https://www.hackerrank.com/challenges/fp-reverse-a-list/problem?h_r=internal-search 3 Talk
APPLICABLE ---
https://www.hackerrank.com/challenges/one-month-preparation-kit-reverse-a-doubly- --- NOT
50 3 LTC
linked- list/problem=internal-search APPLICABLE ---

SESSION NUMBER : 6

Session Outcome: 1 Students will be able to apply the concepts of searching

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
https://www.hackerrank.com/challenges/maximum-element/problem? --- NOT
50 3 Talk
isFullScreen=true APPLICABLE ---
--- NOT
50 https://www.hackerrank.com/challenges/equal-stacks/problem?isFullScreen=true 3 Talk
APPLICABLE ---

SESSION NUMBER : 7

Session Outcome: 1 Students will be able to apply the concepts of queue

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
https://www.hackerearth.com/practice/data-structures/trees/heapspriority- --- NOT
50 3 Talk
queues/practice-problems/algorithm/queues-content-problem/ APPLICABLE ---
--- NOT
50 https://www.codechef.com/problems/KCPROG4 3 LTC
APPLICABLE ---

SESSION NUMBER : 8

Session Outcome: 1 stack

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
https://www.hackerrank.com/contests/17cs1102/challenges/8-c-postfix-expression- --- NOT
50 3 Talk
evaluation/problem APPLICABLE ---
--- NOT
50 https://www.codechef.com/problems/INFPOS03 3 Talk
APPLICABLE ---

SESSION NUMBER : 9

Session Outcome: 1 Students will be able to apply the concept of Hashing

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
https://www.hackerearth.com/practice/data-structures/hash-tables/basics-of-hash-
tables/practice-problems/algorithm/unusual-construction- --- NOT
50 3 Chalk
3ec2e03f/,https://www.hackerearth.com/practice/data-structures/hash-tables/basics-of- APPLICABLE ---
hash-tables/practice-problems/algorithm/count-pairs-9-d69fcdc3/
https://www.hackerearth.com/practice/data-structures/hash-tables/basics-of-hash- --- NOT
50 3 Talk
tables/practice-problems/algorithm/t-rex-and-the-pairs-0a045ce2/ APPLICABLE ---

about:blank 17/24
1/24/23, 9:23 PM about:blank
SESSION NUMBER : 10

Session Outcome: 1 Students will be able to create and traverse Binary Search tree

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
https://www.hackerrank.com/challenges/one-week-preparation-kit-tree-preorder-
--- NOT
50 traversal/problem?h_r=internal-search,https://www.hackerrank.com/challenges/binary- 3 Chalk
APPLICABLE ---
search-tree-insertion/problem
--- NOT
50 https://www.hackerrank.com/challenges/30-binary-search-trees/problem 3 Talk
APPLICABLE ---

SESSION NUMBER : 11

Session Outcome: 1 Students will be able to apply Avl trees

Teaching-
Active Learning
Time(min) Topic BTL Learning
Methods
Methods
--- NOT
50 https://www.codechef.com/problems/UCS616A2,https://www.codechef.com/problems/CHEFTRE 3 Chalk APPLICABLE -
--
--- NOT
50 Canyouhelphim?Link:https://www.codechef.com/problems/L56AVG 3 Talk APPLICABLE -
--

SESSION NUMBER : 12

Session Outcome: 1 Students will be able to apply Graphs concepts

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
1. Analyzewhytopologicalsortingcanbeapplicableto
DirectedacyclicGraphs(DAG).Apply topological sorting for the given graph, 2.
--- NOT
50 Construct the weighted directed graph represented by the adjacency matrix given 3 Chalk
APPLICABLE ---
below. A non-zero valueat [row, column] indicates that the vertex in the row is
adjacent to the vertex in the column and apply DFS to the graph
3. ApplyDijkstra’salgorithmtofindshortest pathfromnode1 to all other nodes for the --- NOT
50 3 Talk
following graph APPLICABLE ---

Skilling Course DELIVERY Plan:

Skilling
session Topics/Experiments CO-Mapping
no

1 Insertion Sort and Shell Sort CO1

2 Singly Linked List CO2

3 Stack CO3

4 Graphs CO4

5 Prims CO5

Skilling Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Insertion Sort and Shell Sort

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
50 Merge Sort: Counting Inversions 3 Talk
APPLICABLE ---
--- NOT
50 Suffix Sort 3 Talk
APPLICABLE ---

SESSION NUMBER : 2

Session Outcome: 2 Skill

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods

about:blank 18/24
1/24/23, 9:23 PM about:blank

--- NOT
50 Print the Elements of a Linked List 3 Talk
APPLICABLE ---
--- NOT
50 Compare two linked lists 3 Talk
APPLICABLE ---

SESSION NUMBER : 3

Session Outcome: 3 Skill

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
50 Sudhanva and Books 3 Talk
APPLICABLE ---
--- NOT
50 Mayank and his stacks 3 Talk
APPLICABLE ---

SESSION NUMBER : 4

Session Outcome: 4 Skill

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
50 BFS: Shortest Reach in a Graph 3 Talk
APPLICABLE ---
--- NOT
50 Build a graph 3 Talk
APPLICABLE ---

SESSION NUMBER : 5

Session Outcome: 5 Skill

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
Prim's (MST) : Special Subtree --- NOT
50 3 Talk
https://www.hackerrank.com/challenges/primsmstsub/problem APPLICABLE ---
Finding pairs https://www.hackerearth.com/practice/algorithms/graphs/depth-first- --- NOT
50 3 Talk
search/practice-problems/algorithm/find-pairs-4-699bc085/ APPLICABLE ---

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

Assignment
Week Assignment Type Topic Details co
No

COURSE TIME TABLE:

Hour 1 2 3 4 5 6 7 8 9
Day Component
V-S17,V-
V-S2,V-S3,V- V-S5,V-S6,V- V-S5,V-S6,V-
S18,V-S19,V-
S4,V-S43,V- S7,V-S8,V- S7,V-S8,V-
V-S2,V-S3,V- V-S17,V-S18,V- S20,V-S49,V-
Theory S44,V-S45,V- S37,V-S38,V- S37,V-S38,V- -- -- --
S4 S19,V-S20 S50,V-S51,V-
S46,V-S47,V- S39,V-S41,V- S39,V-S41,V-
S52,V-S53,V-
S48 S42 S42
Mon S54
Tutorial -- -- -- -- -- -- -- -- --
V-S13,V- V-S9,V- V-
V-S13,V-S14,V- V-S9,V-S10,V- V-S49,V- V-S49,V-
Lab V-S25,V-S26 V-S25,V-S26 S14,V-S15,V- S10,V-S11,V- S37,V-
S15,V-S16 S11,V-S12 S50 S50
S16 S12 S38
Skilling V-S1 V-S1 V-S40 V-S40 -- -- -- -- --

about:blank 19/24
1/24/23, 9:23 PM about:blank

V-S9,V-S11,V-
V-S9,V-S11,V-
S12,V-S13,V-
S12,V-S25,V- V-S44,V- V-S44,V-
V-S21,V- V-S21,V- S14,V-S15,V-
S26,V-S49,V- V-S13,V-S14,V- S45,V- S45,V-
Theory S22,V-S23,V- S22,V-S23,V- S16,V-S49,V- -- --
S50,V-S51,V- S15,V-S16 S46,V- S46,V-
S24 S24 S50,V-S51,V-
S52,V-S53,V- S48 S48
S52,V-S53,V-
S54
S54
Tutorial -- -- -- -- -- -- -- -- --
Tue
V-S17,V- V-
V-S17,V-S18,V- V-S1,V-S2,V- V-S1,V-S2,V- V-S51,V- V-S51,V-
Lab -- -- S18,V-S19,V- S39,V-
S19,V-S20 S3,V-S4 S3,V-S4 S52 S52
S20 S40
V-S5,V-S6,V- V-S5,V-S6,V-
S7,V-S8,V- S7,V-S8,V-
V-S43,V- V-S43,V-
Skilling S37,V-S38,V- S37,V-S38,V- V-S10 V-S10 -- -- --
S47 S47
S39,V-S40,V- S39,V-S40,V-
S41,V-S42 S41,V-S42
V-S9,V- V-S13,V-
V-S1,V-S2,V- V-S25,V-S26,V-
Theory S10,V-S11,V- S14,V-S15,V- V-S43,V-S47 V-S25,V-S26 -- -- --
S3,V-S4 S43,V-S47
S12 S16
Tutorial -- -- -- -- -- -- -- -- --
V-S21,V- V-
Wed V-S21,V-S22,V- V-S5,V-S6,V- V-S5,V-S6,V- V-S53,V- V-S53,V-
Lab -- -- S22,V-S23,V- S41,V-
S23,V-S24 S7,V-S8 S7,V-S8 S54 S54
S24 S42
V-S49,V- V-S49,V- V-S17,V-S18,V-
V-S17,V-
S50,V-S51,V- S50,V-S51,V- V-S44,V-S45,V- S19,V-S20,V-
Skilling -- S18,V-S19,V- -- -- --
S52,V-S53,V- S52,V-S53,V- S46,V-S48 S44,V-S45,V-
S20
S54 S54 S46,V-S48
V-S37,V-S38,V-
Theory -- -- V-S10 V-S10 S39,V-S40,V- -- --- --- --
S41,V-S42
Tutorial -- -- -- -- -- -- --- --- --
Thu V-
Lab -- -- -- -- -- -- --- --- S45,V-
S46
V-S9,V-S11,V- V-S9,V-S11,V- V-S21,V-
V-S5,V-S6,V- V-S5,V-S6,V- V-S21,V-S22,V-
Skilling S12,V-S25,V- S12,V-S25,V- S22,V-S23,V- --- --- --
S7,V-S8 S7,V-S8 S23,V-S24
S26 S26 S24
V-S21,V-
V-S5,V-S6,V-
Theory S22,V-S23,V- V-S40 -- V-S1 V-S1 --- --- --
S7,V-S8
S24,V-S40
Tutorial -- -- -- -- -- -- --- --- --
V-
Lab -- -- -- -- -- -- --- --- S47,V-
Fri S48
V-S2,V-S3,V-
V-S9,V- V-S9,V- V-S13,V-S14,V- S4,V-S17,V- V-S2,V-S3,V-
S10,V-S11,V- S10,V-S11,V- V-S13,V- S15,V-S16,V- S18,V-S19,V- S4,V-S17,V-
Skilling S12,V-S37,V- S12,V-S37,V- S14,V-S15,V- S49,V-S50,V- S20,V-S25,V- S18,V-S19,V- --- --- --
S38,V-S39,V- S38,V-S39,V- S16 S51,V-S52,V- S26,V-S49,V- S20,V-S25,V-
S41,V-S42 S41,V-S42 S53,V-S54 S50,V-S51,V- S26
S52,V-S53,V-S54
V-S17,V-
Theory -- -- S18,V-S19,V- -- -- -- --- --- --
S20
Tutorial -- -- -- -- -- -- --- --- --
V-
Sat Lab -- -- -- -- -- -- --- --- S43,V-
S44
V-S1,V-S2,V- V-S1,V-S2,V- V-S43,V-
V-S43,V-S44,V- V-S13,V-
S3,V-S4,V- S3,V-S4,V- S44,V-S45,V- V-S13,V-S14,V-
Skilling S45,V-S46,V- S14,V-S15,V- --- --- --
S21,V-S22,V- S21,V-S22,V- S46,V-S47,V- S15,V-S16
S47,V-S48 S16
S23,V-S24 S23,V-S24 S48
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:

about:blank 20/24
1/24/23, 9:23 PM about:blank
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.
S.no Advanced Topics, Additional Reading, Research papers and any CO ALM References/MOOCS

EVALUATION PLAN:

Evaluation Type Evaluation Component Weightage/Marks Assessment Dates Duration (Hours) CO1 CO2 CO3 CO4 CO5
Weightage 8 8
Skill Sem-End Exam 100
Max Marks 50 50
End Semester
Summative Weightage 24 6 6 6 6
End Semester Exam 180
Evaluation Max Marks 100 25 25 25 25
Total= 40 % Weightage 8 8
Lab End Semester Exam 100
Max Marks 50 50
Weightage 4 1 1 1 1
Ratings on Global Platforms 100
Max Marks 50 12.5 12.5 12.5 12.5
Weightage 4 0.8 0.8 0.8 0.8 0.8
Skilling Continuous Evaluation 100
Max Marks 50 10 10 10 10 10
In Semester
Formative Weightage 8 2 2 2 2
ALM 100
Evaluation Max Marks 50 12.5 12.5 12.5 12.5
Total= 26 % Weightage 4 1 1 1 1
Home Assignment and Textbook 100
Max Marks 50 12.5 12.5 12.5 12.5
Weightage 6 6
Continuous Evaluation - Lab Exercise 100
Max Marks 50 50
Weightage 12 6 6
Semester in Exam-I 90
Max Marks 50 25 25
Weightage 12 6 6
In Semester Semester in Exam-II 90
Summative Max Marks 50 25 25
Evaluation Weightage 5 5
Total= 34 % Lab In Semester Exam 100
Max Marks 50 50
Weightage 5 1 1 1 1 1
Skill In-Sem Exam 100
Max Marks 50 10 10 10 10 10

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
Delivery Chamber Chamber
Sections of Chamber Consultation Signature of
Name of Faculty Component of Consultation Day Consultation Room
Faculty Timings for each day Course faculty:
Faculty (s) No:
47-MA,53-
SHAIK RAZIA L - - - -
MA
47-MA,53-
SHAIK RAZIA P - - - -
MA
47-MA,53-
SHAIK RAZIA S - - - -
MA

about:blank 21/24
1/24/23, 9:23 PM about:blank

HARITHA
L 1-MA - - - -
DONAVALLI
PAVAN KUMAR
L 48-MA - - - -
Nidumolu
PAVAN KUMAR 42-MA,48-
P - - - -
Nidumolu MA
PAVAN KUMAR
S 48-MA - - - -
Nidumolu
17-MA,21-
DAMA ANAND L - - - -
MA
17-MA,21-
DAMA ANAND P - - - -
MA
17-MA,21-
DAMA ANAND S - - - -
MA
SIVA KUMAR 5-MA,49-
L - - - -
PATHURI MA
SIVA KUMAR 5-MA,49-
P - - - -
PATHURI MA
SIVA KUMAR 5-MA,49-
S - - - -
PATHURI MA
KARIMUNNISA 11-MA,46-
L - - - -
SYED MA
KARIMUNNISA 11-MA,46-
P - - - -
SYED MA
KARIMUNNISA 11-MA,46-
S - - - -
SYED MA
13-MA,43-
U HARITA L - - - -
MA
13-MA,43-
U HARITA P - - - -
MA
13-MA,43-
U HARITA S - - - -
MA
Yamini Tondepu P 1-MA - - - -
CHIRANJEEVI 14-MA,44-
L - - - -
KOTHAPALLI MA
CHIRANJEEVI 14-MA,44-
P - - - -
KOTHAPALLI MA
CHIRANJEEVI 14-MA,44-
S - - - -
KOTHAPALLI MA
Agraharam Kumar L 38-MA - - - -
Agraharam Kumar S 38-MA - - - -
25-MA,37-
Lavanya Chunduri L - - - -
MA
Lavanya Chunduri P 25-MA - - - -
25-MA,37-
Lavanya Chunduri S - - - -
MA
Poranki v l r n Sudha L 16-MA - - - -
16-MA,40-
Poranki v l r n Sudha P - - - -
MA
1-MA,16-
Poranki v l r n Sudha S - - - -
MA
Deepak Panda L 3-MA,9-MA - - - -
Deepak Panda P 3-MA,9-MA - - - -
Deepak Panda S 3-MA,9-MA - - - -
8-MA,52-
Bhaskar Marapelli L - - - -
MA
8-MA,38-
Bhaskar Marapelli P - - - -
MA,52-MA
8-MA,52-
Bhaskar Marapelli S - - - -
MA
4-MA,12-
Gandla Kanth L - - - -
MA
4-MA,12-
Gandla Kanth P - - - -
MA
4-MA,12-
Gandla Kanth S - - - -
MA
20-MA,24-
Bechoo Lal L - - - -
MA

about:blank 22/24
1/24/23, 9:23 PM about:blank

20-MA,24-
Bechoo Lal P - - - -
MA
20-MA,24-
Bechoo Lal S - - - -
MA
7-MA,51-
Dayanidhi Mohapatra L - - - -
MA
Dayanidhi Mohapatra P 7-MA - - - -
7-MA,51-
Dayanidhi Mohapatra S - - - -
MA
18-MA,22-
SUPRIYA MENON L - - - -
MA
18-MA,22-
SUPRIYA MENON P - - - -
MA
18-MA,22-
SUPRIYA MENON S - - - -
MA
19-MA,23-
Shankar Mitra L - - - -
MA
19-MA,23-
Shankar Mitra P - - - -
MA
19-MA,23-
Shankar Mitra S - - - -
MA
POTHULA
L 40-MA - - - -
HYMAVATHI
POTHULA
P 37-MA - - - -
HYMAVATHI
POTHULA
S 40-MA - - - -
HYMAVATHI
Miriyala
P 51-MA - - - -
Markandeyulu
Chintalapudi Anil L 10-MA - - - -
Chintalapudi Anil P 10-MA - - - -
Chintalapudi Anil S 10-MA - - - -
DINESHNATH 6-MA,50-
L - - - -
GOPINATH MA
DINESHNATH 6-MA,50-
P - - - -
GOPINATH MA
DINESHNATH 6-MA,50-
S - - - -
GOPINATH MA
42-MA,54-
Abdul Hannan L - - - -
MA
Abdul Hannan P 54-MA - - - -
42-MA,54-
Abdul Hannan S - - - -
MA
MOHD DASTAGIR L 45-MA - - - -
MOHD DASTAGIR P 45-MA - - - -
MOHD DASTAGIR S 45-MA - - - -
Hanumantha Rao
L 41-MA - - - -
Battu
Hanumantha Rao
P 41-MA - - - -
Battu
Hanumantha Rao
S 41-MA - - - -
Battu
Tanaya Ganguly L 2-MA - - - -
Tanaya Ganguly P 2-MA - - - -
Tanaya Ganguly S 2-MA - - - -
Arumalla Raju L 26-MA - - - -
Arumalla Raju P 26-MA - - - -
Arumalla Raju S 26-MA - - - -
Ushasree Linginedi L 15-MA - - - -
Ushasree Linginedi P 15-MA - - - -
Ushasree Linginedi S 15-MA - - - -
DHARMENDRA
L 39-MA - - - -
PILLI
DHARMENDRA
P 39-MA - - - -
PILLI
DHARMENDRA
S 39-MA - - - -
PILLI

about:blank 23/24
1/24/23, 9:23 PM about:blank
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.

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 24/24