.png)
Syllabus Content
Unit-1: Introduction to Data Structure
Data Management concepts, Data types – primitive and non-primitive, Performance Analysis and Measurement (Time and space analysis of algorithms-Average, best and worst case analysis), Types of Data Structures- Linear & Non Linear Data Structures.
Unit-2: Linear Data Structure
Array: Representation of arrays, Applications of arrays, sparse matrix and its representation Stack: Stack-Definitions & Concepts, Operations On Stacks, Applications of Stacks, Polish Expression, Reverse Polish Expression And Their Compilation, Recursion, Tower of Hanoi Queue: Representation Of Queue, Operations On Queue, Circular Queue, Priority Queue, Array representation of Priority Queue, Double Ended Queue, Applications of Queue Linked List: Singly Linked List, Doubly Linked list, Circular linked list ,Linked implementation of Stack, Linked implementation of Queue, Applications of linked list
Unit-3: Nonlinear Data Structure
Tree-Definitions and Concepts, Representation of binary tree, Binary tree traversal (Inorder, postorder, preorder), Threaded binary tree, Binary search trees, Conversion of General Trees To Binary Trees, Applications Of TreesSome balanced tree mechanism, eg. AVL trees, 2-3 trees, Height Balanced, Weight Balance, Graph-Matrix Representation Of Graphs, Elementary Graph operations,(Breadth First Search, Depth First Search, Spanning Trees, Shortest path, Minimal spanning tree )
Unit-4: Hashing And File Structures
Hashing: The symbol table, Hashing Functions, CollisionResolution Techniques
File Structure: Concepts of fields, records and files, Sequential, Indexed and Relative/Random File Organization, Indexing structure for index files, hashing for direct files, Multi-Key file organization and access methods.
Unit-5: Sorting & Searching
Sorting – Bubble Sort, Selection Sort, Quick Sort, Merge Sort Searching – Sequential Search and Binary Search
Examination Scheme (in marks)
| Theory ESE (E) | Theory PA (M) | Practical ESE Viva (V) | Practical PA (I) | Total |
|---|---|---|---|---|
| 70 | 30 | 30 | 20 | 150 |
| Notes | Download |
|---|---|
| [PDF]Data Structures (Darshan Notes) | Click Here |
| [PPT]Basic Concept of Data Structures | Click Here |
| [PPT]Strings | Click Here |
| [PPT]Stack and Queues | Click Here |
| [PPT]Linked List | Click Here |
| [PPT]Sorting and Hashing | Click Here |
| [PPT]Trees | Click Here |
Book PDF | Data Structures (3130702) | SEM 3
| Notes | Download |
|---|---|
| Data Structures (Darshan Notes) | Click Here |
| Data Structures (Technical Book) | Click Here |
| Data Structures (Algorithms) | Click Here |
IMP's and Question Banks | Data Structures (3130702) | SEM 3
| Question Banks | Download |
|---|---|
| DS Imp Questions 1 | Click Here |
| DS Imp Question 2 | Click Here |
| DS Imp Question (Solved) | Click Here |
GTU Old Papers | Data Structures (3130702) | SEM 3
| Year(Winter/Summer) | Question Paper |
|---|---|
| Winter 2021 | Click Here |
| Winter 2020 | Click Here |
| Summer 2021 | Click Here |
| Summer 2020 | Click Here |
Course Outcome
- Differentiate primitive and non primitive structures
- Design and apply appropriate data structures for solving computing problems
- Apply sorting and searching algorithms to the small and large data sets
GTU MEDIUM does not own this book/materials, neither created nor scanned. we provide the links which are already available on the internet. For any quarries, a Disclaimer is requested to kindly contact us, We assured you we will do our best. We DO NOT SUPPORT PIRACY, this copy was provided for students who are financially troubled but deserve to learn. Thank you