11/16/21, 11:37 AM OS class test 3

OS class test 3
yashyadav_se20b9_54@dtu.ac.in Switch account

Draft saved

Your email will be recorded when you submit this form

* Required

A deadlock eventually cripples system throughput and will cause the CPU
utilization to ______ *

increase

drop

stay still

none of the mentioned

An edge from process Pi to Pj in a wait for graph indicates that ____________ *

Pi is waiting for Pj to release a resource that Pi needs

Pj is waiting for Pi to release a resource that Pj needs

Pi is waiting for Pj to leave the system

Pj is waiting for Pi to leave the system

https://docs.google.com/forms/d/e/1FAIpQLSfYQHhMfz8t_Vsma8Jlj6CDEPzhrKC4kXardmTS6BRSGrXc_A/viewform?hr_submission=ChkIlIP7tK… 1/6
11/16/21, 11:37 AM OS class test 3

Which one of the following is a visual ( mathematical ) way to determine the

deadlock occurrence? *

resource allocation graph

starvation graph

inversion graph

none of the mentioned

Other:

Roll Number *

2K20/SE/164

email id *

yashyadav_se20b9_54@dtu.ac.in

The two ways of aborting processes and eliminating deadlocks are ____________
*

Abort all deadlocked processes

Abort all processes

Abort one process at a time until the deadlock cycle is eliminated

All of the mentioned

https://docs.google.com/forms/d/e/1FAIpQLSfYQHhMfz8t_Vsma8Jlj6CDEPzhrKC4kXardmTS6BRSGrXc_A/viewform?hr_submission=ChkIlIP7tK… 2/6
11/16/21, 11:37 AM OS class test 3

The number of resources requested by a process : *

must always be less than the total number of resources available in the system

must always be equal to the total number of resources available in the system

must not exceed the total number of resources available in the system

must exceed the total number of resources available in the system

Other:

A computer system has 6 tape drives, with ‘n’ processes competing for them.
Each process may need 3 tape drives. The maximum value of ‘n’ for which the
system is guaranteed to be deadlock free is? *

Other:

Name *

Yash Yadav

https://docs.google.com/forms/d/e/1FAIpQLSfYQHhMfz8t_Vsma8Jlj6CDEPzhrKC4kXardmTS6BRSGrXc_A/viewform?hr_submission=ChkIlIP7tK… 3/6
11/16/21, 11:37 AM OS class test 3

To avoid deadlock: *

there must be a fixed number of resources to allocate

resource allocation must be done only once

all deadlocked processes must be aborted

inversion technique can be used

Other:

A system has 3 processes sharing 4 resources. If each process needs a maximum

of 2 units then, deadlock ____________ *

can never occur

may occur

has to occur

none of the mentioned

What is the disadvantage of invoking the detection algorithm for every request?
*

overhead of the detection algorithm due to consumption of memory

excessive time consumed in the request to be allocated memory

considerable overhead in computation time

all of the mentioned

https://docs.google.com/forms/d/e/1FAIpQLSfYQHhMfz8t_Vsma8Jlj6CDEPzhrKC4kXardmTS6BRSGrXc_A/viewform?hr_submission=ChkIlIP7tK… 4/6
11/16/21, 11:37 AM OS class test 3

Those processes should be aborted on occurrence of a deadlock, the

termination of which? *

is more time consuming

incurs minimum cost

safety is not hampered

all of the mentioned

A problem encountered in multitasking when a process is perpetually denied

necessary resources is called: *

deadlock

starvation

inversion

aging

Other:

Option 1

If the wait for graph contains a cycle ____________ *

then a deadlock does not exist

https://docs.google.com/forms/d/e/1FAIpQLSfYQHhMfz8t_Vsma8Jlj6CDEPzhrKC4kXardmTS6BRSGrXc_A/viewform?hr_submission=ChkIlIP7tK… 5/6
11/16/21, 11:37 AM OS class test 3

then a deadlock exists

then the system is in a safe state

either deadlock exists or system is in a safe state

For effective operating system, when to check for deadlock? *

a) every time a resource request is made

b) at fixed time intervals

both (a) and (b)

none of the mentioned

Other:

The wait-for graph is a deadlock detection algorithm that is applicable when

____________ *

all resources have a single instance

all resources have multiple instances

all resources have a single 7 multiple instances

all of the mentioned

Submit Clear form

Never submit passwords through Google Forms.

This form was created inside of Delhi Technological University. Report Abuse

 Forms

https://docs.google.com/forms/d/e/1FAIpQLSfYQHhMfz8t_Vsma8Jlj6CDEPzhrKC4kXardmTS6BRSGrXc_A/viewform?hr_submission=ChkIlIP7tK… 6/6