Name of Program Bachelor of Technology (CSE / EP)
ECSE215L Data Structures using C++ L T p C
Owning School/Department Department of Computer Science Engineering 3 0 4
Pre-requisites/Exposure -
Course Outcomes (COs)
On completion of this course. the students will be able to:
CO I: Write recursive algorithms to handle all recursive data structures.
CO2: Choose appropriate searching and sorting techniques and apply graph algorithms for various
practical problems.
CO3: Formulate new/improved solutions for programming problems using learned data structure.
CO-PO/PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
I 2 3 4 5 6 7 8 9 10 11 12 01 02 03
co 3 2 3 2 I - -
I
co 3 ,,
.) 3 3 2 2 2 - 1 3
2
co 2 3 3 3 I I 2 1 2 3
3
1 =weakly related 2= moderately related 3=strongly related
Course Contents:
Module I: 12 lecture hours
Introduction to OOPS Concepts, handling Arrays, Tower of Hanoi; Binary search, Time Complexity,
Asymptotic Analysis, Big -Oh notation, Solving Recurrence relations. Lists and Implementations: -
Linked lists, Recursive functions on lists, Deletion, insertion, reversing, joining.
Module II: 12 lecture hours
Stacks, Queues using linked lists, handling Polynomials; Tree data structure and Implementations,
binary and complete binary trees; Tree traversals algorithms, Binary search trees, insertion and deletion.
Module III: 9 lecture hours
Sorting Algorithms: - Merge and Quick sort; AVL trees, 8-Trees. Heap Trees - Priority Queues, heap
sort.
Module IV: 09 lecture hours
Hashing: -Chained Hash Tables, Linear Probing, Double Hashing; Disjoint Set Class: -Smart Union
Algorithms, Path compression; Graph: -BFS, DFS Topological sort, Minimum spanning trees, Huffman
coding, shortest path, Tree data structure.
s'!fi{!f
Rlt�r
University, Greater Noi
�j�t Nh� U Act 24 of Govt. of Uttar Pradda
0 s �t g
, , 10, 11, Tech Zone-II
es h)
Greater Noida-201310
Studio Work/Laboratorv Experiments:
The laboratory of Data structures is designed to provide a practical exposure to the students
about the
concepts and topics taught in the classroom sessions. [Link] the learnt concepts using
help the students to have a better understanding of the s;bject.
c+ will
T€xt ks:
l. Ellis Horowitz and Sartaj sahni, Fundamentals of Data structures in c++ (2,d ed.), Universities
Press, 2008. ISBN 978-0929306377..
2. Langsem, Augenstein and Tenenbaum, Data Structures using C and C++ (2,d ed.), pearson.
2015.
ISBN e78-8 t203 I t 770..
Reference Books:
l. VAho, J. E. Hop*oft, and J. D. Ullman, Data Srructures and Algorithms (l,ted.), pearson,
2002.
ISBN 978-8178081021.
2. Aaron M. Tenenbaum, Y. Langsam and Moshe J. Augenstein, Data Structures Using C (2,d
ed.),
Pearson, 2019. ISBN 978-813170328 t..
Assessment Scheme:
Components Internal Assessment Mid Term Exam End Exam TotaI
Weightage (%) 50o/o 150/" 3SYo t00yo
raf
ett University, Greater Noida
(Eslabllshed UnderAcl24 ol Govt, of Uttar Prdesh)
Plot No's 8, 9, 10, 1'l , Tech Zone-ll
Greater Noida-201310
