Time left $1$:$42$:$07$

Question $1$

Answer saved

Marked out of $3\mathrm{.}00$

Flag question

Question text

Assume there are three resources, R$1,$ R$2,$ and R$3,$ that are each assigned unique integer values $15,10,$ and $25,$ respectively. What is a resource ordering which prevents a circular wait?

Select one:

a$.$

R$1,$ R$2,$ R$3$

b$.$

R$3,$ R$2,$ R$1$

c$.$

R$3,$ R$1,$ R$2$

d$.$

R$2,$ R$1,$ R$3$

Question $2$

Answer saved

Marked out of $3\mathrm{.}00$

Flag question

Question text

$\_\_\_\_$ is a thread library for Solaris that maps many user$-$level threads to one kernel thread.

Select one:

a$.$

Pthreads

b$.$

Green threads

c$.$

Sthreads

d$.$

Java threads

Question $3$

Not yet answered

Marked out of $3\mathrm{.}00$

Flag question

Question text

In an environment where several processes may open the same file at the same time, $\_\_\_\_.$

Select one:

a$.$

the operating system typically uses only one internal table to keep track of open files

b$.$

the operating system typically uses two internal tables called the system$-$wide and per$-$disk tables to keep track of open files

c$.$

the operating system typically uses three internal tables called the system$-$wide, per$-$disk, and per$-$partition tables to keep track of open files

d$.$

the operating system typically uses two internal tables called the system$-$wide and per$-$process tables to keep track of open files

Question $4$

Not yet answered

Marked out of $3\mathrm{.}00$

Flag question

Question text

In Pthreads, a parent uses the pthread$\_$join$()$ function to wait for its child thread to complete. What is the equivalent function in Win$32?$

Select one:

a$.$

win$32\_$join$()$

b$.$

wait$()$

c$.$

WaitForSingleObject$()$

d$.$

join$()$

Question $5$

Not yet answered

Marked out of $2\mathrm{.}00$

Flag question

Question text

A process may transition to the Ready state by which of the following actions?

Select one:

a$.$

Completion of an I$/$O event

b$.$

Awaiting its turn on the CPU

c$.$

Newly$-$admitted process

d$.$

All of the above

Question $6$

Not yet answered

Marked out of $3\mathrm{.}00$

Flag question

Question text

The "key" scheme for implementing revocation allows selective revocation.

True

False

Question $7$

Not yet answered

Marked out of $3\mathrm{.}00$

Flag question

Question text

$\_\_\_\_\_\_\_\_$ allows the parent and child processes to initially share the same pages, but when either process modifies a page, a copy of the shared page is created.

Select one:

a$.$

copy$-$on$-$write

b$.$

zero$-$fill$-$on$-$demand

c$.$

memory$-$mapped

d$.$

virtual memory fork

Question $8$

Not yet answered

Marked out of $4\mathrm{.}00$

Flag question

Question text

A cycle in a resource$-$allocation graph is $\_\_\_\_.$

Select one:

a$.$

a necessary and sufficient condition for deadlock in the case that each resource has more than one instance

b$.$

a necessary and sufficient condition for a deadlock in the case that each resource has exactly one instance

c$.$

a sufficient condition for a deadlock in the case that each resource has more than one instance

d$.$

is neither necessary nor sufficient for indicating deadlock in the case that each resource has exactly one instance