Data Structure
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
Data Structure Syllabus — Unit-wise Content
The official GTU curriculum for Data Structure (subject code 3330704) as prescribed for Auto · Semester 3 divides the course into 6 units, covering 30 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 (3330704)Unit 1 Basic Concepts of Data Structures
- 1.1. Data Structure Basic Concepts
- 1.2. Types of data structures
- 1.3. Primitive and non-primitive data structures
- 1.4. Introduction to Algorithms
- 1.5. Key features of an algorithm
- 1.6. Analysis Terms (for the definitions purpose only) : a. Time Complexity b. Space Complexity c. Asymptotic Notations ,Big ‘O’, Notation , Best case Time Complexity, Average case Time Complexity, Worst case Time Complexity
- 1.7. Array : i. Row Major Arrays ii. Column Major Arrays
- 1.8. Overview of various array operations.
- 1.9. Searching an element into an array – i. Linear Search ii. Binary Search
Unit 2 Strings
- 2.2. String operations : Finding length of a string, Converting Characters of a string into upper case and lower case, Concatenation of two strings to form a new string, Appending, Reversing a string, Copying a string, Comparing strings, Insertion, Substring, Deletion
Unit 3 Stack and Queues
- 3.1. Linear and Non-Linear Data Structures
- 3.2. Stack : Array representation of Stack, PUSH POP Operations on Stack, Implementation of Stack, Application of Stack, Infix, Prefix and Postfix Forms of Expressions, Recursive Functions (factorial, greatest common divisor, Fibonacci series) Data Structures Course code : 3330704 GTU/NITTTR/Bhopal/12-13 Gujarat State 3 Unit MajorLearning Outcomes (Course Outcomes in Cognitive Domain according to NBA terminology) Topics and Sub-topics
- 3.3. Queue: Array representation of Queue, Operations on Queue, Implementation of Queue, Limitation of Single Queue
- 3.4. Concepts of Circular Queue
- 3.5. Application of queue
- 3.6. Difference circular queue and simple queue
Unit 4 Linked List
- 4.2. Revision of Structure
- 4.3. Revision of structure using pointers
- 4.4. Dynamic Memory Allocation
- 4.5. Linked list Presentation
- 4.6. Types of Linked List
- 4.7. Basic operations on singly linked list : Insertion of a new node in the beginning of the list, at the end of the list, after a given node, before a given 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
- 4.8. Concepts of circular linked list
- 4.9. Difference between circular linked list and singly linked list
- 4.10. Basic operations on Doubly linked list : Insertion of a new node in the beginning of the list, at the end of the list, after a given node, before a given node. Deleting the first and last node from a linked list, Searching a node in Linked List, Count the number of nodes in linked list
- 4.11. Applications of linked list
Unit 6 Trees 6a Define non-linear data structure
- 6.1. Non-linear data structures 6b Develop algorithms to manipulate tree
- 6.2. Binary trees : Complete Binary Tree, Basic Terms: level number, degree, in-degree and out-degree, leaf node, similar binary trees, copies of binary trees, directed edge, path, depth, General Tree, Conversion of General Tree to Binary Tree, Forest. 6c Implement various tree manipulation algorithms
- 6.3. Binary Search Tree : Insertion of a node in binary tree, Deletion of a node in binary tree, Searching a node in binary tree
- 6.4. Tree Traversal : Inorder, Preorder, Postorder 6d List applications of tree 6.5 Applications of binary tree
Study on Android App:
