UNIQUE SERIES AKTU Syllabus
BBC251BMI251

Data Structure Lab

L-T-P0-0-3 Credits2 Session2025-26 TypeLab / Practical
Appears in 2 semesters · 2 branches

BCA · Sem 2 (Lab, code BBC251) · MCA Integrated · Sem 2 (Lab, code BMI251)

Download PDF

List of Experiments / Activities

  1. 1Write a program to implement Bubble sort /Merge sort/ Insertion sort/ Selection sort/. Quick sort to sort an array of numbers.
  2. 2Write a program to implement Linear Search.
  3. 3Write a program to implement Binary Search.
  4. 4Write a program to implement Stack / Queue/ Circular Queue/ Linked List using array.
  5. 5Write a program to implement Stack using linked list.
  6. 6Write a program to perform conversion of an expression from Infix to Prefix.
  7. 7Write a program to perform conversion of an expression from Infix to Postfix.
  8. 8Write a program to implement Queue/ Circular Queue/ Linked List using dynamic memory allocation.
  9. 9Write a program to implement Binary tree.
  10. 10Write a program to implement Btree.
  11. 11Write a program to traverse a tree in preorder / inorder / post order.
  12. 12Write a program to apply Breadth First Search on a graph.
  13. 13Write a program to apply Depth First Search on a graph.
  14. 14Write a program to find shortest path of a graph.
  15. 15Write a program to implement minimum cost spanning tree.
  16. Note: The Instructor may add/delete/modify experiments, wherever he/she feels in a justified manner.
Course Outcomes (COs)4 outcomes

After completion of the course student will be able to:

  1. CO1Write and execute programs to implement various searching and sorting algorithms.K3
  2. CO2Write and execute programs to implement various operations on two-dimensional arrays.K3
  3. CO3Implement various operations of Stacks and Queues using both arrays and linked lists data structures.K3
  4. CO4Implement graph algorithm to solve the problem of minimum spanning treeK3

Official AKTU syllabus

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

Official AKTU syllabus PDF ↗