UNIQUE SERIES AKTU Syllabus
BBI054

Fundamentals of Data Structures

L-T-P3-0-0 Credits3 Session2026-27 TypeTheory
Appears in 1 semester

B.Tech Bioinformatics · Sem 5 (Departmental Elective-I)

Download PDF

Syllabus

5 units · 40 lecture hours
Unit1

Unit 1: LINEAR DATA STRUCTURES

8 hrs

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.

Unit2

Unit 2: NON-LINEAR DATA STRUCTURES

8 hrs

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.

Unit3

Unit 3: SORTING METHODS

8 hrs

Sorting- Exchange sorts- Selection and Tree sorting- Insertion Sort- Heap Sort- Merge Sort- Quick Sort- Bucket Sort.

Unit4

Unit 4: GRAPH ALGORITHMS

8 hrs

Definition and Representation of graphs- Topological sort- Shortest-Path Algorithms- Network flow problems- Minimum Spanning Tree- Application of Depth-First Search.

Unit5

Unit 5: SEARCHING

8 hrs

Basic Search Techniques- Tree Searching- General Search Trees- Hashing. Dr. A.P.J. Abdul Kalam Technical University, Lucknow, Uttar Pradesh

Course Outcomes (COs)5 outcomes

After completion of the course student will be able to:

  1. CO1Explain linear data structures (Lists, Stacks, Queues) and their array and linked implementations with asymptotic runtime complexity.K2
  2. CO2Apply and implement balanced non-linear data structures (AVL, Splay, B-Trees) and priority queues to solve hierarchical data problems.K3
  3. CO3Construct and apply efficient sorting algorithms (such as Quick Sort, Merge Sort, and Heap Sort) based on time and space metrics.K3
  4. CO4Apply graph-based solutions using topological sorting, shortest-path algorithms, and minimum spanning trees for networks.K3
  5. CO5Apply advanced tree searching techniques and hashing strategies for efficient data retrieval.K3

TEXT BOOKS

  1. / REFERENCES
  2. Jeffrey Esakov, Tom Weiss, “Data Structures An Advanced Approach using C”, PHI, 1989.
  3. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Addison Wesley Publications, 2007.
  4. Aaron M. Tanenbaum, Yedidyah Langsam, Moshe J. Augensten, “Data Structures Using C”, PHI, 1990.
  5. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson Education, 10th Reprint, 2004.
  6. Jean-Paul Tremblay, Paul G. Sorenson, “An Introduction to Data Structures with Applications”, 2nd Edition, Tata McGraw-Hill Edition, 1976. Dr. A.P.J. Abdul Kalam Technical University, Lucknow, Uttar Pradesh

Official AKTU syllabus

This subject is on page 17, 18, 19 of the original AKTU PDF.

Official AKTU syllabus PDF ↗