Data Structure Handout
Data Structure Handout
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
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.
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.
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.
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
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
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,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
about:blank 3/24
1/24/23, 9:23 PM about:blank
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,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,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
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,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
about:blank 5/24
1/24/23, 9:23 PM about:blank
SESSION NUMBER : 1
Session Outcome: 2 Students come to know asymptotic notations and complexity analysis.
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.
SESSION NUMBER : 3
SESSION NUMBER : 4
about:blank 6/24
1/24/23, 9:23 PM about:blank
SESSION NUMBER : 5
Session Outcome: 2 Students able to analyze the time complexity of quick sort
SESSION NUMBER : 6
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
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
SESSION NUMBER : 9
Session Outcome: 2 Students able to analyze the time complexity of external sorting
SESSION NUMBER : 10
Session Outcome: 1 Students come to know about singly linked list operations
SESSION NUMBER : 11
Session Outcome: 1 Students come to know about doubly linked list operations
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 NUMBER : 13
SESSION NUMBER : 14
SESSION NUMBER : 15
SESSION NUMBER : 16
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
SESSION NUMBER : 17
Session Outcome: 2 Students able to use the recursion and to know types of recursions
SESSION NUMBER : 18
Session Outcome: 1 Students able to understand the types of queues- Circular Queue
SESSION NUMBER : 19
Session Outcome: 1 Students able to understand the application of queues- Double ended queue
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 NUMBER : 21
Session Outcome: 1 Students come to know about the concept of separate chaining
SESSION NUMBER : 22
Session Outcome: 1 Students able to resolve collisions using different collision resolution techniques
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 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
SESSION NUMBER : 25
Session Outcome: 2 Students able to solve real world practical problems on expression tree
SESSION NUMBER : 26
Session Outcome: 1 Students come to know about construction of binary search tree
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 NUMBER : 28
SESSION NUMBER : 29
SESSION NUMBER : 30
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: 2 Students able to perform insert and delete operation on B tree
SESSION NUMBER : 32
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
SESSION NUMBER : 34
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
SESSION NUMBER : 36
SESSION NUMBER : 38
Session Outcome: 1 Students able to derive minimum spanning tree from a given graph.
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
about:blank 15/24
1/24/23, 9:23 PM about:blank
Tutorial
Session Topics CO-Mapping
no
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.
10 Binary search Tree a. Creation of BST b. Traversal–In-order ,Pre -order, Post-order CO5
SESSION NUMBER : 1
SESSION NUMBER : 2
SESSION NUMBER : 3
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
SESSION NUMBER : 5
Session Outcome: 1 Students will be able to apply the concepts of linked list
SESSION NUMBER : 6
SESSION NUMBER : 7
SESSION NUMBER : 8
SESSION NUMBER : 9
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
SESSION NUMBER : 11
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
3 Stack CO3
4 Graphs CO4
5 Prims CO5
SESSION NUMBER : 1
SESSION NUMBER : 2
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 NUMBER : 4
SESSION NUMBER : 5
Assignment
Week Assignment Type Topic Details co
No
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
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
All notices concerning the course will be displayed on the respective Notice Boards.
Department Of DBES-1
HEAD OF DEPARTMENT:
about:blank 24/24