Data Structure with Object oriented programming
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 Structure with Object oriented programming Syllabus — Unit-wise Content
The official GTU curriculum for Data Structure with Object oriented programming (subject code 2710314) as prescribed for IACI · Semester 1 divides the course into 8 units, covering 57 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 (2710314)Unit 1 Introduction to Data Structures
- Data types – primitive and non- primitive
- Types of Data Structures- Linear & Non Linear Data Structures
Unit 2 Linked Lists
- Singly Linked Lists
- Doubly Linked Lists
- Circular lists
- Skip Lists
- Self-Organizing Lists
- Sparse Tables
- Polynomials- Representation
- adding polynomials
- Erasing Polynomials
- Circular List Representation of polynomials
Unit 3 Stacks and Queues
- Priority Queues
- Evaluation of Expressions-Expressions
- Postfix Notation
- Infix to Postfix 04 10%
Unit 4 Recursion
- Function Calls and Recursive Implementation
- Anatomy of a Recursive Call
- Tail Recursion
- Nontail Recursion
- Indirect Recursion
- Nested Recursion
- Excessive Recursion
Unit 5 Binary Trees
- Binary Trees, and Binary Search Trees
- Implementing Binary Trees
- Searching a Binary Search Tree
- Tree Traversal- Breadth First Traversal
- Depth-First Traversal
- Stackless Depth-First Traversal
- Balancing a Tree- DSW Algorithm
- AVL Trees
- Self-Adjusting Trees- Self-Reconstructing Trees
- Polish Notation and Expression Trees
- Application: Huffman Algorithm
Unit 6 Graphs
- Graph Representation
- Graph Traversals
- Shortest Paths
- Cycle Detection
- Spanning Trees
- Connectivity in Undirected Graphs
- Connectivity in Directed Graphs
- Topological Sort
Unit 7 Sorting
- Insertion Sort
- Selection Sort
- Bubble Sort
- Comb Sort
- Decision Trees
- Shell Sort
- Heap Sort
- Radix Sort
- Counting Sort
Unit 8 Hashing
- Hash Functions-Division
- Mid-Square Function
- Radix Transformation
- universal Hash Functions
- Collision Resolution- Open Addressing
- Bucket Addressing
Study on Android App:
