Question

USE THIS ILLUSTRATION BELOW FOR DYNAMIC PARTITIONING QUESTIONS Hole 4 Hole 1 20K Hole 2 12K Hole 3 10K Hole 5 40K Hole 6 15K Hole 7 18K Hole 8 14K 22K Request 1 24K Request Request Request 2 3 4 10K 14K 18K

Answer 1

QUESTION 1

IN BEST FIT WE CAN LOOP THROUGH ALL POSSIBLE HOLES AND FIND THE BEST FIT HOLE THAT CAN BE UTILIZED TO GRANT THE ACCESS TO THE REQUEST TO THE USER. WE SUBTRACT THE REQUEST FROM ALL THE POSSIBLE HOLE AND THEN GRANT THE REQUEST TO THE LOWEST POSSIBLE NON NEGATIVE HOLE.

REQUEST 1 - HOLE 5

REQUEST 2 - HOLE 3

REQUEST 3 - HOLE 8

REQUEST 4 - HOLE 7

QUESTION 2-

THE METHOD TO PREVENT A DEADLOCK BEFORE IT ACTUALLY HAPPENS IS CALLED AS DEADLOCK PREVENTION AND DEADLOCK AVOIDANCE.

DEADLOCK PREVENTION IS THE MECHANISM TO ENSURE THAT AT LEAST ONE OF THE NECESSARY CONDITION FOR DEADLOCK NEVER OCCUR. TO PREVENT A DEADLOCK SITUATION , IT IS NOT NECESSARY TO KNOW ALL EXISTING RESOURCES , AVAILABILITY AND REQUESTS. NON - BLOCKING SYNCRONIZATION AGORITHMS AND SEARILIZING TOKENS ARE SOME OF DEADLOCK PREVENTION ALGORITHMS. IN MOST OF THE SYSTEM THE DEADLOCK PREVENTION ALGORITHMS CANT BE IMPLEMENTED.

ACCORDING TO DEADLOCK AVOIDANCE WE APPLY A MECHANISMS THAT INVOLVES SAFE STATE . A SYSTEM IS A SAFE WHEN IT IS POSSIBLE TO ALLOCATE RESOURCES TO ALL PROCESSES IN SOME ORDER WITHOUT CAUSING DEADLOCK , DEADLOCK AVOIDANCE IS A MECHANISM TO ENSURE THAT THE SYSTEM DOES NOT ENTER AN UNSAFE STATE. IN OTHER WORDS , IT ENSURES THAT THE SYSTEM DOES NOT HAVE A DEADLOCK. TO AVOID A SYSTEM FROM REACHING AN UNSAFE STATE , THE SYSTEM SHOULD KNOW ABOUT THE NUMBER OF EXISTING RESOURCES , AVAILABILITY AND REQUESTS.

ASK ANY DOUBTS IN THE COMMENTS.