Scribd
Upload
28 views2 pages

Seatwork 1 - Memory Management

Early Memory Management System

Uploaded by

Ryan Olaybal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
28 views2 pages

Seatwork 1 - Memory Management

Early Memory Management System

Uploaded by

Ryan Olaybal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Memory Management Systems Seatwork 1

Name:

Date:

1. Given the following: configuration with jobs arriving in order (Job A, B, C) and with blocks shown
in order from low order memory to high order memory:

Job List: Memory Block List:

Job Memory Memory Block Memory Block

Number Requested Size

Job A 990K Block 1 900K

Job B 275K Block 2 960K

Job C 760K Block 3 300K

a. Use the first-fit algorithm to indicate which memory blocks are allocated to each of the arriving
jobs.

b. Use the best-fit algorithm to indicate which memory blocks are allocated to each of the arriving
jobs.

c. Calculate the amount of internal fragmentation in Block 1 using the first-fit algorithm.

1
Memory Management Systems Seatwork 1

2. Given the following: configuration with jobs arriving in order (Job A, B, C, D) and with blocks
shown in order from low order memory to high order memory:

Job List: Memory Block List:

Job Memory Memory Block Memory Block

Number Requested Size

Job A 256K Block 1 910K

Job B 900K Block 2 900K

Job C 50K Block 3 200K

Job D 350K Block 4 300K

a. Use the best-fit algorithm to indicate which memory blocks are allocated to each of the arriving
jobs.

b. Use the first-fit algorithm to indicate which memory blocks are allocated to each of the arriving
jobs.

c. Calculate the total amount of internal fragmentation in all four blocks using the best-fit
algorithm.

You might also like