Advanced Data Structures & Algorithms
Get the full GTU study material, English & Gujarati textbook PDFs, syllabus curriculum, and solved previous year question papers.
English Book & Chapters
English Book Coming Soon
We are working hard to add this material. Stay tuned for updates!
Follow on Instagram for UpdatesGTU Previous Year Papers
Papers Coming Soon
We are working hard to add this material. Stay tuned for updates!
Follow on Instagram for UpdatesAdvanced Data Structures & Algorithms Syllabus — Unit-wise Content
The official GTU curriculum for Advanced Data Structures & Algorithms (subject code ME02095011) as prescribed for AIAD · Semester 2 divides the course into 6 units, covering 40 listed topics. The unit-wise breakdown below is read from the GTU syllabus document for this subject code, so you can check what the course actually covers before deciding which papers to attempt.
Download the official syllabus PDF (ME02095011)Unit 1 Introduction
- Design of data structure
- Analysis of data structure
- Amortized complexity
- Computational models
- Bounds of fundamental data structures
Unit 2 Balanced Search Trees
- Balanced Binary Search Trees(BSTs)
- Height-Balanced Trees
- Weight- Balanced Trees
- Randomized BSTs
- Splay Tree
- Tango Tree
- Skip lists
- Search optimality in BST, Static optimality
- Dynamic optimality
Unit 3 Heaps
- Balanced Search Trees as Heaps
- Array-based Heaps
- Heap-Ordered Trees and Half-Ordered Trees
- Leftist Heaps
- Skew Heaps
- Binomial Heaps
- Changing Keys in Heaps
- Fibonacci Heaps
- Heaps of Optimal Complexity
- Double-Ended Heap Structures and Multidimensional Heaps
Unit 4 Hash Tables
- Basic Hash Tables and Collision Resolution
- Universal Families of Hash Functions
- Perfect Hash Functions
- Hash Trees
- Extendible Hashing
- Cuckoo Hashing
Unit 5 Data Structures for Strings
- Tries and Compressed Tries
- Dictionaries Allowing Errors in Queries
- Suffix Trees
- Suffix Arrays
Unit 6 Distributed Data Structures
- Descriptions of Structures
- Distributed Hashing
- Distributed Trees
- Skip Graphs
- Making Structures Dynamic
- Making Structures Persistent