University Management System Using Data Structures and Algorithm
University Management System Using Data Structures and Algorithm
Maintaining Exam schedule like Subject code , Course , Subject Name , Date of
Examination , Time of Examination.
Advantages of the Proposed System
Data Structures are the basic block of Computer Science Technology. Data Structures are
used to store the data in such a way that we can access them in a very efficient way. There
are a lot of Data Structures used in the C++ Programming language Arrays, Stacks,
Queues, Linked-lists, Trees, and Graphs.
To solve a specific problem, we require an optimal solution or approach, and in
programming, it is also called Algorithm. They are used to manipulate the data stored in
the Data Structures to perform operations such as Searching, Sorting, and Traversal.
Data Structure used in this project
Linked list is the main data structure used in this project to complete
university management system.
Linked List - A linked list is a linear data structure, in which the elements are not
stored at contiguous memory locations. The elements in a linked list are linked
using pointers as shown in the below image:
In this program, a singly linked list is used to store data for students, teachers, and
exam schedules. A singly linked list is a data structure in which each element
(node) contains a value and a reference (a pointer) to the next element in the
sequence. It allows you to traverse the list in one direction, from the head (start) of
the list to the tail (end).
The classes ‘Student’, ‘Teacher’, and ‘ExamSchedule’ represent the nodes of the
linked lists, and each node contains data relevant to students, teachers, or exam
schedules, along with a `next` pointer to the next node in the list.
Node structure for each linked list :-
This project shows how easy it is to use and manage the data for university using
data structures and algorithms using C++.