IT600- Final Exam Test Bank

Multiple Choice
1. A deadlocked state occurs whenever ____.
A) a process is waiting for I/O to a device that does not exist
B) the system has no available free resources
C) every process in a set is waiting for an event that can only be caused by
another process in the set
D) a process is unable to release its request for a resource after use
2. One necessary condition for deadlock is ____, which states that at least one
resource must be held in a nonsharable mode.
A) hold and wait
B) mutual exclusion
C) circular wait
D) no preemption
3. One necessary condition for deadlock is ______, which states that a process
must be holding one resource and waiting to acquire additional resources.
A) hold and wait
B) mutual exclusion
C) circular wait
D) no preemption
4. One necessary condition for deadlock is ______, which states that a resource
can be released only voluntarily by the process holding the resource.
A) hold and wait
B) mutual exclusion
C) circular wait
D) no preemption
5. One necessary condition for deadlock is ______, which states that there is a
chain of waiting processes whereby P0 is waiting for a resource held by P1, P1 is
waiting for a resource held by P2, and Pn is waiting for a resource held by P0.
A) hold and wait
B) mutual exclusion
C) circular wait
D) no preemption
6. The witness software product is a ____.
A) lock-order verifier that uses mutual-exclusion locks to protect critical sections
B) modeler to develop resource allocation graphs
C) driver that can be used to prevent mutual exclusion for nonsharable resources
D) implementation of the banker's algorithm available for most operating
systems

7.
A)
B)
C)
D)

In a system resource-allocation graph, ____.

a directed edge from a process to a resource is called an assignment edge
a directed edge from a resource to a process is called a request edge
a directed edge from a process to a resource is called a request edge
None of the above

8. A cycle in a resource-allocation graph is ____.

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 once instance
D) is neither necessary nor sufficient for indicating deadlock in the case that each
resource has exactly one instance
9.
A)
B)
C)
D)

To handle deadlocks, operating systems most often _____.

pretend that deadlocks never occur
use protocols to prevent or avoid deadlocks
detect and recover from deadlocks
None of the above

10. Which of the following statements is true?

A) A safe state is a deadlocked state.
B) A safe state may lead to a deadlocked state.
C) An unsafe state is necessarily, and by definition, always a deadlocked state.
D) An unsafe state may lead to a deadlocked state.
11. Suppose that there are ten resources available to three processes. At time 0,
the following data is collected. The table indicates the process, the maximum
number of resources needed by the process, and the number of resources
currently owned by each process. Which of the following correctly characterizes
this state?
Process
Maximum Needs Currently Owned
P0
10
4
P1
3
1
P2
6
4
A) It is safe.
B) It is not safe.
C) The state cannot be determined.
D) It is an impossible state.
12. Suppose that there are 12 resources available to three processes. At time 0,
the following data is collected. The table indicates the process, the maximum
number of resources needed by the process, and the number of resources

currently owned by each process. Which of the following correctly characterizes

this state?
Process
Maximum Needs Currently Owned
P0
10
4
P1
3
2
P2
7
4
A) It is safe.
B) It is not safe.
C) The state cannot be determined.
D) It is an impossible state.
13. Which of the following data structures in the banker's algorithm is a vector of
length m, where m is the number of resource types?
A) Need
B) Allocation
C) Max
D) Available
14. Assume there are three resources, R1, R2, and R3, that are each assigned
unique integer values 15, 10, and 25, respectively. What is a resource ordering
which prevents a circular wait?
A) R1, R2, R3
B) R3, R2, R1
C) R3, R1, R2
D) R2, R1, R3
15. A _____ could be preempted from a process.
A) mutex lock
B) CPU
C) semaphore
D) file lock
16. In a virtual machine, each program believes that it has ____.
A) multiple processors
B) its own memory
C) another "virtual" computer to assist in its operations
D) more memory than is physically available on the machine
17. _____ is not an example of a benefit of virtual machines.
A) The ability to run several different operating systems that all share the same
hardware
B) The ability to concurrently run several different operating systems
C) Uses less physical memory than an actual operating system
D) Protects the host system from guest operating systems
18. _________ allows a virtual machine to behave as if it is acting in kernel mode.
A) Paravirtualization

B) Live migration
C) Trap-and-emulate
D) The Java virtual machine
19. Which of the following statements regarding a virtual CPU (VCPU) is
considered false?
A) The VCPU does not execute code.
B) It represents the state of the physical CPU.
C) Each guest shares the VCPU.
D) The VCPU is found in most virtualization options.
20. _________ allows for virtualization on systems that do not have a clean
separation between privileged and non-privileged instructions.
A) Binary translation
B) Trap-and-emulate
C) Application containment
D) Paravirtualization
21. Which of the following statements regarding nested page tables (NPTs) is
false?
A) They are used to represent the guest's page table state.
B) NPTs are used for both trap-and-emulate and binary translation.
C) NPTs reduce the number of TLB misses.
D) Each guest operating system maintains its own NPT.
22. _________ occurs when a virtual machine is configured with more virtual CPUs
than there are physical CPUs.
A) Containment
B) CPU scheduling
C) Overcommitment
D) It is not possible to configure a virtual machine with more processors than exist
in the system.
23. VMM is coded in Firmware in ----------.
A) Hypervisor 1.
B) Hypervisor 2.
C) Hypervisor 0.
D) None of above.
24. A VMM which runs directly on hatdware in most privelaged mode ------.
A) type 0 Hypervisor.
B) type 1 Hypervisor.
C) type 2 Hypervisor.
D) Paravirtualization.
25. Hosted hypervisor which runs on a host Operating System is ---------.
A) type 2 Hypervisor.

B) type 0 Hypervisor.
C) type 1 Hypervisor.
D) Paravirtualization.
26. For more efficiency, the source code of the guest Operating System is modified in ---------.
A) typee 0 Hypervisor.
B) type 1 Hypervisor.
C) Paravirtualization.
D) type 2 Hypervisor.
27. Location of a Multicomputer system generally can be in ----------.
A) Same Rack
B) Same room.
C) Worldwide
D) All of above.
28.

In a Distributed systems are generally ---------.

A) Possibly different.
B) Same.
C) Shared
D) All of the above.

29.

In a Multiprocessor system internode communication is generally ---------.

A) Dedicated interconnect
B) Traditional network
C) Shared RAM.
D) All of above.

30.

In a Distributed system, node peripherals are generally ---------.

A) Shared exec.
B) All shared.
C)
Full set per node.
D)
All of the above.

31. Which is not a problem of a Remote Procedure Call.

A) Passing pointer parameters.
B) Message Passing.
C) Weekly typed languages.
D) Use of Global variables.
32. No Switch is used in which of nodes interconnection topologies.
A) Star.
B) Grid.
C) Cube.
D) Ring.
33. In an access matrix, the ____ right allows a process to change the entries in a row.
A) owner
B) copy

C) control.
D) switch
34. The ____ implementation of an access table consists of sets of ordered triples.
A) global table
B) access list for objects
C) lock-key mechanism
D) capability list
35. In capability lists, each object has a ____ to denote its type.
A) gate
B) tag
C) key
D) lock
36. If an Access Control Matrix or Protection Matrix is sliced by rows and the blank
entries are discarded, we get a list called --------.
A) Protection List.
B) Access Control List.
C) Capability List.
D) None of the above.
37. If an Access Control Matrix or Protection Matrix is sliced by columns and the blank
entries are discarded, we get a list called --------.
A) Protection List.
B) Access Control List.
C) Capability List.
D) None of the above.
38. In practice, actually storing of Access Control Matrix or Protection Matrix is
never done because ---------.
A) It is dense.
B) It is large and sparse.
C) It has not enough cells.
D) None of the above.
39. The most common method used by attackers to breach security is ____.
A) masquerading
B) message modification
C) session hijacking
D) phishing
40. A code segment that misuses its environment is called ____.
A) a backdoor
B) a trap door
C) a worm
D) a Trojan horse
41. Worms ____.

A)
B)
C)
D)

use the spawn mechanism to ravage system performance

can shut down an entire network
continue to grow as the Internet expands
All of the above

42. A denial of service attack is ____.

A) aimed at gaining information
B) aimed at stealing resources
C) aimed at disrupting legitimate use of a system
D) generally not network based
43. In a paired-password system, ____.
A) the user specifies two passwords
B) the computer supplies one part of a password and the user enters the other part
C) passwords must contain equal amounts of numbers and digits paired together
D) two users must enter their own separate password to gain access to the system
44. A ____ virus changes each time it is installed to avoid detection by antivirus software.
A) polymorphic
B) tunneling
C) multipartite
D) stealth
45. A ____ is a public key digitally signed by a trusted party.
A) key ring
B) digital certificate
C) message digest
D) digital key