is a scheduling problem when lower$-$priority process holds a resource needed by

higher priority process.

$($a$)$ Priority inversion

$($b$)$ Starvation

$($c$)$ Deadlock

$($d$)$ Busy waiting

$($e$)$ None of the above

Assume two processes are modifying a shared variable in memory $($call it $x)$ as shown below.

Process P$1$

Process P$2$

where $S$ is a semaphores that is shared between the two processes. Assuming the initial value of

$x$ is $4$ and the initial value of $S$ is $0,$ what value will $x$ hold after both process finish execution?

$($a$)4$

$($b$)2$

$($c$)6$

$($d$)$ Any of the above

$($e$)$ The two processes will block indefinitely, and no one will finish

In question $(9),$ if the initial value of $x$ is $4$ and the initial value of $S$ is $1,$ what value will $x$

hold after both process finish execution?

$($a$)4$

$($b$)2$

$($c$)6$

$($d$)$ Any of the above

$($e$)$ The two processes will block indefinitely, and no one will finish

Problem $3[12$ points$]$: Memory Management

Which of the following statements is INCORRECT about demand paging?

$($a$)$ A page is brought into memory only when it is needed.

$($b$)$ It reduces memory requirements of processes.

$($c$)$ It reduces I$/$O overhead.

$($d$)$ It generally reduces the response time of a process.

$($e$)$ None of the above.

How much memory will be allocated for a $39KB$ kernel memory request using a Buddy system

allocator?

$($a$)39KB$

$($b$)42KB$

$($c$)64KB$

$($d$)128KB$

$($e$)$ None of the above