COSC $2610$ OPERATING SYSTEMS

CHAPTER $1-2$

Practice on Chapter $1$ & $2$

NAME

A: Use the following diagram to place jobs in memory using dynamic relocatable partions.

A$)J1=20KJ2=75KJ3=$ done $JJ465K$ J$5=35K$

B$)J6=30KJ1$ ends

C$)J7=90K$ Arrived

D$)$ Did J$7$ loaded?

AFTER $($A$)$

AFTER $($B$)$

Operating

System

$(10$ K$)$

Job #$1(20$ K$)$

$30K$

$40K$

Job #$4(65$ K$)$

$130K$

Job # $5(35$ K$)$

Job #$2(75$ K$)$

High

$300K$

AFTER $($B$)$

$$ K

Operating

System

$(10$ K$)$

Low

$10K$

Low

$\backslash$table$[[$Operating$,$L K$],[$Low$,]]$

AFTER $($C$)$

$\backslash$table$[[\backslash$table$[[$Operating$],[$System$],[(10K)$