wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

EXP-9(VIVA_VOCE)

Total questions: 17

Worksheet time: 9mins

Name
Class
Date
1.

A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist.

a)

a) resource allocation state

b)

b) system storage state

c)

c) operating system

d)

d) resources

2.

A state is safe, if ____________

a)

a) the system does not crash due to deadlock occurrence

b)

b) the system can allocate resources to each process in some order and still avoid a deadlock

c)

c) the state keeps the system protected and safe

d)

d) all of the mentioned

3.

A state is safe, if ____________

a)

a) the system does not crash due to deadlock occurrence

b)

b) the system can allocate resources to each process in some order and still avoid a deadlock

c)

c) the state keeps the system protected and safe

d)

d) all of the mentioned

4.

Which of the following is a necessary condition for a deadlock to occur?

a)

a) mutual exclusion

b)

b) hold and wait

c)

c) no preemption

d)

d) all of the mentioned

5.

In a deadlock situation, which of the following resources cannot be released?

a)

a) resources held by a process

b)

b) resources in the system

c)

c) resources that are not allocated

d)

d) none of the mentioned

6.

What is the primary goal of deadlock detection algorithms?

a)

a) to prevent deadlocks from occurring

b)

b) to identify deadlocks when they occur

c)

c) to recover from deadlocks

d)

d) to allocate resources efficiently

7.

Which of the following strategies can be used to prevent deadlocks?

a)

a) resource allocation graph

b)

b) wait-die scheme

c)

c) wound-wait scheme

d)

d) all of the mentioned

8.

What is the role of a resource allocation graph in deadlock detection?

a)

a) to visualize resource allocation

b)

b) to identify potential deadlocks

c)

c) to manage process states

d)

d) all of the mentioned

9.

Which of the following is NOT a method for recovering from a deadlock?

a)

a) process termination

b)

b) resource preemption

c)

c) process starvation

d)

d) wait for all processes to complete

10.

What is the main purpose of deadlock prevention techniques?

a)

a) to ensure that deadlocks never occur

b)

b) to detect deadlocks after they happen

c)

c) to recover from deadlocks

d)

d) to minimize resource usage

11.

Which of the following is a characteristic of a deadlock?

a)

a) processes are in a waiting state

b)

b) resources are being held indefinitely

c)

c) there is a circular chain of processes

d)

d) all of the mentioned

12.

What does the term 'resource starvation' refer to in the context of deadlocks?

a)

a) a process is permanently denied resources

b)

b) resources are allocated but not released

c)

c) a process is waiting indefinitely for resources

d)

d) all of the mentioned

13.
The processes that are residing in main memory and are ready and waiting to execute are kept on a list called _____________
a)
a) job queue
b)
b) ready queue
c)
c) execution queue
d)
d) process queue
14.
The interval from the time of submission of a process to the time of completion is termed as ____________
a)
a) waiting time
b)
b) turnaround time
c)
c) response time
d)
d) throughput
15.
Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
a)
a) first-come, first-served scheduling
b)
b) shortest job scheduling
c)
c) priority scheduling
d)
d) none of the mentioned
16.
Which algorithm is defined in Time quantum?
a)
a) shortest job scheduling algorithm
b)
b) round robin scheduling algorithm
c)
c) priority scheduling algorithm
d)
d) multilevel queue scheduling algorithm
17.
CPU scheduling is the basis of ___________
a)
a) multiprocessor systems
b)
b) multiprogramming operating systems
c)
c) larger memory sized systems
d)
d) none of the mentioned