NEW
Font size
S
M
L
XL
WorksheetsRevision C
Total questions: 20
Worksheet time: 10mins
Name
Class
Date
1.
The permanent blocking of a set of processes that either compete for system resources or communicate with each other refers to ___________
a)
Deadlock
b)
Relocation
c)
Swapping
d)
Suspension
2.
In a system model, each process utilizes a resource as the following, EXCEPT
a)
request
b)
use
c)
release
d)
hold
3.
Safely used by only one process at a time and not depleted by that use best define _________
a)
reusable resources
b)
consumable resources
4.
__________ will be created when it is required by a process and destroyed once it is used.
a)
Consumable resources
b)
Reusable resources
5.
The following are the conditions for deadlock, EXCEPT
a)
Mutual exclusion
b)
Hold-and-Pause
c)
No Pre-emption
d)
Circular wait
6.
If graph contains a cycle contains several instances per resource type, it will definitely lead to a deadlock. True or False?
a)
True
b)
False
7.
Make the appropriate dynamic choices based on the current state of resource allocation.
The statement best define ___________
The statement best define ___________
a)
Deadlock prevention
b)
Deadlock avoidance
c)
Deadlock detection
8.
___________ is a closed chain of processes exists, such that each process holds at least one resource needed by the next process in the chain
a)
Circular wait
b)
Mutual Exclusion
c)
Hold-and-Wait
d)
No Preemption
9.
Two approach of deadlock avoidance are Resource Allocation Denial and Process Initiation Denial. True or False?
a)
True
b)
False
10.
___________ is one in which there is at least one sequence of resource allocations to processes that does not result in a deadlock
a)
State
b)
Safe state
c)
Unsafe state
11.
Which of the following does not refer to memory management?
a)
Program must be brought (from memory) into disk and placed within a process for it to be run
b)
Main memory and registers are only storage CPU can access directly.
c)
Subdividing memory to accommodate multiple processes
d)
Memory needs to be allocated to ensure a reasonable supply of ready processes to consume available processor time
12.
Memory management is intended to satisfy the following requirements:
Relocation, Protection ,Sharing ,Logical organization and Physical organization. True or False?
Relocation, Protection ,Sharing ,Logical organization and Physical organization. True or False?
a)
True
b)
False
13.
Memory protection requirement must be satisfied by the operating system (software) rather than the processor (hardware). True or False?
a)
True
b)
False
14.
Memory is organized as __________
a)
linear
b)
perpendicular
15.
Fast disk large enough to accommodate copies of all memory images for all users; must provide direct access to these memory images.
The statement best define __________
The statement best define __________
a)
Data store
b)
Backing Store
c)
Swapping
d)
Roll out, roll in
16.
Main memory usually be split into two partitions to hold resident operating system and user processes. True or False?
a)
True
b)
False
17.
Memory Management Unit maps logical address __________
a)
statistically
b)
dynamically
18.
Which of the following is the disadvantage of unequal-size fixed partitioning?
a)
Small jobs will not utilize partition space efficiently
b)
A program may be too big to fit in a partition
c)
Main memory utilization is inefficient
19.
Which of the following is false about compaction?
a)
Technique for overcoming internal fragmentation
b)
OS shifts processes so that they are contiguous
c)
Free memory is together in one block
d)
Time consuming and wastes CPU time
20.
____________ partition memory into small equal fixed-size chunks and divide each process into the same size chunks
a)
Paging
b)
Segmentation
c)
Partitioning
d)
Fragmentation
Reset
