QUESTION 1 Four processes P1, P2, P3, & P4 all arriving at time 0, with a burst time 10,23,9, 5 respectively is. The WAI

[answerhappygod]

QUESTION 1
Four processes P1, P2, P3, & P4 all
arriving at time 0, with a burst time 10,23,9, 5 respectively is.
The WAITING TIME for P3 is:
None of the listed
33
10
23
One of the following
does NOT represents a solution to the
Critical Section Problems:
Mutual Exclusion
Race Condition
Bounded Waiting
Progress
Resources are utilized by a process in the following order:
Request, Use, Release
Use, Request, Release
Request, Release, Use
Release, Use, Request
Which of the following statements about
paging is FALSE ?
It suffers from internal fragmentation
It is a contiguous allocation method
It doesn’t have external fragmentation
Swapping is easy in paging
Which of the following statements
is FALSE?
Thread allows more complex data-sharing.
Pipes in Unix provide a simple method for sharing data.
Processes within a system may be independent or
cooperating.
A thread just has a program counter and stack
space