Question: The ''Buddy Algorithm'' allocates pages in the power of 2. The request will be rounded up to the next highest power of 2. Give a
The ''Buddy Algorithm'' allocates pages in the power of 2. The request will be rounded up to the next highest power of 2. Give a simple illustration of the algorithm. Suppose, there exists a single contiguous memory of 64 pages. a) Process A requests 7 pages. b) Process B requests 3 pages. c) Process C requests 9 pages. d) Process B returns its request. e) Process D requests 9 pages.
Note: please use your own work do not copy and paste from other sources!!!
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
