A UNIVERSITY PROJECT(CONSOLE PROGRAM) THE SIMULATE MEMORY MANAGMNET(STATIC PARITIONING CASE) USING THE "FIRST FIT" ALGORITHM

LANGUAGE USED : NATIVE_C

I USED MULTIFILE PROGRAMMING WHERE "EXTEND.h" LIBRARY CONTAINT ALL THE MAIN FUNCTIONS/PROCEDURS

THE PROGRAM IS ABLE TO : -CREATION OF MAIN MEMORY BY SETTING THE NUMBERS OF PARITIONS AND SIZE OF EACH PARTIONS BY USER DEMAND

-CREATION OF THE PDT (PARITION DESCRIPTION TABLE )

-CREATION OF A QUEUE OF PROGRAMS WAITING TO BE LOADED WITH THEIR DETAILS(NAME,SIZE,AND ESTIMATED EXECUTION TIME )

-SEARCH FOR A FREE ZONE FOR A WAITING PROGRAM IS DONE ACCORDING TO THE ALGORITHM : "FIRST FIT"

-FREE OF PARITION

SOME PICTURES IN THE PROGRAM ================[MAIN MENU]=======================================

=====================================================================================

=================[QUEUE OF PROGRAMS]========================================

=========================================================================================

====================== ===[PDT]====================================

========================================================================================