FREE
AKTU Data Structure (BCS301) Syllabus PDF – B.Tech 2nd Year
Data Structure BCS301
All syllabus, notes, question bank & PYQ for this subject
Free
Download now
- English
- Semester 3
- 0 downloads
- 0 views
Official AKTU syllabus of Data Structure (BCS301) for B.Tech 2nd Year – 4 credits, L-T-P 3-1-0. Read the unit-wise course content, course outcomes, evaluation pattern and recommended books online, or download the PDF.
Syllabus — Data Structure
Download PDFBCS301 · 4 credits · L-T-P 3-1-0
Course Outcomes
At the end of course, the student will be able to understand
| CO1 | Explain the concepts of Abstract Data Types (ADT), algorithm analysis, asymptotic notations, and the representation of arrays and linked lists for efficient data organization. | K 2 |
| CO2 | Apply stacks, queues, and recursion techniques to solve computational problems using appropriate data structures and algorithms. | K 3 |
| CO3 | Analyze the performance of searching, hashing, and sorting algorithms based on their time and space complexities for different problem scenarios. | K 4 |
| CO4 | Analyze tree-based data structures and implement tree traversal, searching, insertion, and deletion algorithms for efficient data management. | K 4 |
| CO5 | Evaluate graph representations, graph traversal algorithms, minimum spanning tree algorithms, and shortest path algorithms to solve real-world problems efficiently | K 5 |
Course Content
L-T-P: 3-1-0
| Unit | Topic | Proposed Lecture |
|---|---|---|
| I | Introduction: Basic Terminology, Elementary Data Organization, Built in Data Types in C. Algorithm, Efficiency of an Algorithm, Time and Space Complexity, Asymptotic notations: Big Oh, Big Theta and Big Omega, Time- Space trade-off. Abstract Data Types (ADT) Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row Major Order, and Column Major Order, Derivation of Index Formulae for 1-D,2-D, 3-D and n-D Array Application of arrays, Sparse Matrices and their representations. Linked lists: Array Implementation and Pointer Implementation of Singly Linked Lists, Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Traversal, Polynomial Representation and Addition Subtraction & Multiplications of Single variable & Two variables Polynomial. | 08 |
| II | Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions, Evaluation of postfix expression, Iteration and Recursion- Principles of recursion, Tail recursion, Removal of recursion Problem solving using iteration and recursion with examples such as binary search, Fibonacci numbers, and Hanoi towers. Tradeoffs between iteration and recursion. Queues: Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array and linked implementation of queues in C, Dequeue and Priority Queue. | 08 |
| III | Searching: Concept of Searching, Sequential search, Index Sequential Search, Binary Search. Concept of Hashing & Collision resolution Techniques used in Hashing. Sorting: Insertion Sort, Selection, Bubble Sort, Quick Sort, Merge Sort, Heap Sort and Radix Sort. | 08 |
| IV | Trees: Basic terminology used with Tree, Binary Trees, Binary Tree Representation: Array Representation and Pointer (Linked List) Representation, Binary Search Tree, Strictly Binary Tree, Complete Binary Tree. A Extended Binary Trees, Tree Traversal algorithms: Inorder, Preorder and Postorder, Constructing Binary Tree from given Tree Traversal, Operation of Insertion, Deletion, Searching & Modification of data in Binary Search. Threaded Binary trees, Traversing Threaded Binary trees. Huffman coding using Binary Tree. Concept & Basic Operations for AVL Tree, B Tree & Binary Heaps | 08 |
| V | Graphs: Terminology used with Graph, Data Structure for Graph Representations: Adjacency Matrices, Adjacency List, Adjacency. Graph Traversal: Depth First Search and Breadth First Search, Connected Component, Spanning Trees, Minimum Cost Spanning Trees: Prims and Kruskal algorithm. Transitive Closure and Shortest Path algorithm: Warshal Algorithm and Dijikstra Algorithm. | 08 |
Text Books
- Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein, “Data Structures Using C and C++”, PHI Learning Private Limited, Delhi India.
- Gilberg ,Forouzan, Data Structures: A Pseudocode Approach with C 3rd edition , Cengage Learning publication.
- Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publications Pvt Ltd Delhi India.
- Lipschutz, “Data Structures” Schaum’s Outline Series, Tata McGraw-hill Education (India) Pvt. Ltd.
- Thareja, “Data Structure Using C” Oxford Higher Education.
- AK Sharma, “Data Structure Using C”, Pearson Education India.
- Rajesh K. Shukla, “Data Structure Using C and C++” Wiley Dreamtech Publication.
- Michael T. Goodrich, Roberto Tamassia, David M. Mount “Data Structures and Algorithms in C++”, Wiley India.
- P. S. Deshpandey, “C and Data structure”, Wiley Dreamtech Publication.
- R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education.
- Berztiss, AT: Data structures, Theory and Practice, Academic Press.
- Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data Structures with applications”, McGraw Hill.
- Adam Drozdek “Data Structures and Algorithm in Java”, Cengage Learning
Ratings & Reviews
No reviews yet — share your experience with this item.