3130702,Data Structures(DS) for GTU 18 Course SEM-III Information Technology Engineering Technical Publications By A. A. Puntambekar As Per Revised Syllabus of Gujarat Technological University (GTU) Download The book of Data Structures(DS) and Syllabus of This Book is HERE.
Syllabus:-
| Sr. No | Topics | Teaching Hrs. | Module Weightage |
|---|---|---|---|
| 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. |
04 | 10 |
| 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 |
13 | 30 |
| 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 Trees-Some 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 ) |
13 | 30 |
| 4 | HASHING AND FILE STRUCTURES : Hashing: The symbol table, Hashing Functions, Collision- Resolution 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. |
06 | 15 |
| 5 | Sorting & Searching: Sorting – Bubble Sort, Selection Sort, Quick Sort, Merge Sort Searching – Sequential Search and Binary Search |
06 | 15 |
Suggested Specification table with Marks (Theory):
| Distribution of Theory Marks |
| R Level | U Level | A Level | N Level | E Level | C Level |
|---|---|---|---|---|---|
| 10% | 10% | 10% | 10% | 10% | row1 col 6 |
Legends: R: Remembrance; U: Understanding; A: Application, N: Analyze and E: Evaluate C: Create and above Levels (Revised Bloom’s Taxonomy)
Course Outcomes:
| Sr. No. | CO Statement | Marks % weightage |
|---|---|---|
| CO-1 | Define and classify various data structures, storage structures and common operations on them | 10 |
| CO-2 | Create various linear data structures with their representation and perform different operations on them | 20 |
| CO-3 | Create various nonlinear data structures with their representation and perform different operations on them | 20 |
| CO-4 | Apply various searching sorting techniques on data set | 30 |
| CO-5 | Solve the given a problem using an appropriate data structure to achieve optimal performance and compare its performance with other possible data structures | 2 |
Click on Download Button After Time is Over
The importance of Data Structures is well known in various engineering fields. Overwhelming response to my books on various subjects inspired me to write this book. The book is structured to cover the key aspects of the subject Data Structures.
The book uses plain, lucid language to explain fundamentals of this subject. The book provides logical method of explaining various complicated concepts and stepwise methods to explain the important topics. Each chapter is well supported with necessary Illustrations, practical examples and solved problems. All the chapters in the book are arranged in a proper sequence that permits each topic to build upon earlier studies. All care has been taken to make students comfortable in understanding the basic concepts of the subject.
Representative questions have been added at the end of each section to help the students in picking Important points from that section.
The book not only covers the entire scope of the subject but explains the philosophy of the subject. This makes the understanding of this subject more clear and makes it more interesting. The book will be very useful not only to the students but also to the subject teachers. The students have to omit nothing and possibly have to cover nothing more.
I wish to express my profound thanks to all those who helped in making this book a reality. Much needed moral support and encouragement is provided on numerous occasions by my whole family. I wish to thank the Publisher and the entire team of Technical Publications who have taken immense pain to get this book in time with quality printing.
Any suggestion for the improvement of the book will be acknowledged and well appreciated
Comments
Post a Comment