-
In this project I implemented a student database system using dynamic memory allocation for linked list and binary tree. The program saves the data into binary files.
-
Student entries are kept in a linked list or balanced binary tree (ordered alphabetically by name) with memory allocated when a new student is introduced by the user and memory is deallocated when a user is removed.
$ The Menu presented to the user is as follows:
**************************************************************************************
** **
** To Introduce a New Student ----> choose option '1' **
** To Introduce a New Mark ----> choose option '2' **
** To Remove a Student ----> choose option '3' **
** To Print a Single Report ----> choose option '4' **
** To Print Report of all Students ----> choose option '5' **
** To Save to a FILE ----> choose option '6' **
** To Retrieve from a FILE ----> choose option '7' **
** To EXIT ----> choose option '8' **
** **
**************************************************************************************
- Hassif Abdulahi Mustafa - Student-Management-System
$ git clone https://github.com/hassifow/Student-Management-System
$ cd Student-Management-System
$ git status