Academic Rules and Regulations PVP20

Advanced Data Structures

Course Code 20CS3402 Year II Semester II

Course Outcomes
Upon successful completion of the course, the student will be able to
CO1 Understand the basic principles and operations of data structures. L2
Apply Hashing and String Matching techniques for solving problems
CO2 L3
effectively.
Apply the concepts of advanced Trees and Graphs for solving problems
CO3 L3
effectively.
Analyze the given scenario and choose appropriate Data Structure for solving
CO4 L4
problems.

Contribution of Course Outcomes towards achievement of Program Outcomes & Strength of correlations
(3:Substantial, 2: Moderate, 1:Slight)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3

CO2 2 1 1

CO3 3

CO4 2 1 1 1

104
 Academic Rules and Regulations PVP20

Syllabus
Unit Mapped CO
Contents
No.
Hashing – General Idea, Hash Function, Separate Chaining, Linear
Probing, Quadratic Probing, Double Hashing, Rehashing, Universal
I Hashing, Extendible Hashing. CO1,CO2
Skip Lists: Skip list representation, Search and Update Operations on
skip lists.
Priority Queues (Heaps) – Introduction, Binary Heaps, Basic Heap
II Operations, Binomial Heaps/Queues, Binomial Queue Structure, CO1,CO3
Binomial Queue Operations. Implementation of Binomial Heaps.
Efficient Binary Search Trees – AVL Trees, Single rotation, Double
III rotation, Splay Trees, Red-Black Trees, B-Trees: Definition of B-trees, CO1,CO3
Basic operations on B-trees, Deleting a key from a B-tree. 2-3 Trees.
The Disjoint Sets Class – Equivalence relation, Basic Data Structure,
Union and Find algorithms, Smart Union and Path compression algorithm.
IV Graphs Algorithms – Elementary Graph Operations: Topological sort,
CO1,CO3,CO4
Single Source Shortest Path Algorithms: Dijkstra‗s, Bellman-Ford, All-
Pairs Shortest Paths: Floyd-Warshall‗s Algorithm.
Network Flow Problems: A simple Maximum flow algorithm.
String Matching – The naive string-matching algorithm, The Rabin-Karp
algorithm, The Knuth-Morris-Pratt algorithm.
V Digital Search Structures – Operations on search trees: Insertion, CO1,CO2,CO4
Searching, Deletion. Binary Tries and Patricia: Binary Tries, Compressed
Binary Trie, Patricia: searching, insertion, deletion.

Learning Resources
Text Books
1. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, Fourth Edition, 2014,
Pearson.
2. Introduction to Algorithms, Thomas H Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford
Stein, Third Edition, 2009, The MIT Press.
References
1. Advanced Data Structures, Reema Thareja, S. Rama Sree, Oxford University Press, 2018.
2. Data Structures and Algorithms Made Easy by Narasimha Karumanchi, 2020, CareerMonk
Publications.
3. Advanced Data Structures, Peter Brass, Cambridge University Press, 2008.
e-Resources and other Digital Material
1. https://www.youtube.com/watch?v=T0yzrZL1py0&list=PLUl4u3cNGP61hsJNdULdudlRL493b-
XZf (MITOPENSOURCEWARE)
2. http://ocw.mit.edu/6-851S12
3. https://nptel.ac.in/courses/106/106/106106133/
4. https://www.mooc-list.com/search/node?keys=Advanced+Data+Structures
5. http://freevideolectures.com/Course/2279/Data-Structures-And-Algorithms

105