STUDENT MANAGEMENT SYSTEM

Submitted to :Mam anum Group members Muhammad Awais Munir Hasan Talal Aslam Asif Ali

INTRODUCTION :
We implemented a student data base system, it was implemented using following algorithms: Move to first algorithm(for efficient searching) Index sequential searching(for efficient insertion and deletion in database) File handling for storing data even if program is closed Stack implementation for restoring deleted data

METHADOLOGY :
We used index sequential searching for finding efficient path for insertion and deletion, we also have used move to first algorithm for implementing efficient searching based on

assumption that element that will be searched will be same to element most recently searched. We also used file handling to prevent loss of data even if program is closed, the file handling is also used to load data in link list when program is restarted. Another facility that is available in our database is that deleted data is not permanently deleted, instead it is stored in a stack data structure and can be restored if required.

CONSTRAINTS :
As restore system is based on stack data structure so when we restore data we can only restore data in a pre defined manner based on last in first out rule.