Linux Questions:

6) A resource graph is usually used in which of the following strategies for dealing with deadlock issues in operating systems?

A. deadlock avoidance

B. deadlock detection

C. deadlock prevention

D. deadlock recovery

7) Based on the discussion on Chapter 6, which of the following statements is NOT true?

A. The bankers algorithm is designed for handling the deadlock prevention, not for deadlock avoidance.

B. All deadlocks involve conflicting needs for resources by two or more processes.

C. Spooling everything is an approach for the condition of mutual exclusion in deadlock prevention.

D. Deadlock prevention is more restrictive than deadlock avoidance.

8) Regarding conditions for resource deadlocks, which of the following statements is NOT true?

A. Resources previously granted cannot be forcibly taken away from a process. They must be explicitly released by the process holding them.

B. Processes currently holding resources that were granted earlier can request new resources.

C. There must be a circular list of three or more processes, each of which is waiting for a resource held by the next member of the chain.

D. Each resource is either currently assigned to exactly one process or is available.

9) Which of the following statements is TRUE?

A. Although a single computer can run multiple virtual machines, all these virtual machines must run either Linux or Windows, not both.

B. A type I hypervisor runs on an existing operating system.

C. A type II hypervisor runs on the bare hardware.

D. A hypervisor is also called a virtual machine monitor.

10) Sensitive instructions include all the following except

A. the instructions that change the memory management unit settings.

B. some of privileged instructions.

C. the instructions that do I/O.

D. the instructions that behave differently when executed in kernel mode than when executed in user mode.