Data Structure Course

R18 B.
TECH CSE III YEAR
COURSE FILE
ON
DATA STRUCTURES
Course Code – CS302PC
II B.Tech I-SEMESTER
A.Y.: 2022-2023
Prepared by
Mrs.D.Rajeshwari
Assistant Professor
R18 B.TECH CSE III YEAR
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Academic Year 2022-2023

Course Title Data Structures
Course Code CS302PC
Programme B.Tech
Year & Semester II year I-semester
Branch & Section CSE-A
Regulation R18
Course Faculty Mrs. D.Rajeshwari, Assistant Professor
Index of Course File
S. No. Name of the content

1 Institute vision and mission
2 Department vision and mission /PEO
3 POs /PSOs
4 Course Syllabus with Structure
5 Course Outcomes (CO)
6 Mapping CO with PO/PSO; Course with PO/PSO with Justification
7 Academic Calendar
8 Time table - highlighting your course periods including tutorial
Lesson plan with number of hours/periods, TA/TM, Text/Reference
9
book
10 Web references
11 Lecture notes
12 List of Power point presentations / Videos
13 University Question papers
14 Internal Question papers, Key with CO and BT
15 Assignment Question papers mapped with CO and BT
Result Analysis to identify weak and advanced learners - 3 times in a
16 semester
17 Result Analysis at the end of the course
18 Remedial class for weak students - schedule and evidences
19 Advance Learners- Engagement documentation
20 CO, PO/PSO attainment sheets
Attendance register (Theory/Tutorial/Remedial) - Teacher/Course
21
delivery record; Continuous evaluation
22 Course file (Digital form)
INSTITUTE VISION AND MISSION

Vision:
To become a premier institute of academic excellence by providing the world class education
that transforms individuals into high intellectuals, by evolving them as empathetic and
responsible citizens through continuous improvement.
Mission:
IM1: To offer outcome-based education and enhancement of technical and practical skills.
IM2: To continuous assess of teaching-learning process through institute-industry
collaboration..
IM3: To be a centre of excellence for innovative and emerging fields in technology
development with state-of-art facilities to faculty and students fraternity.
IM4: To create an enterprising environment to ensure culture, ethics and social responsibility
among the stakeholders

DEPARTMENT VISION AND MISSION

Vision:
To become a prominent knowledge hub for learners, strive for educational excellence with
innovative and industrial techniques so as to meet the global needs.
Mission:
DM1 : To provide ambience that enhances innovations, problem solving skills, leadership
qualities, decision making, team-spirit and ethical responsibilities.
DM2 : To impart quality education with professional and personal ethics, so as to meet the
challenging technological needs of the industry and society.
DM3 : To provide academic infrastructure and develop linkage with the world class
organizations to strengthen industry-academia relationships for learners.
DM4 : To provide and strengthen new concepts of research in the thrust area of Computer
Science and Engineering to reach the needs of Government and Society.
PROGRAM EDUCATIONAL OBJECTIVES
PEO1: To develop trained graduates with strong academic and technical skills of modern
computer science and engineering.
PEO2: To promote trained graduates with leadership qualities and the ability to solve
real time problems using current techniques and tools in interdisciplinary
environment.
PEO3: To motivate the graduates towards lifelong learning through continuing education
and professional development.
PROGRAM SPECIFIC OUTCOMES
PSO1 : Professional Skills: To implement computer programs of varying complexity

in the areas related to Web Design, Cloud Computing, Network Security and
Artificial Intelligence.
PSO2: Problem-Solving Skills: To develop quality products using open ended

programming environment.
PROGRAMME OUTCOMES (POs)
PO1: Engineering knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization to the solution of complex engineering
problems.
PO2: Problem analysis: Identify, formulate, review research literature, and analyse complex
engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.
PO3: Design/development of solutions:Design solutions for complex engineering problems and
design system components or processes that meet the specified needs with appropriate
consideration for the public health and safety, and the cultural, societal, and environmental
considerations.
PO4: Conduct investigations of complex problems: Use research-based knowledge and research
methods including design of experiments, analysis and interpretation of data, and synthesis
of the information to provide valid conclusions.
PO5: Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modelling to complex engineering
activities with an understanding of the limitations.
PO6: The engineer and society: Apply reasoning informed by the contextual knowledge to assess
societal, health, safety, legal and cultural issues and the consequent responsibilities relevant
to the professional engineering practice.
PO7: Environment and sustainability: Understand the impact of the professional engineering
solutions in societal and environmental contexts, and 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.
PO10: Communication: Communicate effectively on complex engineering activities with the
engineering community and with society at large, such as, being able to comprehend and
write effective reports and design documentation, make effective presentations, and give and
receive clear instructions.
PO11: Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a member
and leader in a team, to manage projects and in multidisciplinary environments.
PO12: Life-long learning: Recognize the need for, and have the preparation and ability to engage
in independent and life-long learning in the broadest context of technological change.
JAWAHARLALNEHRUTECHNOLOGICALUNIVERSITYHYDERABAD
B.Tech.inCOMPUTERSCIENCEANDENGINEERING
COURSESTRUCTURE&SYLLABUS(R18)
ApplicableFrom2019-20 Admitted Batch
II YEAR I SEMESTER
Course
S.No. CourseTitle L T P Credits
Code
1 CS301ES AnalogandDigitalElectronics 3 0 0 3
2 CS302PC DataStructures 3 1 0 4
3 MA303BS ComputerOrientedStatisticalMethods 3 1 0 4
4 CS304PC ComputerOrganizationandArchitecture 3 0 0 3
5 CS305PC ObjectOrientedProgrammingusingC++ 2 0 0 2
6 CS306ES AnalogandDigitalElectronicsLab 0 0 2 1
7 CS307PC DataStructuresLab 0 0 3 1.5
8 CS308PC ITWorkshopLab 0 0 3 1.5
9 CS309PC C++ProgrammingLab 0 0 2 1
10 *MC309 GenderSensitizationLab 0 0 2 0
TotalCredits 14 2 12 21
II YEAR II SEMESTER
Course
S.No. CourseTitle L T P Credits
Code
1 CS401PC DiscreteMathematics 3 0 0 3
2 SM402MS BusinessEconomics&FinancialAnalysis 3 0 0 3
3 CS403PC OperatingSystems 3 0 0 3
4 CS404PC DatabaseManagementSystems 3 1 0 4
5 CS405PC JavaProgramming 3 1 0 4
6 CS406PC OperatingSystemsLab 0 0 3 1.5
7 CS407PC DatabaseManagementSystemsLab 0 0 3 1.5
8 CS408PC JavaProgrammingLab 0 0 2 1
9 *MC409 ConstitutionofIndia 3 0 0 0
TotalCredits 18 2 8 21
CS302ES:DATASTRUCTURES
II Year B.Tech. CSE I-Sem L T PC

3 1 0 4
Prerequisites: Acourseon“ProgrammingforProblemSolving”.
CourseObjectives:
• Exploringbasicdatastructuressuchasstacksandqueues.
• Introducesavarietyofdatastructuressuchashashtables,searchtrees,tries,heaps,graphs.
• Introducessortingandpatternmatchingalgorithms
CourseOutcomes:
• Abilitytoselectthedatastructuresthatefficientlymodeltheinformationinaproblem.
• Abilitytoassessefficiencytrade-offsamongdifferentdatastructureimplementationsor
combinations.
• Implementandknowtheapplicationofalgorithmsforsortingandpatternmatching.
• Designprogramsusingavarietyof datastructures,includinghashtables, binaryandgeneral tree
structures, search trees, tries, heaps, graphs, and AVL-trees.
UNIT-I
Introduction to Data Structures, abstract data types, Linear list – singly linked list implementation,
insertion, deletion and searching operations on linear list, Stacks-Operations, array and linked
representations of stacks, stack applications, Queues-operations, array and linked representations.
UNIT-II
Dictionaries: linear list representation, skip list representation, operations - insertion, deletion and
searching.
HashTableRepresentation:hashfunctions,collisionresolution-separatechaining,openaddressing-
linear probing, quadratic probing, double hashing, rehashing, extendible hashing.
UNIT-III
SearchTrees:BinarySearchTrees, Definition, Implementation,Operations- Searching, Insertionand
Deletion,AVLTrees,Definition,HeightofanAVLTree,Operations–Insertion,DeletionandSearching, Red –
Black, Splay Trees.
UNIT-IV
Graphs:GraphImplementationMethods.GraphTraversalMethods.
Sorting:HeapSort,ExternalSorting-Modelforexternalsorting,MergeSort.
UNIT-V
Pattern Matching and Tries: Pattern matching algorithms-Brute force, the Boyer –Moore algorithm,
the Knuth-Morris-Pratt algorithm, Standard Tries, Compressed Tries, Suffix tries.
TEXTBOOKS:
1. Fundamentalsof DataStructuresinC,2ndEdition,E.Horowitz,S.SahniandSusanAnderson Freed,
Universities Press.
2. Data Structuresusing C –A.S.Tanenbaum,Y. Langsam, andM.J.Augenstein, PHI/Pearson
Education.
REFERENCEBOOK:
1. DataStructures:AP seudocodeApproachwithC,2ndEdition,R.F.GilbergandB.A.Forouzan,
Cengage Learning.
SRI INDU INSTITUTE OF ENGINEERING AND TECHNOLOGY
Accredited by NAAC with A+ Grade, Recognized under 2(f) of UGC Act 1956
(Approved by AICTE, New Delhi and Affiliated to JNTUH, Hyderabad)
Khalsa Ibrahimpatnam, Sheriguda (V), Ibrahimpatnam (M), Ranga Reddy Dist., Telangana – 501 510
Website: https://siiet.ac.in/
COURSE OUTCOMES
Course: Data Structures (C212) Class: II – CSE-A - Section
After completing this course the student will be able to:
C212.1 Ability to decide on the data structures like stack, queues and list representation
for Real Time Systems. (Application)
C212.2 Design the programs using a variety of Data Structures such as List and Hashing
Representation. (Synthesis)
C212.3 Analyze and implement the various kinds of data structures in the trees.
(Analysis)
C212.4 To illustrate the structures by using AVL, Red and Splay Tree Representation
(Comprehension)
C212.5 To gain the knowledge on Searching, Sorting and Graphs are represented In
Memory. (Knowledge)
C212.6 To evaluate the String, Pattern Matching and Tries algorithms for information
storing and retrieval in a real time system. (Evaluation)
Mapping of course outcomes with program outcomes:

High -3 Medium -2 Low-1
PO/PSO/
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO
C212.1 2 3 1 1 - - - - - - - - 1 -
C212.2 1 3 2 - - - - - - - - - 1 -
C212.3 1 2 3 - 1 - - - - - - 2 - 2
C212.4 1 3 2 1 2 - - - - - - 2 - -
C212.5 1 2 1 - - - - - - - - 2 - -
C212.6 1 2 2 - 2 - - - - - - 2 - 2
AVG 1.1 2.5 1.6 1 0.8 - - - - - - 2 1 1
COURSE OUTCOMES
CO – PO / PSO Mapping Justification

Course: Data Structures (CS302PC) Class: II – CSE – A - Section
PROGRAMME OUTCOMES (POs):
PO1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization to the solution of complex
engineering problems.
PO2 Problem analysis: Identify, formulate, review research literature, and analyze
complex engineering problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and engineering sciences.
PO3 Design/development of solutions: Design solutions for complex engineering
problems and design system components or processes that meet the specified needs
with appropriate consideration for the public health and safety, and the cultural,
PO4 societal, and environmental considerations.
Conduct investigations of complex problems: Use research-based knowledge and research methods
including design of experiments, analysis and interpretation of data, and synthesis of the information
to provide valid conclusions.
PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modelling to complex
engineering activities with an understanding of the limitations.
PO12 Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological
change
PROGRAM SPECIFIC OUTCOMES (PSOs):
PSO1 Professional Skills: The ability to implement computer programs of varying

complexity in the areas related to web design, cloud computing and networking.
PSO2 Problem-Solving Skills: The ability to develop quality products using open ended
programming environment.
C212.1 Ability to decide on the data structures like stack, queues and list representation
for Real Time Systems. (Application)
Justification
PO1 Gain knowledge on data structures and able to choose appropriate data structure(level 2)
PO2 Identify the List representation of data structures . (Level 3)
PO3 Design the programs on stack . (Level 1)
PO4 Develop the programs on stacks, queues etc
PSO1 Discover the importance of real time systems in Data stuctures.
C212.2 Design the programs using a variety of Data Structures such as List and
Hashing Representation. (Synthesis)
Justification
PO1 Gain knowledge on Hash representation..(level 1)
PO2 Students able to analyse the performance analysis of various algorithms (Level 3)
PO3 Able to design best algorithms by finding the time and space complexities
PSO1 Discovers Time Complexity of Programs.
C212.3 Analyze and implement the various kinds of data structures in the trees.
(Analysis)
Justification
PO1 Gain knowledge on how to design programs for data structures(Level 1)
PO2 To design the programs students need to analyse the problem
PO3 Develop the programs on Trees
PO5 Develop the programs in c using turbo c editor
PS12 Ability to use these concepts in future scope. (level 2)
PSO2 Discover the Knowledge of ,Binary search trees
C212.4 To illustrate the structures by using AVL, Red and Splay Tree Representation
(Comprehension)
Justification
PO1 Gains knowledge on various searching and Tree methods
PO2 Analyze the solving of searching and Tree methods
PO3 Able to design algorithms for Tree methods
PO4 Develops programs on Red, AVL, Splay Trees.(Level 1)
PO5 Develop programs for searching and sorting methods
C212.5 To gain the knowledge on Searching, Sorting and Graphs are represented In Memory.
(Knowledge)
Justification
PO1 Gains knowledge on various searching and sorting methods
PO2 Analyse the various searching and sorting methods
PO3 develop the programs using various data structures
C212.6 To evaluate the String, Pattern Matching and Tries algorithms for information storing
and retrieval in a real time system. (Evaluation)
Justification
PO1 Gains knowledge on string pattern matching
PO2 Analyze the program before designing the program
PO3 Develop the algorithms on pattern matching
PO5 Develop programs using turbo c editor
PSO2 Discover the Knowledge of ,Tries.
Department Computer Science and Engineering

2022-23; 1st semester
Course Title DATA STRUCTURES

Course Code CS302PC
Programme B.Tech
Year & Semester II-year I-semester
Regulation R18
Course Faculty Mrs.D.RAJESHWARI, Assistant Professor , CSE
Lesson Plan
Number of
Teaching
Unit TOPIC Sessions REFERENCE
S.NO method/Aids
Planned
Introduction to Data Structures 1 Black Board T1
1.
2. abstract data types 1 Black Board T1
3. Linear list – singly linked list 1 Black Board T1
implementation,
4. Insertion operation on linear list, 1 Black Board T1
5. Tutorial 1:(Singly linked list) 1 Black Board T1
6. deletion g operation on linear list 1 Black Board T1
7. Searching operation on linear list Black Board T1
8. Stacks-Operations, 1 Black Board T1
1
9. array and linked representations 1 Black Board T1
of stacks
10. Tutorial 2:(Stack Operations) 1 Black Board T1
11. stack applications 1 Black Board T1
12. Queues-operations 1 Black Board T1
13. array representations 1 Black Board T1
14. linked representations 1 Black Board T1
15. Tutorial 3:(Queue operations) 1 Black Board T1
16. Dictionaries: linear list 1 Black Board T1
representation
17. skip list representation 1 Black Board T1
18. operations -- insertion, deletion 1 Black Board T1
19. Searching operations. 1 Black Board T1
20. Tutorial 4:(linear list 1 Black Board T1
operations)
21.
22. Hash Table Representation: 1 Black Board T1
23. hash functions 1 Black Board T1
24. Collision resolution-separate 1 Black Board T1
chaining
25. open addressing 1 Black Board T1

26. Tutorial 5:(Hash Table 1 Black Board T1
Representation)
2
27. linear probing 1 Black Board T1
28. quadratic probing 1 Black Board T1
29. double hashing 1 Black Board T1
30. rehashing 1 Black Board T1
31. Tutorial 6:(Linear 1 Black Board T1,W1
Probing,double hashing)
32. extendible hashing. 1 Black Board T1
33. Search Trees: 1 Black Board T1
34. Binary Search Trees 1 Black Board T1
35. Definition, Implementation 1 Black Board T1
36. Tutorial 7:(Binary search tree) 1 Black Board
37. Operations 1 Black Board T1
38. Searching 1 Black Board T1
39. Insertion 1 Black Board T1
40. Deletion 1 Black Board T1
41. Tutorial 8:(Searching 1 Black Board T1
operations)
42. AVL Trees 1 Black Board T1
43. Definition 1 Black Board T1
44. Height of an AVL Tree 1 Black Board T1
45. Operations 1 Black Board T1
46. Tutorial 9:(AVL tree) 1 Black Board T1
47. Insertion 1 Black Board T1
48. Deletion 1 Black Board T1
49. 3 Searching 1 Black Board T1
50. Red –Black Tree 1 Black Board T1
51. Tutorial 10: (Red-Black tree) 1 Black Board T1
52. Splay Trees. 1 Black Board T1
53. Graphs 1 Black Board T1
54. Graph Implementation Methods 1 Black Board T1
55. Adjacency Matrix 1 Black Board T1
56. Tutorial 11:(Graph 1 Black Board T1
Implementation Methods)
57. Adjacency list 1 Black Board T1
58. Graph Traversal Methods. 1 Black Board T1
59. BFS(Breadth First Search) 1 Black Board T1
60. DFS(Depth First Search) 1 Black Board T1
61. Tutorial 12:(BFS,DFS) 1 Black Board
62. Sorting 1 Black Board T1
63. 4 Heap Sort 1 Black Board T1
64. Max heap 1 Black Board T1
65. Min heap 1 Black Board T1
66. Tutorial13:(Heapsort,max 1 Black Board T1
heap&min heap)
67. External Sorting 1 Black Board T1
68. Model for external sorting 1 Black Board T1
69. Merge Sort. 1 Black Board T1
70. Pattern Matching and Tries: 1 Black Board T1
71. Tutorial14:(Externalsorting, 1 Black Board T1
Pattern matching algorithm)
72. Pattern matching algorithms- 1 Black Board T1
Brute force,
73. the Boyer –Moore algorithm 1 Black Board T1,R1
74. the Knuth-Morris-Pratt algorithm 1 Black Board T1
75. 5 Standard Tries 1 Black Board T1
76. Tutorial15 :(Boyer-Moore Black Board T1
alg,KMP Alg)
77. Compressed Tries 1 Black Board T1
78. Suffix tries. 1 Black Board T1
TEXT BOOKS:
T1-Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan Anderson Freed,
Universities Press.
T2-Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/Pearson

Education.
REFERENCE BOOKS
R1-Data Structures: A Pseudo code Approach with C, 2nd Edition, R. F. Gilberg and B.A. Forouzan,
Cengage Learning.
WEB REFERENCES
https://www.javatpoint.com/data-structure-tutorial
https://www.geeksforgeeks.org/data-structures/
https://www.hackerearth.com/practice/data-structures/advanced-data-structures/trie-keyword-tree/tutorial/
VIDEO REFERENCES
https://nptel.ac.in/courses/106102064
LECTURE NOTES
Unit 1 link:
https://drive.google.com/file/d/1xW1JnZZeo1XiZT5TRxCTt40SFW58dhrB/view?usp=sh
aring
Unit 2 link:
https://drive.google.com/file/d/1F0x0qTh7EMJCYhwtnlM-
n6IdqAAw0eeU/view?usp=sharing
Unit 3 link:
https://drive.google.com/file/d/1x-4q-7hNsWcP1iUkaC-
93UQKTNob9s76/view?usp=sharing
Unit 4 link:
https://drive.google.com/file/d/17W-RSlZHvjm6bFiJTSN6-
9KZJh3pHwhX/view?usp=sharing
Unit 5 link:
https://drive.google.com/file/d/1eCfj3WnWuNAv82zyR_6fuY-6gJ5iWGu-
/view?usp=sharing
POWER POINT PRESENTATION
PPT link:
Unit-1
https://drive.google.com/file/d/1P2OVzMI8zpO2nqeci3Ey7rOapORAb1un/view?usp=sharin
g
Unit-2
https://drive.google.com/file/d/1TAxYt5w8ITX2eMtUpHpI0e8fnMlVkJLY/view?usp=sharin
g
Unit-3
https://drive.google.com/file/d/1eemXEQgVH9X6REBv4WEaBWQECjdyf1pQ/view?usp=sh
aring
Unit-4
https://drive.google.com/file/d/1ysBCtZvObTfFJKRKgHVNSD1MGDFwDWpw/view?usp=s
haring
Code No: 153AK R18
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
B.Tech II Year I Semester Examinations, October - 2020
DATA STRUCTURES
(Common to CSE, IT) Time: 2 hours Max.
Marks: 75
Answer any five questions All questions carry equal marks
---
a) Write an algorithm of Insert and Delete operation in Singly Linked List.

b) Convert the following infix expression into postfix expression
A+B–C*D*E$F$G [7+8]
2. Explain about the various hash collision resolution techniques with an example. [15]
3. Insert the following list of elements from the AVL tree. Delete the elements 18, 2 and 30
from the AVL tree 12, 30, 36, 18, 25, 9, 4, 2, 17, 14 , 20, 47 [15]
4.a) Differentiate between BFS and DFS.

b) Explain about external sorting with an example. [7+8]
5.a) Write an algorithm of compressed Trie.
b) Explain about the Brute force algorithm with an example. [7+8]
6.a) Write a program to implement stack using linked list.

b) Explain the operations of Queue with an example. [8+7]
7. Explain about:
a) Rehashing
b) Extendible hashing. [15]
8. Write an algorithm to delete an element from the binary search tree. [15]
---ooOoo---
Code No: 153AK R18
B.Tech II Year I Semester Examinations, September - 2021

DATA STRUCTURES
(Common to CSE, IT, ITE)
Time: 3 hours Max. Marks: 75

Answer any five questions All
questions carry equal marks
---
1. a) Write an algorithm of Push and Pop operations on a stack.

b) Differentiate between stack and queue. [8+7]
2. Insert the following list of elements into the hash table by using Quadratic probing (size
of Hash table is 13) 65, 34, 79, 114, 26, 85, 55, 89, 22, 98. [15]
3. Insert the following list of elements from the Red- Black tree. Delete the elements 18,
2and 30 from the Red-Black tree 12, 30, 36, 18, 25, 9, 4, 2, 17, 14, 20, 47. [15]
4. Sort the following list of elements by using Merge sort

30, 56, 78, 99, 12, 43, 10, 24, 85 [15]
5. a) Write an algorithm of Standard Trie.

b) Explain the features that distinguish between Boyer Moore algorithm from the
conventional algorithms. [7+8]
6. a) Write an algorithm for insertion of node at last position in Linear Linked List.
b) Evaluate the following postfix expression using stack. Show each step
5 3 + 6 2 / * 3 5 * +. [7+8]
7. Write an algorithm of skip list operations insertion and deletion. [15]
8. Explain the operations of Splay tree with an example. [15]
---ooOoo---
Code No: 153AK R18
B.Tech II Year I Semester Examinations, August/September - 2022

DATA STRUCTURES
(Common to CSE, IT, ECM, CSBS, CSIT, ITE, CSE(SE), CSE(CS), CSE(AIML), CSE(DS), CSE(IOT),
CSE(N))
Time: 3 Hours Max.Marks:75

Answer any five questions All
questions carry equal marks
---
1.a) The following numbers 10, 20, 50, 30, 90, 60 (Top) are present in a stack of size 10.
Perform the following operations in sequence. pop(), push(30), push(40), pop(),
push (60), pop(), pop(), pop() What is the peek element at last? Draw and explain it.
b) Implement a queue data structure using Single Linked list. [8+7]
2.a) The Professor Lilly is very strict in class room. She never gives the attendance to those
who are coming last in her class. Write a function to help Professor to delete the last
Occurrence of a student from the list.
b) Implement a stack data structure using Single Linked list. [8+7]
3.a) Explain how Insertion, Deletion and Search is done in skip lists with example.
b) What is the expected number of probes for both successful and unsuccessful searches
in a linear probing table with load factor 0.25? [7+8]
4.a) Given the input (4371, 1323, 6173, 4199, 4344, 9679, 19891), a fixed table size of 10,
and a hash function H(X) = X mod 10, show the resulting quadratic probing hash table.
b) Outline Double Hashing with an example. [8+7]
5.a)In an initially empty AVL tree insert the following keys: DEC, JAN, APR,MAR, JUL,
AUG, OCT, FEB, NOV. Draw AVL tree after every insertion and apply rotations
where ever necessary.
b) Briefly discuss about different cases of imbalance that might be caused by a red-black
tree insertion and corresponding methods to rebalance the tree. [7+8]
6.a) Construct Splay tree with the following node values: 18, 10, 5, 28, 13, 25,
42,3,56,2,68,1,90. And perform normal splaying at nodes 1 and at node 90.
b) Explain insertion operation with following numbers into Red Black tree
45, 10, 8, 9, 34, 35, 12, 60, 90. [7+8]
7.a) Assume a list containing 4500 records is to be sorted using a computer with internal
memory capable of sorting at most 750 records at a time and input list is maintained on
a disk that has block length of 250 records. For this scenario explain how external
sorting may be performed to accomplish the task.
b) Compare BFS and DFS with suitable examples. [8+7]
8.a) Solve the Boyer-Moore algorithm for the following
Example: Text: ABCABCDABABCDABCDABDE
Pattern: ABCDABD
b) Solve the Knuth Morris-Pratt algorithm for the following
Example: Text: HEREISASIMPLEEXAMPLE
Pattern: EXAMPLE [8+7]
---oo0oo-
--
Sri Indu Institute of Engineering & Technology
Sheriguda (V), Ibrahimpatnam (M), R.R.Dist-501 510
I- Mid Examinations, JAN 2023 Set-I
IIIIII
Year &Branch: II-CSE (A,B&C) Date:23-01-2023(AN)
Subject: Data Structures Max. Marks: 10 Time: 60 MINS
Answer any TWO Questions. All Question Carry Equal Marks 2 * 5 = 10 marks
1. Define SLL and Program to perform operations of single linked list?

(C212.1)(KNOWLEDGE) 5M
2. Explain FIFO and write a program to FIFO using linkedlist?(C212.1) (COMPHENSION)
5M
3. Discuss collision Resolution techniques in hashing? Write about Dictionary Data Structure
with an example? (C212.2)(ANALYSIS) 5M
4. Define binary tree? Write its representations and mention the properties of it?
C212.3) (KNOWLEDGE) 5M
QUESTION PAPER QUESTION PAPER

MAPPING WITH BT MAPPING WITH CO
ANALYSI
S C212.3
25% 25%
KNOWLE
DGE C212.1
50% 50%
COMPRE
HENSION C212.2
25% 25%
I - Mid Examinations, JAN-2023 Set-II
Year &Branch: II-CSE(A,B&C) Date:23-01-2023(AN) IIII
Subject: Data Structures Max. Marks: 10 Time: 60 MINS
Answer any TWO Questions. All Question Carry Equal Marks 2 * 5 = 10 marks
1. Classify different types of Data Structure? Write a Program to perform operations of
single linked list? (C212.1) (ANALYSIS) 5M
2. Describe LIFO and it’s performing operations by using arrays with example program?
(C212.1) (KNOWLEDGE) 5M
3. Explain Skip list Representations and perform its operations with example?
(C212.2)(COMPREHENSION) 5M
4. Analyze AVL tree and explain the rotations performed when tree is not balanced?
(C212.3)(ANALYSIS) 5M

KNOWLE C212.3
DGE 25%
ANALYSIS 25% C212.1
50% COMPRE 50%
HENSION C212.2
25% 25%
B.TECH. II YEAR I SEM., I Mid Term Examinations, January– 2023
DATA STRUCTURES
Objective Exam
Name :_______________________________________ _Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks. Time: 20Min. Marks: 10.
I Choose the correct alternative:
1. Minimum number of fields in each node of a doubly linked list is ____ [ ]
(A) 2 (B) 3 (C) 4 (D) None of the above
2 .A linear collections of data elements where the linear node is given by means of pointer is
called? [ ]
a) Linked list b) Node list c) Primitive list d) Unordered list
3. On which principle does stack work? [ ]
A) FILO B) FIFO C) LILO D) Both a and c above
4. What is the value of the postfix expression 6 3 2 4 + – * ? [ ]
a) 1 b) 40 c) 74 d) -18
5. A normal queue, if implemented using an array of size MAX_SIZE, gets full when? [ ]
a) Rear = MAX_SIZE – 1 b) Front = (rear + 1)mod MAX_SIZE
c) Front = rear + 1 d) Rear = front
6. What is a hash table? [ ]
a) A structure that maps values to keys b) A structure that maps keys to values
c) A structure used for storage d) A structure used to implement stack and queue
7. If several elements are competing for the same bucket in the hash table, what is it called?[ ]
a) Diffusion b) Replication c) Collision d) Duplication
8. Which among the following is the best technique to handle collision? [ ]

a) Quadratic probing b) Linear probing c) Double hashing d) Separate chaining
9. Which of the following is the correct function definition for quadratic probing? [ ]
a) F(i)=i2 b) F(i)=I c) F(i)=i+1 d) F(i)=i2+1
10. What is the speciality about the inorder traversal of a binary search tree? [ ]
a) It traverses in a non increasing order b) It traverses in an increasing order
c) It traverses in a random fashion d) It traverses based on priority of the node
II. Fill in the blanks:
11. Linked list is generally considered as an example of ----------------type of memory

allocation.
12. A linear collection of data element given by mean of pointer is called --------------------
13. In a stack, if a user tries to remove an element from an empty stack it is called -------------
-----
14. A linear list of elements in which deletion can be done from one end (front) and insertion
can take place only at the other end (rear) is known as ------------------------
15. A queue follows -----------------
16. ---------------is not a theoretical problem but actually occurs in real implementations of
probing.
17. -------------------------problem occurs due to linear probing?
18. ----------------------is not a collision resolution strategy for open addressing?
19. The number of edges from the root to the node is called --------------------- of the tree.
20. ----------------------------------------------------is a full binary tree?
I- Mid Examinations, JAN-2023
Year &Branch: II CSE-A,B& C Time: 60mins
Subject: Data Structures Max marks:10 Date:23-01-2023(AN)
ANSWER KEY
Descriptive paper key link:
SET-1:
https://drive.google.com/file/d/1FON4H5pFNkXaueLmkJZifBKc5CyOr0Vp/view?usp=sharing
SET2:
https://drive.google.com/file/d/1CYcs5ZsA4Z3LjrcwW5h_uuwFO7zK25dF/view?usp=sharing
DATA STRUCTURES
OBJECTIVE KEY
I. Choose the correct alternative:

Answers:
I - Objectives
1. B
2. A
3. A
4. D
5. A
6. B
7. C
8. A
9. A
10. B
II- Fill in the blanks
1. Dynamic
2. Linked list
3. Underflow
4. Queue
5. FIFO
6. Clustering
7. Primary collision
8. Rehashing
9. Depth
10. every node is either a leaf or has two children
II- Mid Examinations, MAY-2023 Set – I
Year& Branch: II CSE (A,B,C),CS,AI&ML&IOT Date: 3-05-2023(AN)
Subject: CS302ES: Data Structures Marks: 10 Time: 60 min
Answer any TWO Questions. All Question Carry Equal Marks 2*5=10 marks
1 Define AVL tree &Summarise the AVL tree insertion, and searching operations with your
own Example. (5M)(C212.4)(Evaluation)
2 Explain in detail about Heap sort and Merge sort algorithm with example programs
(5M) (C212.4) (Comprehension)
3 Write about graph Traversal methods? (5M) (C212.5)(Knowledge)
4 Analyze the pattern matching algorithms Knuth-Morris-Pratt and boyer moore
(5M)(C212.6) (Analysis)

COMPR
KNOWL C212.6
EHENSI
EDGE 25%
ON
25%
25%
C212.4
50%
ANALYSI APPLICA
S TION C212.5
25% 25% 25%
II- Mid Examinations, MAY-2023 Set – II
Year& Branch: II CSE(A,B,C),CS,AI&ML&IOT Date:03-05-2023(AN)
Subject: CS302ES: Data Structures Marks: 10 Time: 60 min
Answer any TWO Questions. All Question Carry Equal Marks 2*5=10 marks
1 Write about Red Black tree and Splay tree with examples (5M) (C212.4) (Knowledge)
2 Classify the graph Traversal methods and its Applications with example??
(5M) (C212.5) (Application)
3 Compare the pattern matching algorithms brute force and boyar Moore algorithm
(5M)(C212.6) (Analysis)
4 Explain about Compressed Tries and Suffix tries? (5M)(C212.6) (Comprehension)

EVALUATI KNOWLE
ON DGE C212.6 C212.4
25% 25% 33% 34%
COMPRE
ANALYSIS HENSION
25% 25%
C212.5
33%
B.TECH. II YEAR I SEM., II- Mid Term Examinations, MAY– 2023
DATA STRUCTURES
Objective Exam
Name :_______________________________________ _Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks. Time: 20Min. Marks: 10.
I Choose the correct alternative:
1. The no of external nodes in a full binary tree with n internal nodes is ____ [ ]
(A) n (B) n+1 (C) 2n (D) 2n+1
2. Suppose a complete binary tree has height h>0. The minimum no.of leaf nodes possible in
term of h are? []
h h-1 h-1 h
a) 2 -1 b) 2 +1 c) 2 d) 2 +1
3. When a binary tree is converted in to an extended binary tree, all the nodes of a binary tree in
the external nodes becomes []
A) Internal nodes B) External nodes C) Root nodes D) None
4. If n numbers are to be sorted in ascending order in O(nlogn) time, which of the tree can be
used
[ ]
a) Binary tree b) Binary search tree c) Max-heap d) Min-heap
5. If every node u in G is adjacent to every other node v in G, A graph is said to be….. [ ]
a) Isolated b) Complete c) Finite d) Strongly connected
6. A Binary tree can have? [ ]
a) Can have 2 children b) Can have 1 children c) Can have 0 children d) All
7. Why to prefer red-black trees over AVL-trees? [ ]

a) Because red-black is more rigidly balanced. b) AVL tree store balance factor in
every node which cost space c) AVL tree fails at scale d) Red-Black is more
efficient
8. Which of the following special type of trie is used for fast searching of the full texts? [ ]
a) Ctrie b) Hash tree c) Suffix tree d) T tree
9. What is the number of edges present in a complete graph having n vertices? []

a) (n*(n+1))/2 b) (n*(n-1))/2 c) n d) None
10. Which of the following is the efficient data structure for searching words in dictionaries
[ ]
a) BST b) Linked list c) Balanced BST d) Trie
II. Fill in the blanks:
11. Trie is also known as -------------------------

12. A graph is said to be --------------------- if its edges are assigned data
13. A binary tree T has n-leaf nodes. The number of degree 2 in T is ------------------
14. The operation of processing each element in the list is known as------------------------
15. What is an AVL tree ---------------------------------
16. A program to search a contact from phone directory can be implemented efficiently
using----
------------------
17. What is the name of elements present in patterns------------------------------
18. In red-black tree every new node has-------------------------------color.
19. AVL stands for---------------------------------
20. Booyer-Moore pattern matching algorithm is--------------------------------------.
II- Mid Examinations, MAY-2023
Year &Branch: II CSE-A,B& C Time:60mins
Subject: Data Structures Max marks:10 Date: 03-05-2023(AN)
ANSWER KEY
Descriptive paper key link:
SET-1
https://drive.google.com/file/d/1JpmxX_SkdA07_A2DASv8StPN4w65d3Rc/view?usp=sharing
SET-2
https://drive.google.com/file/d/10c_9HjwZ4A8CgbhHNTmpCXHD1-56mhNR/view?usp=sharing
DATA STRUCTURES
OBJECTIVE KEY
I - Objectives
11. B
12. C
13. A
14. D
15. B
16. D
17. B
18. C
19. B
20. D
II- Fill in the blanks
11. Digital tree

12. Labeled
13. (n-1)
14. Traversal
15. Height balanced tree
16. Trie
17. Pattern variables
18. Red
19. Adelson Velski Lendiss
20. Backward chaining algorithm
ASSIGNMENT- 1 SUBJECT: Data Structures
1. Classify different types of Data Structure? Write a Program to perform operations of

single linked list? (C212.1) (ANALYSIS)
2. Describe LIFO (Stack) and its performing operations by using arrays with example
program? (C212.1) (Knowledge)
3. Explain Skip list Representations and perform its operations with example?
(C212.2)(Comprehension)
4. Explain FIFO (Queue) and write a program to FIFO using arrays? (C212.1)(
Comprehension)
5. Discuss collision Resolution techniques in hashing? Write about Dictionary Data
Structure with an example? (C212.1) (ANALYSIS)
SUBJECT: Data Structures
ASSIGNMENT- 1 KEY LINK :
https://drive.google.com/file/d/10Ucb84WQO8MvdKomygSNfpa4If_y5PCL/view?us
p=sharing
ASSIGNMENT- 2 SUBJECTS: WEB TECHNOLOGIES
1. Define AVL tree &Summarise the AVL tree insertion, and searching operations with your
own Example. (C212.4)(Evaluation)
2. Explain in detail about Heap sort and Merge sort algorithm with example programs?
(C212.4) (Comprehension)
3. Write about graph Traversal methods and applications? (C212.5) (Application)
4. a) Analyze the pattern matching algorithms brute force, Knuth-Morris-Pratt and Boyer-
Moore? (C212.6) (Analysis)
b) Explain about Compressed Tries and Suffix tries? (C212.6) (Comprehension)
5. Write about Red Black tree and Splay tree with examples? (C212.4) (Knowledge)
SUBJECT: WEB TECHNOLOGIES
ASSIGNMENT- 2 KEY LINK
https://drive.google.com/file/d/1qdH-4MYKKx2tIOsG_8axiawNJxY-
jbdg/view?usp=sharing
Course Title DATA STRUCTURES

Course Code CS302ES
Programme B.Tech
Year & Semester II Year I-Semester, CSE-A& AI&ML
Regulation R18
Course Faculty Mrs,Rajeshwari D, Assistant Professor , CSE
Weak Students:
S No Roll no No of backlogs Internal-I Status Internal-II Status

1 21X31A0507 4 16 17
2 21X31A0510 5 15 16
3 21X31A0512 5 15 15
4 21X31A0531 4 14 16
5 21X31A0535 4 14 14
6 21X31A0539 5 15 17
7 21X31A0544 4 15 16
8 21X31A0546 4 15 16
Advanced learners:
S No Roll No (SGPA) Gate Material
1 21X31A0504 8.047
2 21X31A0506 8.19
21X31A0525
Abstract Data Types, Stack,
3 8.14
Queue, AVL Trees, Red-Black
4 21X31A0534 8.23 tree, Binary Search tree, Graphs,
5 21X31A0540 8.04 Tries
6 21X31A0550 8.07
BATCH CSE-II BTECH I SEM CSE-A RESULT ANALYSIS
NUMBER OF QUESTION PAPER

ACADAMIC COURSE STUDENTS SETTING PASS%
YEAR NAME
APPEARED PASSED INTERNAL EXTERNAL
2022-23 Data Structures 70 58 COURSE JNTUH 82%

FACULTY
80
70
60
50
APPEARED
40
PASSED
30
20
10
0
Department of Computer science and Engineering
Course Outcome Attainment (Internal Examination-1)

Name of the faculty : Mrs. Rajeshwari D Academic Year: 2022-23
Branch & Section: CSE -A Examination: I Internal
Course Name: Data Structures Year: II Semester: I
S.No HT No. Q1a Q1b Q1c Q2a Q2b Q2c Q3a Q3b Q3c Q4a Q4b Q4c Obj1 A1
Max. Marks ==> 10 5
1 21X31A0501 5 2 9 5
2 21X31A0502 5 5 10 5
3 21X31A0503 2 4 8 5
4 21X31A0504 5 3 9 5
5 21X31A0505 2 5 9 5
6 21X31A0506 5 5 10 5
7 21X31A0507 1 2 8 5
8 21X31A0508 2 5 9 5
9 21X31A0509 5 4 10 5
10 21X31A0510 1 9 5
11 21X31A0511 2 5 9 5
12 21X31A0512 2 8 5
13 21X31A0513 3 5 9 5
14 21X31A0514 3 4 9 5
15 21X31A0515 2 5 9 5
16 21X31A0516 2 9 5
17 21X31A0517 2 4 8 5
18 21X31A0518 2 3 9 5
19 21X31A0519 1 3 9 5
20 21X31A0520 2 4 9 5
21 21X31A0521 2 5 10 5
22 21X31A0522 3 3 9 5
23 21X31A0523 5 4 10 5
24 21X31A0524 3 4 9 5
25 21X31A0525 5 5 10 5
26 21X31A0526 2 5 10 5
27 21X31A0527 2 4 9 5
28 21X31A0528 1 2 8 5
29 21X31A0529 1 5 9 5
30 21X31A0530 4 3 9 5
31 21X31A0531 1 8 5
32 21X31A0532 2 3 9 5
33 21X31A0533 5 5 10 5
34 21X31A0534 5 5 10 5
35 21X31A0535 1 8 5
36 21X31A0536 1 2 9 5
37 21X31A0537 2 4 9 5
38 21X31A0538 3 5 8 5
39 21X31A0539 4 8 5
40 21X31A0540 5 5 10 5
41 21X31A0541 2 4 9 5
42 21X31A0542 3 3 9 5
43 21X31A0543 3 4 8 5
44 21X31A0544 0 4 8 5
45 21X31A0545 5 2 9 5
46 21X31A0546 2 1 8 5
47 21X31A0547 1 8 5
48 21X31A0548 2 5 9 5
49 21X31A0549 1 4 8 5
50 21X31A0550 1 3 7 5
52 21X31A0552 1 4 7 5
53 21X31A0554 4 5 10 5
54 21X31A0555 2 4 9 5
55 21X31A0556 2 5 9 5
56 21X31A0557 4 5 10 5
57 21X31A0559 3 3 9 5
58 21X31A0560 5 4 10 5
59 21X31A0561 2 3 8 5
60 21X31A0562 3 3 9 5
61 21X31A0563 3 5 9 5
62 21X31A0564 4 5 9 5
63 21X31A0565 3 5 9 5
64 22X35A0501 3 5 9 5
65 22X35A0502 4 2 9 5
66 22X35A0503 2 3 7 5
67 22X35A0504 2 2 7 5
68 22X35A0505 4 4 10 5
69 22X35A0506 2 3 9 5
70 22X35A0507 2 3 9 5
71 22X35A0508 2 4 9 5
Target set by the 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 6.00 3.00
faculty / HoD
Number of students
performed above the 27 0 0 40 1 0 64 0 0 1 0 0 70 70
target
Number of students 27 0 0 40 1 0 64 0 0 1 0 0 70 70
attempted
Percentage of students
scored more than 100% 100% 100% 100% 100% 100% 100%
target
CO Mapping with Exam Questions:
CO - 1 y y y y
CO - 2 y y y
CO - 3 y y y
CO - 4 y y
CO - 5
CO - 6
CO Attainment based on Exam Questions:

CO - 1 100% 100% 100% 100%
CO - 2 100% 100% 100%
CO - 3 100% 100% 100%
CO - 4 100% 100%
CO - 5
CO - 6
CO Subj obj Asgn Overall Level Attainment Level

CO-1 100% 100% 100% 100% 3.00 1 40%
CO-2 100% 100% 100% 100% 3.00 2 50%
CO-3 100% 100% 100% 100% 3.00 3 60%
CO-4 100% 100% 100% 3.00
CO-5
CO-6
Attainment (Internal 1 Examination) = 3.00
Course Outcome Attainment (Internal Examination-2)
Name of the faculty Mrs.

: Rajeshwari D Academic Year: 2022-23
Branch & Section: CSE -A Examination: II Internal
Course Name: Data Structures Year: II Semester: I
S.No HT No. Q1a Q1b Q1c Q2a Q2b Q2c Q3a Q3b Q3c Q4a Q4b Q4c Obj2 A2
Max. Marks ==> 5 5 5 5 10 5
1 21X31A0501 5 3 8 5
2 21X31A0502 2 5 9 5
3 21X31A0503 2 3 8 5
4 21X31A0504 3 5 8 5
5 21X31A0505 5 2 7 5
6 21X31A0506 5 5 9 5
7 21X31A0507 4 2 7 5
8 21X31A0508 5 7 5
9 21X31A0509 5 4 8 5
10 21X31A0510 2 9 5
11 21X31A0511 5 2 9 5
12 21X31A0512 1 1 8 5
13 21X31A0513 5 5 9 5
14 21X31A0514 3 5 8 5
15 21X31A0515 5 5 8 5
16 21X31A0516 4 5 5
17 21X31A0517 5 7 5
18 21X31A0518 5 4 8 5
19 21X31A0519 2 5 7 5
20 21X31A0520 4 5 8 5
21 21X31A0521 9 5
22 21X31A0522 4 4 8 5
23 21X31A0523 5 3 9 5
24 21X31A0524 5 5 9 5
25 21X31A0525 5 5 9 5
26 21X31A0526 5 5 8 5
27 21X31A0527 3 5 8 5
28 21X31A0528 1 8 5
29 21X31A0529 2 5 7 5
30 21X31A0530 4 3 7 5
31 21X31A0531 1 8 5
32 21X31A0532 1 3 7 5
33 21X31A0533 5 5 9 5
34 21X31A0534 5 5 9 5
35 21X31A0535 9 5
36 21X31A0536 3 1 6 5
37 21X31A0537 5 3 7 5
38 21X31A0538 5 5 9 5
39 21X31A0539 3 3 6 5
40 21X31A0540 5 5 9 5
41 21X31A0541 4 3 7 5
42 21X31A0542 5 3 7 5
43 21X31A0543 4 4 8 5
44 21X31A0544 1 8 5
45 21X31A0545 5 5 9 5
46 21X31A0546 2 8 5
47 21X31A0547 9 5
48 21X31A0548 4 5 8 5
49 21X31A0549 3 1 7 5
50 21X31A0550 3 2 8 5
51 21X31A0552 2 2 7 5
52 21X31A0554 5 5 9 5
53 21X31A0555 3 2 8 5
54 21X31A0556 4 7 5
55 21X31A0557 5 5 9 5
56 21X31A0559 1 3 7 5
57 21X31A0560 5 5 9 5
58 21X31A0561 3 2 7 5
59 21X31A0562 5 3 7 5
60 21X31A0563 4 5 8 5
61 21X31A0564 5 5 9 5
62 21X31A0565 3 4 7 5
62 22X35A0501 1 5 7 5
62 22X35A0502 5 4 7 5
62 22X35A0503 5 1 7 5
62 22X35A0504 3 4 7 5
62 22X35A0505 5 4 9 5
62 22X35A0506 5 3 8 5
62 22X35A0507 4 1 7 5
62 22X35A0508 5 3 8 5
Target set by the 3.00 0.00 0.00 3.00 0.00 0.00 3.00 0.00 0.00 3.00 0.00 0.00 6.00 3.00
faculty / HoD
performed above the
target
attempted
Percentage of
students scored 93% 56% 74% 82% 99% 100%
more than target
CO Mapping with Exam Questions:
CO - 1
CO - 2
CO - 3
CO - 4 y y y
CO - 5 y y y
CO - 6 y y y y
CO Attainment based on Exam Questions:

CO - 1
CO - 2
CO - 3
CO - 4 93% 99% 100%
CO - 5 56% 99% 100%
CO - 6 74% 82% 99% 100%
CO Subj obj Asgn Overall Level Attainment Level

CO-1 1 40%
CO-2 2 50%
CO-3 3 60%
CO-4 93% 99% 100% 97% 3.00
CO-5 56% 99% 100% 85% 3.00
CO-6 78% 99% 100% 92% 3.00
Attainment (Internal Examination-2) = 3.00
Course Outcome Attainment (University Examinations)
Name of the faculty : Mrs. Rajeshwari D Academic Year: 2022-23
Branch & Section: CSE -A Year / Semester: II / I
Course Name: Data Structures
S.No Roll Number Marks Secured S.No Roll Number Marks Secured
1 21X31A0501 36 36 21X31A0536 32
2 21X31A0502 47 37 21X31A0537 26
3 21X31A0503 35 38 21X31A0538 29
4 21X31A0504 43 39 21X31A0539 6
5 21X31A0505 27 40 21X31A0540 43
6 21X31A0506 48 41 21X31A0541 26
7 21X31A0507 33 42 21X31A0542 40
8 21X31A0508 26 43 21X31A0543 39
9 21X31A0509 44 44 21X31A0544 6
10 21X31A0510 17 45 21X31A0545 40
11 21X31A0511 40 46 21X31A0546 7
12 21X31A0512 15 47 21X31A0547 32
13 21X31A0513 33 48 21X31A0548 33
14 21X31A0514 32 49 21X31A0549 28
15 21X31A0515 26 50 21X31A0550 73
16 21X31A0516 11 51 21X31A0552 16
17 21X31A0517 36 52 21X31A0554 44
18 21X31A0518 26 53 21X31A0555 69
19 21X31A0519 27 54 21X31A0556 37
20 21X31A0520 27 55 21X31A0557 26
21 21X31A0521 26 56 21X31A0559 26
22 21X31A0522 26 57 21X31A0560 41
23 21X31A0523 33 58 21X31A0561 26
24 21X31A0524 28 59 21X31A0562 26
25 21X31A0525 44 60 21X31A0563 74
26 21X31A0526 70 61 21X31A0564 32
27 21X31A0527 35 62 21X31A0565 28
28 21X31A0528 26 63 22X35A0501 30
29 21X31A0529 38 64 22X35A0502 31
30 21X31A0530 27 65 22X35A0503 26
31 21X31A0531 2 66 22X35A0504 10
32 21X31A0532 26 67 22X35A0505 26
33 21X31A0533 42 68 22X35A0506 10
34 21X31A0534 47 69 22X35A0507 2
35 21X31A0535 1 70 22X35A0508 70
Max Marks 75
Class Average mark 32 Attainment Level % students
Number of students performed above the target 33 1 40%
Number of successful students 70 2 50%
Percentage of students scored more than target 47% 3 60%
Attainment level 1
Course Outcome Attainment
Name of the faculty :Mrs. Rajeshwari D Academic Year: 2022-23

Branch & Section: CSE -A Examination: I Internal
Course Name: Data Structures Year: II
Semester: I
1st
Course Outcomes Internal 2nd Internal Internal
Exam Exam Exam University Exam Attainment Level
CO1 3.00 3.00 1.00

1.50
CO2 3.00 3.00 1.00
1.50
CO3 3.00 3.00 1.00

1.50
CO4 3.00 3.00 3.00 1.00
1.50
CO5 3.00 3.00 1.00
1.50
CO6 3.00 3.00 1.00
1.50
Internal & University Attainment: 3.00 1.00
Weightage 25% 0.75
CO Attainment for the course (Internal, University) 0.75 0.75

CO Attainment for the course (Direct Method) 1.50
Overall course attainment level 1.50

SRI INDU INSTITUTE OF ENGINEERING & TECHNOLOGY
Department of Electronics and Communication Engineering
Program Outcome Attainment (from Course)
Name of Faculty: Rajeshwari D Academic Year: 2022-23

Branch & Section: CSE -A Year: II
Course Name: Data Structures Semester: I
CO-PO mapping
CO1 2 3 1 1 - - - - - - - - 1 -
CO2 1 3 2 - - - - - - - - - 1 -
CO3 1 2 3 - 1 - - - - - - 2 - 2
CO4 1 3 2 1 2 - - - - - - 2 - -
CO5 1 2 1 - - - - - - - - 2 - -
CO6 1 2 2 - 2 - - - - - - 2 - 2
Course 1.1 2.5 1.6 1 0.8 - - - - - - 2 1 1
CO Course Outcome Attainment

1.50
CO1
1.50
CO2
1.50
CO3
1.50
CO4
1.50
CO5
CO6 1.50
Overall course attainment level 1.50
PO-ATTAINMENT
CO
Attainm
ent 0.55 1.25 0.80 0.50 0.40 1.00 0.50 0.50
CO contribution to PO - 33%, 67%, 100% (Level 1/2/3)

Attendance Register Link:
https://drive.google.com/file/d/1kGJY8IgjhF5pGZ-
7OaTE_MvbXTe3aWC7/view?usp=sharing

Data Structure Course

Uploaded by

Data Structure Course

Uploaded by

R18 B.

TECH CSE III YEAR

Course Code – CS302PC

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Academic Year 2022-2023

S. No. Name of the content

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

INSTITUTE VISION AND MISSION

IM2: To continuous assess of teaching-learning process through institute-industry

IM3: To be a centre of excellence for innovative and emerging fields in technology

development with state-of-art facilities to faculty and students fraternity.

among the stakeholders

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

DEPARTMENT VISION AND MISSION

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

PROGRAM EDUCATIONAL OBJECTIVES

PROGRAM SPECIFIC OUTCOMES

PSO1 : Professional Skills: To implement computer programs of varying complexity

PSO2: Problem-Solving Skills: To develop quality products using open ended

PROGRAMME OUTCOMES (POs)

PO1: Engineering knowledge: Apply the knowledge of mathematics, science, engineering

II Year B.Tech. CSE I-Sem L T PC

Course: Data Structures (C212) Class: II – CSE-A - Section

After completing this course the student will be able to:

Mapping of course outcomes with program outcomes:

CO – PO / PSO Mapping Justification

PROGRAMME OUTCOMES (POs):

PO1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering

PROGRAM SPECIFIC OUTCOMES (PSOs):

PSO1 Professional Skills: The ability to implement computer programs of varying

Department Computer Science and Engineering

Course Title DATA STRUCTURES

25. open addressing 1 Black Board T1

T2-Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/Pearson

POWER POINT PRESENTATION

a) Write an algorithm of Insert and Delete operation in Singly Linked List.

4.a) Differentiate between BFS and DFS.

6.a) Write a program to implement stack using linked list.

B.Tech II Year I Semester Examinations, September - 2021

Time: 3 hours Max. Marks: 75

1. a) Write an algorithm of Push and Pop operations on a stack.

4. Sort the following list of elements by using Merge sort

5. a) Write an algorithm of Standard Trie.

7. Write an algorithm of skip list operations insertion and deletion. [15]

8. Explain the operations of Splay tree with an example. [15]

B.Tech II Year I Semester Examinations, August/September - 2022

Time: 3 Hours Max.Marks:75

1. Define SLL and Program to perform operations of single linked list?

QUESTION PAPER QUESTION PAPER

QUESTION PAPER QUESTION PAPER

8. Which among the following is the best technique to handle collision? [ ]

11. Linked list is generally considered as an example of ----------------type of memory

Descriptive paper key link:

I. Choose the correct alternative:

II- Fill in the blanks

QUESTION PAPER QUESTION PAPER

QUESTION PAPER QUESTION PAPER

7. Why to prefer red-black trees over AVL-trees? [ ]

9. What is the number of edges present in a complete graph having n vertices? []

11. Trie is also known as -------------------------

Descriptive paper key link:

II- Fill in the blanks

11. Digital tree

ASSIGNMENT- 1 SUBJECT: Data Structures

1. Classify different types of Data Structure? Write a Program to perform operations of

SUBJECT: Data Structures

ASSIGNMENT- 1 KEY LINK :

ASSIGNMENT- 2 SUBJECTS: WEB TECHNOLOGIES

SUBJECT: WEB TECHNOLOGIES

ASSIGNMENT- 2 KEY LINK

Course Title DATA STRUCTURES

S No Roll no No of backlogs Internal-I Status Internal-II Status

S No Roll No (SGPA) Gate Material

BATCH CSE-II BTECH I SEM CSE-A RESULT ANALYSIS

NUMBER OF QUESTION PAPER

2022-23 Data Structures 70 58 COURSE JNTUH 82%