Data Structures
Get the full GTU study material, English & Gujarati textbook PDFs, syllabus curriculum, and solved previous year question papers.
GTU Previous Year Papers
Data Structures Syllabus — Unit-wise Content
The official GTU curriculum for Data Structures (subject code 3130702) as prescribed for Information Technology · Semester 3 divides the course into 5 units, covering 54 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 (3130702)Unit 1 INTRODUCTION TO DATA STRUCTURE
- Data Management concepts
- Data types – primitive and non-primitive
- Performance Analysis and Measurement (Time and space analysis of algorithms-Average
- best and worst case analysis)
- Types of Data Structures- Linear & Non Linear Data Structures
Unit 2 LINEAR DATA STRUCTURE
- Array: Representation of arrays
- Applications of arrays
- sparse matrix and its representation Stack: Stack-Definitions & Concepts
- Operations On Stacks
- Applications of Stacks
- Polish Expression
- Reverse Polish Expression And Their Compilation
- Tower of Hanoi Queue: Representation Of Queue
- Operations On Queue
- Circular Queue
- Priority Queue
- Array representation of Priority Queue
- Double Ended Queue
- Applications of Queue Linked List: Singly Linked List
- Doubly Linked list
- Circular linked list
- Linked implementation of Stack
- Linked implementation of Queue
- Applications of linked list
Unit 3 NONLINEAR DATA STRUCTURE
- Tree-Definitions and Concepts
- Representation of binary tree
- Binary tree traversal (Inorder
- Threaded binary tree
- Binary search trees
- Conversion of Subject Code: 3130702 General Trees To Binary Trees
- Applications Of Trees- Some balanced tree mechanism, eg
- AVL trees
- Height Balanced
- Weight Balance
- Graph-Matrix Representation Of Graphs
- Elementary Graph operations
- (Breadth First Search
- Depth First Search
- Spanning Trees
- Shortest path
- Minimal spanning tree )
Unit 4 HASHING AND FILE STRUCTURES
- Hashing: The symbol table
- Hashing Functions
- Collision- Resolution Techniques
- File Structure: Concepts of fields
- records and files
- Indexed and Relative/Random File Organization
- Indexing structure for index files
- hashing for direct files
- Multi-Key file organization and access methods
Unit 5 Sorting & Searching
- Sorting – Bubble Sort
- Selection Sort
- Quick Sort
- Merge Sort Searching – Sequential Search and Binary Search
Study on Android App:
