Data Structure and Application
Get the full GTU study material for this subject: official syllabus, textbook links (Gujarati-medium books included where available), and 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 UpdatesData Structure and Application Syllabus — Unit-wise Content
The official GTU curriculum for Data Structure and Application (subject code 1333203) as prescribed for ICT · Semester 3 divides the course into 5 units, covering 32 listed topics. This curriculum applies from the July-2023 intake. 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 (1333203)Unit 1 Basic Concepts of Data Structures & OOP
- 1.1. Data Structure Basic Concepts
- 1.2. Types of data structures
- 1.3. Analysis Terms (for the definitions purpose only) : Time Complexity Space Complexity Asymptotic Notations, Big ‘O’, Notation , Best case Time Complexity, Average case Time Complexity, Worst case Time Complexity
- 1.4. OOPs Concepts
- 1.5. Class and Object
- 1.7. Types of methods: Instance method, Class method, static method
- 1.8. Overview of Abstract data types
- 1.9. Concept of Recursive functions
Unit 2 Stack and Queues
- 2.1. Overview of Stack
- 2.2. Operations on Stack - Push, Pop
- 2.3. Implementation of Stack using List
- 2.4. Application of Stack - Infix, Prefix and Postfix Forms of Expressions, Evaluations of postfix expression, Recursive Functions (Factorial, Fibonacci series)
- 2.5. Overview of Queue
- 2.6. Operations on Queue - Enqueue and Dequeue
- 2.7. Implementation of Queue using List
- 2.8. Limitation of Single Queue
- 2.9. Concepts of Circular Queue
- 2.10. Application of queue
- 2.11. Differentiate circular queue and simple queue Data Structure and Application Course Code: 1333203
Unit 3 Linked List
- 3.1. Overview of Linked list
- 3.2. Types of Linked List
- 3.3. 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, Deleting the first and last node from a linked list, Count the number of nodes in linked list.
- 3.4. Overview of circular linked list
- 3.5. Difference between circular linked list and singly linked list
- 3.6. Overview of doubly linked list
- 3.7. Applications of linked list
Unit 4 Searching and Sorting
- 4.1. Searching an element into List: Linear Search, Binary Search
- 4.2. Sorting Methods: Bubble Sort, Selection Sort, Quick Sort, Insertion Sort, Merge Sort
Unit 5 Trees
- 5.1. Binary trees: Complete Binary Tree, Basic Terms: level number, degree, in-degree and out-degree, leaf node
- 5.2. Binary Search Tree: Insertion of a node in binary tree, Deletion of a node in binary tree, Searching a node in binary tree.
- 5.3. Tree Traversal: Inorder, Preorder, Postorder
- 5.4. Applications of Binary tree Data Structure and Application Course Code: 1333203
Study on Android App:
