CGS 3763 Exam 2 Review!!!! (Credit to EillaAZ on Discord!! Content from chapters 5 – 8)
| Questions and Answers| Exam Elaborations
A _____ resource contains one or more identical units, each of which can be requested and used
by a process on a non-shared basis. ** Answ** reusable
In a resource allocation graph, processes are represented by _____ and resources are represented
by _____. ** Answ** circle, rectangles
In a resource allocation graph, a directed edge from a resource to a process
represents a _____. ** Answ** resource allocation
Process p1 and p2 are sharing resource r, which contains 3 units. All 3 units are
initially free. Which set of operations result in a state transition where p2 is blocked? **
Answ** p1 requests 2 units of r
p1 acquires 2 units of r
p2 requests 2 units of r
A resource allocation graph is considered completely reducible if at the termination of the graph
reduction algorithm, all processes have been _____. ** Answ** deleted
(NOTE: If it is not completely reducible, then it is considered deadlocked.)
Continuous deadlock detection proceeds as follows: If the current operation is a request for a
resource and the requesting process p becomes blocked, then execute the graph reduction
algorithm until either p is removed from the graph or _____. ** Answ** no unblocked
processes remain
Recovery from deadlock is possible by destroying one or more of the _____ involved in the
deadlock or by removing some of the _____ held by the deadlocked processes. ** Answ**
processes, resources
, Which graph acts as an extension of the general resource allocation graph? ** Answ**
resource claim graph
A condition where a process is holding one resource and requesting another is known as _____.
** Answ** hold-and-wait
Which of the following options to eliminate the hold-and-wait condition results in poor resource
utilization? ** Answ** all resources needed are requested simultaneously
A logical address _____. ** Answ** Is an integer in the range [0 : n-1], where n is the size of
logical memory
_____ is a program or a program component written in a language that is compiled into
executable code. ** Answ** source module
Which program relocation type binds all logical addresses to physical addresses prior to
execution? ** Answ** static
The term external memory fragmentation means that _____. ** Answ** usable main
memory is reduced due to holes
The 50% rule states that the ratio of holes to occupied blocks is _____. ** Answ** 1:2
Which memory paging concept defines a contiguous block of logical address space? **
Answ** page
A page table is best defined as _____ that is used to track which pages of logical address spaces
reside in their corresponding page frames. ** Answ** an array
| Questions and Answers| Exam Elaborations
A _____ resource contains one or more identical units, each of which can be requested and used
by a process on a non-shared basis. ** Answ** reusable
In a resource allocation graph, processes are represented by _____ and resources are represented
by _____. ** Answ** circle, rectangles
In a resource allocation graph, a directed edge from a resource to a process
represents a _____. ** Answ** resource allocation
Process p1 and p2 are sharing resource r, which contains 3 units. All 3 units are
initially free. Which set of operations result in a state transition where p2 is blocked? **
Answ** p1 requests 2 units of r
p1 acquires 2 units of r
p2 requests 2 units of r
A resource allocation graph is considered completely reducible if at the termination of the graph
reduction algorithm, all processes have been _____. ** Answ** deleted
(NOTE: If it is not completely reducible, then it is considered deadlocked.)
Continuous deadlock detection proceeds as follows: If the current operation is a request for a
resource and the requesting process p becomes blocked, then execute the graph reduction
algorithm until either p is removed from the graph or _____. ** Answ** no unblocked
processes remain
Recovery from deadlock is possible by destroying one or more of the _____ involved in the
deadlock or by removing some of the _____ held by the deadlocked processes. ** Answ**
processes, resources
, Which graph acts as an extension of the general resource allocation graph? ** Answ**
resource claim graph
A condition where a process is holding one resource and requesting another is known as _____.
** Answ** hold-and-wait
Which of the following options to eliminate the hold-and-wait condition results in poor resource
utilization? ** Answ** all resources needed are requested simultaneously
A logical address _____. ** Answ** Is an integer in the range [0 : n-1], where n is the size of
logical memory
_____ is a program or a program component written in a language that is compiled into
executable code. ** Answ** source module
Which program relocation type binds all logical addresses to physical addresses prior to
execution? ** Answ** static
The term external memory fragmentation means that _____. ** Answ** usable main
memory is reduced due to holes
The 50% rule states that the ratio of holes to occupied blocks is _____. ** Answ** 1:2
Which memory paging concept defines a contiguous block of logical address space? **
Answ** page
A page table is best defined as _____ that is used to track which pages of logical address spaces
reside in their corresponding page frames. ** Answ** an array
