Scribd
Upload
5 views1 page

Data Structure Lab Experiments Guide

The document outlines the experiments for the Data Structure Lab (BCS-351) for the academic session 2025-26, specifically for 2nd Year 3rd Semester students. It includes a list of programming tasks such as implementing various data structures (arrays, linked lists, stacks, queues, trees, graphs) and algorithms (searching, sorting, and minimum spanning tree). Each experiment is numbered and includes sections for submission dates, grades, and faculty signatures.

Uploaded by

Abhay Singh
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views1 page

Data Structure Lab Experiments Guide

The document outlines the experiments for the Data Structure Lab (BCS-351) for the academic session 2025-26, specifically for 2nd Year 3rd Semester students. It includes a list of programming tasks such as implementing various data structures (arrays, linked lists, stacks, queues, trees, graphs) and algorithms (searching, sorting, and minimum spanning tree). Each experiment is numbered and includes sections for submission dates, grades, and faculty signatures.

Uploaded by

Abhay Singh
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Department of Computer Science and Engineering

Data Structure Lab (BCS-351)


Academic Session 2025-26
2nd Year 3rd Semester
INDEX
Date of Grades /
S. No. Name of Experiments Date of Experiment Faculty Sign
Submission Remarks

Write a program to implement 1D and


1
2D arrays.

Write a program to implement singly


2
and circular linked list.

Write a program to implement doubly


3
linked list.

Write a program to perform polynomial


4
addition using linked list representation.

Write a program to implement stack


5
using array and linked list.

Write a program to implement queue


6
using array and linked list.

Write a program to implement linear


7 search, binary search, and hashing
techniques.

Write a program to implement sorting


8 algorithms: Bubble, Insertion,
Selection.

Write a program to implement sorting


9
algorithms: Merge Sort and Quick Sort.

Write a program to implement binary


10 search tree with insertion, deletion, and
traversal.

Write a program to implement heap sort


11 and demonstrate priority queue
operations.

Write a program to implement graph


12 traversal using BFS and DFS
algorithms.

Write a program to find the minimum


13 spanning tree using Kruskal’s or Prim’s
algorithm.

You might also like