0% found this document useful (0 votes)
42 views2 pages

20CS3402

This document outlines the syllabus for an advanced data structures course. The course covers topics like hashing, priority queues, trees, graphs, and string matching. It provides learning outcomes, unit descriptions, textbook references, and online resources for each major concept.

Uploaded by

20501a05b9
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
42 views2 pages

20CS3402

This document outlines the syllabus for an advanced data structures course. The course covers topics like hashing, priority queues, trees, graphs, and string matching. It provides learning outcomes, unit descriptions, textbook references, and online resources for each major concept.

Uploaded by

20501a05b9
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ADVANCED DATA STRUCTURES

SYLLABUS
Course
20CS3402 Year: II Semester: II
Code:
Course Professional
Branch: CSE Course Type: Theory
Category: Core Course
Data Structures
(20ES1305), Object
Oriented
Credits: 3 L-T-P: 3-0-0 Prerequisites:
Programming
through C++
(20CS3302)
Continuous
Semester End
Internal 30 70 Total Marks: 100
Evaluation:
Evaluation:

COURSE OUTCOMES
Upon successful completion of the course, Student will be able to

CO1 Understand the basic principles and operations of data structures. L2


Apply Hashing, Disjoint sets and String Matching techniques for solving problems
CO2 L3
effectively.

CO3 Apply the concepts of advanced Trees and Graphs for solving problems effectively. L3

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:High, 2: Medium, 1:Low)

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

CO1 3

CO2 2 1 1 1 1 1

CO3 2 1 1 1 1 1

CO4 2 1 1 1 1
Unit Mapped
SYLLABUS CONTENTS
No. CO
Hashing – General Idea, Hash Function, Separate Chaining, Hash Tables
I without linked lists: Linear Probing, Quadratic Probing, Double Hashing,
CO1, CO2
Rehashing, Hash Tables in the Standard Library, Universal Hashing, Extendible
Hashing.

Priority Queues (Heaps) – Model, Simple implementations, Binary Heap:


Structure Property, Heap Order Property, Basic Heap Operations: insert, delete,
II Percolate down, Other Heap Operations. CO1, CO3
Binomial Queues: Binomial Queue Structure, Binomial Queue Operations,
Implementation of Binomial Queue, Priority Queues in the Standard Library.

Trees – AVL: Single Rotation, Double Rotation, B-Trees.


III Multi-way Search Trees – 2-3 Trees: Searching for an Element in a 2-3 Tree,
CO1, CO3
Inserting a New Element in a 2-3 Tree, Deleting an Element from a 2-3 Tree.
Red-Black Trees – Properties of red-black trees, Rotations, Insertion, Deletion.

Graphs Algorithms – Elementary Graph Algorithms: Topological sort, Single


IV Source Shortest Path Algorithms: Dijkstra’s, Bellman-Ford, All-Pairs Shortest CO1, CO3
Paths: Floyd-Warshall’s Algorithm.

Disjoint Sets – Equivalence relation, Basic Data Structure, Simple Union and
Find algorithms, Smart Union and Path compression algorithm. CO1, CO2,
V
String Matching – The naive string-matching algorithm, The Rabin-Karp CO4
algorithm, The Knuth-Morris-Pratt algorithm.

Learning Resources
Text Books
1. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, 4th Edition, 2014, Pearson.
2. Introduction to Algorithms, Thomas H Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford
Stein, 3rd Edition, 2009, The MIT Press.
References Text Book
1. Fundamentals of Computer Algorithms, Ellis Horowitz, SatrajSahani and Rajasekharam, 2 nd
Edition, 2009, University Press Pvt. Ltd.
2. Advanced Data Structures, Reema Thareja, S. Rama Sree, Oxford University Press, 2018.
e-Resources and other Digital Material
1. http://www.coursera.org/learn/advanced-data-structures
2. http://ocw.mit.edu/6-851S12 (MITOPENCOURSEWARE, Massachusetts Institute of Technology)
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

You might also like