Scribd
Upload
12 views3 pages

Student & Library Management Systems

Students must choose between two project topics for their final lab project: a Student Record Management System using Arrays or a Library Book Management System using Linked Lists. Each project requires implementing specific operations and at least two sorting algorithms, with evaluation criteria focusing on data structure usage, sorting implementation, program correctness, code quality, and understanding. The projects will be demonstrated in Labs 15 and 16.

Uploaded by

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

Student & Library Management Systems

Students must choose between two project topics for their final lab project: a Student Record Management System using Arrays or a Library Book Management System using Linked Lists. Each project requires implementing specific operations and at least two sorting algorithms, with evaluation criteria focusing on data structure usage, sorting implementation, program correctness, code quality, and understanding. The projects will be demonstrated in Labs 15 and 16.

Uploaded by

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

Final Lab Project (Lab 15 & Lab 16)

Below are two project topics.


Each student must choose ONE topic and develop the complete program according to DSA
concepts covered in class.
You will perform and demonstrate the project in Lab 15 & Lab 16.
Your work will be evaluated based on implementation, understanding, and execution.

Topic 1: Student Record Management System (Using Arrays &


Sorting Algorithms)
Project Description:
Design and implement a simple student record system using an Array as the primary data
structure.
The system must allow storing, updating, displaying, and sorting student information.
Minimum Requirements:
1. Store student details:
o Roll Number

o Name

o Marks

2. Implement the following operations:


o Add new student

o Search student by roll number

o Display all student records

o Delete a student record (optional but recommended)

3. Implement at least TWO sorting algorithms from the following:


o Bubble Sort

o Insertion Sort

o Selection Sort

o Merge Sort

4. Sorting should arrange records based on marks or roll number.


Topic 2: Library Book Management System (Using Linked List &
Sorting Algorithms)
Project Description:
Create a library management system using a Linked List to store and manage book records.
Focus on insertion, deletion, and sorting using DSA techniques.
Minimum Requirements:
1. Store book details:
o Book ID

o Title

o Author

2. Implement the following operations:


o Add new book

o Delete a book

o Search a book

o Display all books

3. Implement at least TWO sorting algorithms such as:


o Bubble Sort

o Selection Sort

o Merge Sort

o Insertion Sort

4. Sorting should be based on Book ID or Title.


Final Lab Evaluation Criteria (Lab 15 & 16)
Students will be evaluated on:
1. Correct use of Data Structures (Array / Linked List)
2. Correct implementation of Sorting Algorithms
3. Program correctness and execution
4. Code quality and logical structure
5. Student understanding during viva/discussion
6. Output clarity

You might also like