Data Structures with Python
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 with Python Syllabus — Unit-wise Content
The official GTU curriculum for Data Structures with Python (subject code DI03016031) as prescribed for Biomed · Semester 3 divides the course into 6 units, covering 41 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 (DI03016031)Unit 1 Basic Concepts of Data Structures
- 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
- Best case Time
- Average case Time Complexity
- Worst case
- Time Complexity 1.4 Python Specific Data
- Tuple, Set, Dictionary 1.5 Array in Python
- import array
- import numpy
- Operations on Arrays
- Arrays vs List
Unit 2 Basics of Object-Oriented Programming
- 2.1 Oops Concepts 2.2 Class and Object 2.3 Constructors 2.4 Types of methods Instance method
- Class method
- static method 2.5 Data Encapsulation 2.6 Inheritance - single
- hybrid 2.7 Polymorphism through inheritance 2.8 Abstraction - abstract class Program Name: Engineering Level: Diploma Branch: Information Technology Course / Subject Code : DI03016031 Course / Subject Name :Data Structures with Python
Unit 3 Stack and Queues
- 3.1 Overview of Stack 3.2 Operations on Stack - Push
- Pop 3.3 Implementation of Stack using List 3.4 Application of Stack - Infix
- Prefix and Postfix Forms of Expressions
- Evaluations of postfix expression
- Recursive Functions (factorial
- Fibonacci series) 3.5 Overview of Queue 3.6 Operations on Queue - Enqueue and Dequeue 3.7 Implementation of Queue using List 3.8 Limitation of Single Queue 3.9 Concepts of Circular Queue 3.10 Application of queue 3.11 Differentiate circular queue and simple queue
Unit 4 Linked List
- 4.1 Overview of Linked list 4.2 Types of Linked List 4.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. 4.4 Overview of circular linked list 4.5 Difference between circular linked list and singly linked list 4.6 Overview of doubly linked list 4.7 Applications of linked list
Unit 5 5.1 Searching an element into List
- Linear Search
- Binary Search 5.2 Sorting Methods: Bubble Sort
- Selection Sort
- Quick Sort
- Insertion Sort
- Merge Sort Program Name: Engineering Level: Diploma Branch: Information Technology Course / Subject Code : DI03016031 Course / Subject Name :Data Structures with Python
Unit 6 6.1 Binary trees
- Complete Binary Tree
- Basic Terms: level number
- in- degree and out-degree
- leaf node 6.2 Binary Search Tree: Insertion of a node in binary tree
- Deletion of a node in binary tree
- Searching a node in binary tree 6.3 Tree Traversal : Inorder
- Postorder 6.4 Applications of binary tree
Study on Android App:
