PROJECT

DOCUMENTATION
DATA STRUCTURE AND ALGORITHM
Student management system
SUBMITTED TO:
Miss Amina Saud

SUBMITTED BY:-
Ahmad Hassan
Umair Ashiq
Ali Hamza Rizvi
ROLL NO:-
FA-18/BSCS/376
FA-18/BSCS/299
FA-18/BSCS/163
DEPARTMENT:-
BSCS
SEMESTER:-
3rd
SECTION:-
D
Page | 1
 STUDENT MANAGEMENT SYSTEM
ABSTRACT:
In this project we are doing to make a management system which
is used to manage the records of students this project makes it easy to add records of
students and whenever you need a record you can search it form the program in case
of changing any record user can also modify the record that has been entered in the
program. This program makes it easier for a user to manage the records of students
and modify them.

Literature Review:
The menu is handled by if else statement so we can switch
between our choices. In adding a new record in output, if any node already exist then
new node is connected with the existed node otherwise a new node is created. While
searching a node, a pointer searches all the pointers of linked lists to match the
required data from start to end. While Modifying the data part of the linked list is
overwritten with new data and in case of Deletion, the pointers before and after of
the node which we need to delete are connected with each other.

INTRODUCTION:
It is a simple c++ project for Student Information System. It gives a
simple example of a complete system with the functions of adding record, searching
record, updating record and deleting record using linked list. If a student understands
basic functions of creating, reading, update and delete a node from a linked list it
would be easy to create thismanagement system using this functionality.

Problem Statement:
In this problem we are making a student management system that
makes it easier to add, remove and modify the record of a student. In this project the
main problem is to use a link list for storing record of students.

Page | 2
OBJECTIVE:
In this project our main objective is to make it easier for a user to
manage to record of the students. A user can easily manage records of students.User
sometimes user needs to change the record in our project user can also modify the
record that is added before in the record. If any student leaves during the session this
project also gives an option to remove the student. In this project we are using linked
list to add the records of students and we are going to use if else to switch between
the choice’s user wants. Pointer are used to point out the record that user wants to
delete and pointer are used to point out the record user wanted to modify or update.
Searching is also a function of our project in case if user just want to see the record of
student.

FEATURES:
Our project includes different features.
1. User can add a new record
2. User can search a new record
3. User can modify previous record
4. User can delete a record
5. User can exit after entering a record

Scope:
It uses the concept of following topics:
1. Pointers are used in this project to search for different purposes like searching a
record, modifying a record and deleting a record. Linked list also uses the
concept of pointers.
2. Loops are use for the traversal of linked list.
3. Functions are used to divide the project in different parts to make our project
easier.
4. Linked List are used to save the record of students and to link it with the other
records.
5. If Else is used to switch between different choices.

Page | 3
Conclusion:
Thisproject is making it easier for the user to save the record of
students modify them and delete them. This project will be very useful for the user to
save the records of students.

References:

Geeks for Geeks Explanation for the article: https://www.geeksforgeeks.org/linked-

list-set-1-introduction/

Geeks for Geeks Explanation for the article:https://www.geeksforgeeks.org/linked-

list-set-2-inserting-a-node/

Explanation for the article: https://www.trustradius.com/student-management-

systems

Page | 4