DSA · Lab manual

Lab Manual DSA

ITM SLS Baroda University, Vadodara

STUDENT LABORATORY MANUAL

For

III Semester CSE

Session: 2025-26

Data Structure & Algorithm

Subject Code: C2310C5

Prepar ed by:

Student Name

Enrolment Number and Department

Department of Computer Science & Engineering

July 2026

ITM SLS Baroda University, Vadodara

Dhanora Tank Road, Paldi Village, Halol Highway,

Near Jarod, Vadodara Dist, Gujarat, INDIA-391510

(Approved by AICTE, New Delhi)

STUDENT CERTIFICATE

This is to certify Mr.\ Miss ................................................................ student of Computer Engineering bearing Enrollment No. ............................................. has satisfactorily completed his/her term-work ................................... in Data Structure and Algorithm for term ending in.........................2025.

Date:

Place:

Signature of Faculty Signature of Faculty

(..............................................) (..............................................)

Date Date

List of Experiment

S. No.Date of ExperimentTitlePage No.GradeSignature
1July 3rd WeekWhatsApp Contact Manager Using Arrays
2August 1st WeekBrowser Back and Forward Navigation (Stack)
3August 2nd WeekRailway Reservation Waiting Queue (Queue)
4August 3rd WeekHospital Emergency Management System (Priority Queue)
5August 4th WeekMusic Playlist Manager (Singly Linked List)
6September 1st WeekMusic Playlist Manager (Doubly Linked List)
7September 2nd WeekRound Robin CPU Scheduling Simulator (Circular Linked List)
8September 3rd WeekLibrary Book Catalog (Binary Search Tree)
9September 4th WeekCity Navigation System (Graph)
10October 1st WeekOnline Shopping Product Search System (Searching & Sorting)

Marks Allocations Scheme

Practical 1 WhatsApp Contact Manager

Problem Statement

Design a WhatsApp Contact Manager that stores contact names and mobile numbers using arrays. The system should allow users to:

Add New Contact

Search for a Contact by name or mobile number

Update an existing Contact

Delete a Contact

Display all contacts

Sort contacts alphabetically

Merge contacts from another phone

Copy the contact list from destination to source

Data Structure: Array

Pseudocode

Program Code

Output

Practical 2 Browser Back and Forward Navigation Using Stack

Problem Statement

Design a Web Browser Navigation System using Stack.

The browser should perform:

Visit a new webpage

Back to previous page

Forward to next page

Display current webpage

Display browsing history

Use two stacks to simulate browser navigation.

Data Structure: Stack

Pseudocode

Program Code

Output

Practical 3 Railway Reservation Waiting Queue using Queue

Problem Statement

Design a Railway Reservation Waiting List System using Queue.

The application should support:

Add passenger to waiting list

Allocate seat to first passenger

Display waiting list

Display next passenger

Count waiting passengers

Data Structure: Queue

Pseudocode

Program Code

Output

Practical 4 Hospital Emergency Management System (Priority Queue)

Problem Statement

Implement a Hospital Emergency Queue where patients are treated according to priority.

Operations:

Register patient

Assign emergency priority

Treat highest-priority patient

Display waiting patients

Search patient

Data Structure: Priority Queue

Pseudocode

Program Code

Output

Practical 5 Music Playlist Manager using Singly Linked List

Problem Statement

Design a Music Playlist Manager using a Singly Linked List.

Operations:

Add song at beginning

Add song at end

Insert song after another song

Delete a song

Search song

Display playlist

Count total songs

Data Structure: Singly Linked List

Pseudocode

Program Code

Output

Practical 6 Music Playlist Manager using Doubly Linked List

Problem Statement

Design a Music Playlist Manager using a DoublyLinked List.

Operations:

Add song at beginning

Add song at end

Insert song after another song

Delete a song

Search song

Display playlist

Count total songs

Data Structure: DoublyLinked List

Pseudocode

Program Code

Output

Practical 7 Round Robin CPU Scheduling Simulator using Circular Linked List

Problem Statement

Develop a Round Robin CPU Scheduler using Circular Linked List.

Operations:

Add process

Delete completed process

Execute next process

Display running processes

Count active processes

Data Structure: Circular Linked List

Pseudocode

Program Code

Output

Practical 8 Library Book Catalog

Problem Statement

Design a Library Book Catalog System using Binary Search Tree.

Operations:

Insert new book

Search book by Book ID

Delete book

Display books using:

Inorder

Preorder

Postorder traversal

Count total books

Data Structure: Binary Search Tree

Pseudocode

Program Code

Output

Practical 9 City Navigation System

Problem Statement

Design a City Navigation System using Graph.

Each city represents a vertex and roads represent edges.

Operations:

Add city

Add road

Display graph

Perform BFS traversal

Perform DFS traversal

Check connectivity between two cities

Data Structure: Graph

Pseudocode

Program Code

Output

Practical 10 Online Shopping Product Search System

Problem Statement

Implement an Online Shopping Product Search System.

The application should:

Add products

Display products

Sort products by price (Bubble/Selection/Quick Sort)

Search product by Product ID (Linear Search)

Search sorted products using Binary Search

Delete product

Update product price

Data Structures & Algorithms:

Array

Sorting Algorithms

Searching Algorithms

Pseudocode

Program Code

Output