Scribd
Upload
403 views2 pages

Adsa Syllabus

The document outlines the course outcomes and units of a course on advanced data structures and algorithms. The 6 units cover topics like complexity analysis, various data structures, data compression techniques, trees, hashing, and graph algorithms. Students will learn to analyze algorithm performance, apply advanced data structures to problems, use compression methods, work with different tree and hash-based structures, and analyze graph algorithms. The course aims to provide reliable methods for data storage, retrieval, and solving complex computational problems.

Uploaded by

Ayush Gour
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
403 views2 pages

Adsa Syllabus

The document outlines the course outcomes and units of a course on advanced data structures and algorithms. The 6 units cover topics like complexity analysis, various data structures, data compression techniques, trees, hashing, and graph algorithms. Students will learn to analyze algorithm performance, apply advanced data structures to problems, use compression methods, work with different tree and hash-based structures, and analyze graph algorithms. The course aims to provide reliable methods for data storage, retrieval, and solving complex computational problems.

Uploaded by

Ayush Gour
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

CSE523:ADVANCED DATA STRUCTURE AND ALGORITHMS

L:3 T:0 P:0 Credits:3

Course Outcomes: Through this course students should be able to

CO1 :: analyze the asymptotic performance of algorithms

CO2 :: apply advanced algorithms and data structures to tackle complex computational problems

CO3 :: demonstrate different data compression and memory management techniques

CO4 :: classify various forms of trees including heap and multiway trees

CO5 :: demonstrate reliable and flexible methods of data retrieval using hashing techniques

CO6 :: determine the graph algorithms and variant of lists

Unit I
Complexity Analysis and Recurrence Relations : Introduction and Need of Data Structures and
Algorithms, Time and Space Complexity of Algorithms, Asymptotic Analysis, Asymptotic Notations,
Average and Worst-Case Analysis, Amortized Complexity, Recurrence Relation for Time Complexity:
Substitution Method, Tree Method, Master Method
Unit II
Elementary to Advanced Data Structures : Multidimensional Arrays, Jagged Arrays and Pointer
Arrays, Sparse Matrices, Doubly Linked List - Doubly Header Linked Lists, Doubly Linked Circular
Lists, Doubly Circular Header Linked Lists, Operations on Doubly Linked Lists, Multi Linked Lists,
Stacks: Notations for Arithmetic Expressions - Infix, Prefix, Postfix, Analysis of Quick sort algorithm,
Queues: Array and Linked representation of Queue, Circular Queue, Double Ended Queue, Priority
Queue and various representations of Priority Queue
Unit III
Data Compression and Memory Management : Huffman Coding and Run Length Encoding,
Sequential and Non-Sequential Fit Methods, Garbage Collection, Conditions for Data Compression,
Huffman Coding, Run-Length Encoding, Ziv-Lempel Code, Memory Management-The Sequential-Fit
Methods, The Non-Sequential-Fit Methods, Garbage-Collection
Unit IV
Heaps and Multiway Trees : Basic operation on Binomial Heap, Insertion and Deletion in AVL Tree,
Insertion and Deletion in Red Black Trees, Insertion and Deletion in B Tree, B* Tree, Insertion and
deletion in B+ Tree, Basic operation on Heap, M-way Search Tree, Application of Trees and Heap
Unit V
Hashing, Rehashing And Extendible Files : Hash Functions, Collision Resolution, Rehashing - The
Cuckoo Hashing; Hash Functions For Extendible Files - Extendible Hashing, Linear Hashing; Bucket
Hashing
Unit VI
Graph Algorithm and List Variants : Sparse Tables, Graph Representation, Graph Types, Graph
Traversal, Minimum Spanning Tree, Shortest Path Algorithm, Graph Coloring Algorithm

Text Books:
1. DATA STRUCTURES AND ALGORITHMS IN C++ by ADAM DROZDEK, THOMSON
EDUCATIONAL PUBLISHING
References:
1. DATA STRUCTURES AND ALGORITHM ANALYSIS IN C by MARK ALLEN WEISS, ADDISON-
WESLEY
2. DATA STRUCTURES AND ALGORITHMS IN JAVA by MICHAEL T. GOODRICH, ROBERTO
TAMASSIA, WILEY
3. INTRODUCTION TO ALGORITHMS by THOMAS H. CORMEN, CHARLES E LEISERSON AND
RONALD L RIVEST, PRENTICE HALL

Session 2022-23 Page:1/2


Session 2022-23 Page:2/2

You might also like