ST.

VINCENT PALLOTTI COLLEGE OF ENGINEERING &

TECHNOLOGY, NAGPUR
Department of Information Technology
Academic Year:2023-24
List of Scenario Based Program
Course: Data Structures
Course Code: IT301T
Semester/Section/Bra
3rd Sem IT
nch:
Name of Lab
Mr.Jagdish F. Pimple
In-Charge:

1. Scenario: Grocery Store Inventory Optimization

Consider You are the manager of a grocery store, and you want to optimize the organization of
your store's inventory. You have a list of products with their respective quantities on the shelves.
The goal is to rearrange the products in ascending order based on their quantities using the
insertion sort algorithm. This will help improve the store's layout and make it easier for
customers to find products with larger quantities.

Program Statement:

Write a C program to organize the grocery store inventory using the insertion sort algorithm.
Given a list of products and their quantities on the shelves, your program should rearrange the
products in ascending order based on their quantities.

2. Scenario: Online Clothing Store Inventory Management

Imagine You are the owner of an online clothing store, and you want to efficiently manage your
inventory. You have a list of clothing items, each with a unique identifier, name, price, and
quantity in stock. To enhance the shopping experience for your customers, you decide to sort
the clothing items by price using the quicksort algorithm. This will allow customers to easily
find clothing items within their budget.

Program Statement:

Write a C program to manage the inventory of your online clothing store using the quicksort
algorithm. Given a list of clothing items with their unique identifiers, names, prices, and
quantities, your program should sort the items by price in ascending order.

3. Scenario: Music Library Playlist Sorting

Consider You are an avid music enthusiast with a vast digital music library containing a variety
of songs from different genres and eras. To create a more enjoyable listening experience, you
decide to sort your music playlist using the shellsort algorithm. The goal is to group similar
songs together by their genre and arrange them in ascending order of their release year.

Program Statement:

Write a C program to organize your music playlist using the shellsort algorithm. Given a list of
songs with their titles, genres, and release years, your program should sort the songs first by
genre and then within each genre, sort them by release year in ascending order.

4. Scenario: Ticket Booking System with Circular Queue

You are developing a ticket booking system for a small theater that has a limited number of
seats. To efficiently manage ticket reservations and seat allocations, you decide to implement a
circular queue. Customers can book tickets, and if the theater reaches its maximum capacity,
new bookings will wrap around to the beginning of the queue, ensuring a fair distribution of
seats.

Program Statement:

Write a C program to implement a circular queue for a theater's ticket booking system. The
program should allow customers to book tickets, cancel reservations, and display the current
seat allocation. When the maximum capacity of the theater is reached, any new bookings should
wrap around to the beginning of the queue.

5. Scenario: Hospital Emergency Room Priority Queue

Suppose you are working with an IT industry, your tasked with developing a program for
managing an emergency room at a hospital. Patients arrive at the emergency room with
different levels of urgency and medical conditions. To ensure that patients receive timely care,
you decide to implement a priority queue. The program should prioritize patients based on the
severity of their medical condition and serve them accordingly.

Program Statement:

Write a C program to implement a priority queue for an emergency room at a hospital. The
program should allow medical staff to admit patients with different levels of medical condition
severity. Patients with higher severity levels should be served before those with lower severity
levels.

6. Scenario: Student Record Management with Doubly Linked List

Suppose you are working in university, You’re tasked with developing a program for managing
student records at a university. Each student record includes information such as a student's
name, student ID, and GPA. To efficiently manage and manipulate these records, you decide to
implement a doubly linked list data structure. The program should allow you to add new student
records, delete records, search for records by student ID, and display the records in both
forward and reverse order.

Program Statement:
Write a C program to implement a doubly linked list for managing student records at a
university. Each student record contains a student's name, student ID, and GPA. The program
should provide the following functionalities:

1. Add a new student record to the list.

2. Delete a student record by student ID.
3. Search for a student record by student ID and display the student's information.
4. Display all student records in forward order.
5. Display all student records in reverse order.

7.Scenario: Employee Hierarchy Binary Tree

You are tasked with developing a program for managing the hierarchical structure of employees
within a company. Each employee has a unique ID, name, and position within the organization.
To efficiently represent this hierarchy, you decide to implement a binary tree using a linked list.
The program should allow you to add employees to the tree, display the hierarchy, and search
for employees based on their unique IDs.

Program Statement:
Write a C program to implement a binary tree using a linked list for managing the hierarchical
structure of employees within a company. Each node of the binary tree should represent an
employee and contain the employee's unique ID, name, and position. The program should
provide the following functionalities:

Add an employee to the binary tree, maintaining the hierarchy based on employee IDs. Display
the employee hierarchy in a structured format, such as an organizational chart. Search for an
employee by their unique ID and display their information.

8.Scenario: Network Cable Installation

You are a project manager for a telecommunications company tasked with laying network
cables to connect several buildings in a new residential area. The goal is to minimize the cost of
laying cables while ensuring that all buildings are connected to the network. To achieve this,
you decide to implement Prim's algorithm to find the minimum cost spanning tree for
connecting the buildings.

Program Statement:

Write a C program to find the minimum cost spanning tree for connecting a set of buildings
with network cables. The program should use Prim's algorithm to determine the optimal set of
cable connections, minimizing the total cost. The input to the program should include the
number of buildings, the distance matrix specifying the cost of connecting each pair of
buildings, and it should output the minimum cost spanning tree and the total cost of cable
installation.