Data Structures
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 UpdatesData Structures Syllabus — Unit-wise Content
The official GTU curriculum for Data Structures (subject code DI03000021) as prescribed for Chem. Green · Semester 3 divides the course into 5 units, covering 68 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 (DI03000021)Unit 1 Basic Concepts of Data Structures
- Data Structure
- Types of data structures
- Primitive and Non- Primitive
- Linear and Non-Linear data structures
- Introduction to Algorithms
- Characteristics of an Algorithm
- Time Complexity
- Space Complexity
- Asymptotic Notations: Big Oh Notation
- Big Omega Notation
- Big Theta Notation
- Array: Array Representation
- Row Major Arrays
- Column Major Arrays
- Array operations: Insert
Unit 2 Stack and Queues
- Stack: Array representation of Stack
- PUSH - POP Operations on Stack
- Implementation of Stack
- Applications of Stack
- Prefix and Postfix Forms of Expressions with example
- Recursive Functions - Factorial
- Greatest Common Divisor
- Fibonacci series Queue: Array representation of Queue
- Insert and Delete Operations on Queue
- Implementation of Queue
- Limitation of Simple Queue
- Concepts of Circular Queue
- Applications of queue
- Differentiate simple queue and circular queue Program Name: Diploma Engineering Level: Diploma Branch: Computer Engineering / Computer Science & Engineering / Cyber System & Information Security Subject Code : DI03000021 Subject Name : Data Structures
Unit 3 Linked List
- Structure using pointer
- Dynamic Memory Allocation Linked List: Linked List representation
- Types of Linked List- Singly linked list
- Circular linked list
- Doubly linked list
- Applications of linked list Basic operations on Singly linked list: Insertion of a new node in the beginning and end of the list
- Insertion of a new node before/after a given node
- Insertion of a new node in sorted linked list
- Deleting the first and last node from a linked list
- searching a node in Linked List
- Count the number of nodes in linked list
Unit 4 Trees and Graph
- Tree: Fundamental concepts - General Tree
- Root node
- Parent node
- Leaf node
- Sub tree
- Binary tree
- Complete Binary tree
- Strict Binary tree
- Conversion of General Tree to Binary Tree
- Tree Traversal: Inorder
- Postorder Binary Search Tree (BST): Insertion
- Deletion and Searching of a node in BST
- Graph: Fundamental concepts - Vertex
- Types of Graphs: Directed Graph and Undirected Graph
- Connected Graph
- Complete Graph
- Weighted Graph
Unit 5 Sorting and Searching
- Sorting: Bubble Sort
- Selection Sort
- Insertion Sort
- Quick Sort
- Merge Sort
- Radix Sort algorithms with example
- Searching: Linear Search and Binary Search algorithms with example
- Hashing: Key, Hash table
- Hash functions: Division Method
- Mid Square Method
- Folding Method
Study on Android App:
