FREE
AKTU Fundamentals of Data Structures (BBI054) Syllabus PDF – B.Tech 3rd Year
Fundamentals of Data Structures BBI054
All syllabus, notes, question bank & PYQ for this subject
Free
Download now
- English
- Semester 5
- 0 downloads
- 0 views
Official AKTU syllabus of Fundamentals of Data Structures (BBI054) for B.Tech 3rd Year – 3 credits, L-T-P 3-0-0. Read the unit-wise course content, course outcomes, evaluation pattern and recommended books online, or download the PDF.
Syllabus — Fundamentals of Data Structures
Download PDFBBI054 · 3 credits · L-T-P 3-0-0
Course Outcomes
At the end of the course, the student will be able to:
| CO1 | Explain linear data structures (Lists, Stacks, Queues) and their array and linked implementations with asymptotic runtime complexity. | K2 |
| CO2 | Apply and implement balanced non-linear data structures (AVL, Splay, B-Trees) and priority queues to solve hierarchical data problems. | K3 |
| CO3 | Construct and apply efficient sorting algorithms (such as Quick Sort, Merge Sort, and Heap Sort) based on time and space metrics. | K3 |
| CO4 | Apply graph-based solutions using topological sorting, shortest-path algorithms, and minimum spanning trees for networks. | K3 |
| CO5 | Apply advanced tree searching techniques and hashing strategies for efficient data retrieval. | K3 |
Course Content
L-T-P: 3-0-0
| Unit | Topic | Proposed Lecture |
|---|---|---|
| I | LINEAR DATA STRUCTURES: Algorithm Analysis - Mathematical background, Model - Running Time Calculations - Linear Data Structure - List ADT Array and Cursor Implementations - Stack ADT - Queue ADT Array and List Implementation and Application. | 08 |
| II | NON-LINEAR DATA STRUCTURES: Trees- Binary trees - Binary Tree Representations, Tree Traversals, AVL Trees- Single and Double Rotation, Splay trees- B-Trees- Priority Queue- Binary Heap, Applications and variations of Priority Queue. | 08 |
| III | SORTING METHODS: Sorting- Exchange sorts- Selection and Tree sorting- Insertion Sort- Heap Sort- Merge Sort- Quick Sort- Bucket Sort. | 08 |
| IV | GRAPH ALGORITHMS: Definition and Representation of graphs- Topological sort- Shortest-Path Algorithms- Network flow problems- Minimum Spanning Tree- Application of Depth-First Search. | 08 |
| V | SEARCHING: Basic Search Techniques- Tree Searching- General Search Trees- Hashing. | 08 |
Text Books
- Jeffrey Esakov, Tom Weiss, “Data Structures An Advanced Approach using C”, PHI, 1989.
- Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Addison Wesley Publications, 2007.
- Aaron M. Tanenbaum, Yedidyah Langsam, Moshe J. Augensten, “Data Structures Using C”, PHI, 1990.
- Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson Education, 10th Reprint, 2004.
- Jean-Paul Tremblay, Paul G. Sorenson, “An Introduction to Data Structures with Applications”, 2nd Edition, Tata McGraw-Hill Edition, 1976.
Ratings & Reviews
No reviews yet — share your experience with this item.