Scribd
Upload
15 views

Mini Project Data Structure

Uploaded by

manndober972
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
15 views

Mini Project Data Structure

Uploaded by

manndober972
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
You are on page 1/ 2

Task 1 Title: Library Book Management Using Stacks

o Problem Statement: Implement a stack-based application to manage books in


a library. When a book is borrowed, it’s removed from the stack, and when
returned, it’s placed back on the top. Ensure the application handles multiple
borrow and return operations and displays the most recently added book at the
top.

Task 2 Title: Task Scheduler with Circular Queue

o Problem Statement: Design a task scheduler using a circular queue to manage


tasks in a fixed-sized queue. As tasks are completed, remove them from the
front and add new tasks to the rear. Include overflow and underflow handling,
and provide functions to display all pending tasks.

Task 3 Title: Student Record Management Using Single Linked List

o Problem Statement: Create a single linked list to store student records (ID,
Name, Marks). Allow insertion of new students at the beginning, deletion of a
student by ID, and traversal to display all records. Implement functions to search
by student ID and update marks.

Task 4 Title: Hospital Patient Queue System Using Queue

o Problem Statement: Build a queue system to manage patient check-ins at a


hospital. Patients are added to the end of the queue as they arrive and served
from the front. Implement features to add, remove, and display patients in the
queue, handling overflow when the queue is full.

Task 5 Title: Expression Evaluation Using Stack

o Problem Statement: Develop a stack-based application to evaluate postfix


expressions. Implement functions to parse a postfix expression, push numbers
onto the stack, and pop operators to compute the result. Include error handling
for invalid expressions.

Task 6 Title: Cinema Seat Booking System Using 2D Array

o Problem Statement: Use a 2D array to manage seating in a cinema hall, where


each cell represents a seat (0 for available, 1 for booked). Implement functions
to book a seat, cancel a booking, and display the seating arrangement with row
and seat numbers.

Task 7 Title: Circular Queue-Based Printer Job Scheduler

o Problem Statement: Implement a circular queue for a printer job scheduler


where print jobs are added to the queue, and completed jobs are removed.
Include functions to add, remove, and view jobs in the queue, with a limit on
the maximum number of jobs.
Task 8 Title: Browser History Management Using Stack

o Problem Statement: Simulate a browser history feature using a stack where


each visited website is pushed onto the stack. Provide functions to go back (pop
the stack) and add new URLs, allowing the user to traverse backward through
their history.

Task 9 Title: Customer Support Ticketing System Using Queue

o Problem Statement: Create a queue-based system to handle customer support


tickets. As customers submit issues, they’re added to the end of the queue.
Support agents process tickets from the front. Provide functions to add, remove,
and view tickets in the queue.

Task 10 Title: Warehouse Inventory System Using Single Linked List

o Problem Statement: Develop a single linked list application to manage


warehouse inventory. Each node in the list represents an item (ID, Name,
Quantity). Include functions to add a new item, remove an item by ID, search
by ID, and update the quantity of items in stock.

You might also like