A state is safe, if _______
1.the system does not crash due to deadlock occurrence
2.the system can allocate resources to each process in some order and still avoid a deadlock
3.the state keeps the system protected and safe
4.All of the Mentioned
If execution time binding is being used, then a process ______ be swapped to a different memory space.
1.has to be
2. can never
3.must
4.may
If no cycle exists in the resource allocation graph ______
1. then the system will not be in a safe state
2.then the system will be in a safe state
3. all of the mentioned
4.None of the mentioned
If the resources are always preempted from the same process __________ can occur.
1.deadlock
2.system crash
3.aging
4.starvation
The backing store is generally a ______
1.fast disk
2.disk large enough to accommodate copies of all memory images for all users
3.disk to provide direct access to the memory images
4.All of the Mentioned
The resource allocation graph is not applicable to a resource allocation system _____
1. with multiple instances of each resource type
2.with a single instance of each resource type
3. single & multiple instances of each resource type
4.None of the mentioned
The two ways of aborting processes and eliminating deadlocks are ______
1.Abort all deadlocked processes
2.Abort all processes
3.Abort one process at a time until the deadlock cycle is eliminated
4.All of the mentioned
A deadlock can be broken by ______
1. abort one or more processes to break the circular wait
2.abort all the process in the system
3. preempt all resources from all processes
4.none of the mentioned
A memory buffer used to accommodate a speed differential is called ______
1. stack pointer
2. cache
3.accumulator
4.disk buffer
A system is in a safe state only if there exists a _____
1.safe allocation
2.safe resource
3.safe sequence
4.All of the Mentioned
All unsafe states are _______
1. deadlocks
2.not deadlocks
3. fatal
4.None of the mentioned
Binding of instructions and data to memory addresses can be done at ______
1.Compile time
2.Load time
3.Execution time
4.All of the Mentioned
Cost factors for process termination include ______
1.Number of resources the deadlock process is not holding
2.CPU utilization at the time of deadlock
3.Amount of time a deadlocked process has thus far consumed during its execution
4.All of the Mentioned
CPU fetches the instruction from memory according to the value of _______
1.program counter
2.status register
3.instruction register
4. program status word
Each request requires that the system consider the _____________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.
1. resources currently available
2.processes that have previously been in the system
3.resources currently allocated to each process
4.future requests and releases of each process
Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.
1.minimum
2.average
3.maximum
4.approximate
If a higher priority process arrives and wants service, the memory manager can swap out the lower priority process to execute the higher priority process. When the higher priority process finishes, the lower priority process is swapped back in and continues execution. This variant of swapping is sometimes called?
1. priority swapping
2.pull out, push in
3.roll out, roll in
4. none of the mentioned
If binding is done at assembly or load time, then the process _____ be moved to different locations after being swapped out and in again.
1. can
2. must
3. can never
4.may
If the process can be moved during its execution from one memory segment to another, then binding must be _______
1.delayed until run time
2.preponed to compile time
3.preponed to load time
4.None of the mentioned
If we preempt a resource from a process, the process cannot continue with its normal execution and it must be _______
1.aborted
2.rolled back
3.terminated
4.queued
In a system that does not support swapping _______
1. the compiler normally binds symbolic addresses (variables) to relocatable addresses
2.the compiler normally binds symbolic addresses to physical addresses
3.the loader binds relocatable addresses to physical addresses
4.binding of symbolic addresses to physical addresses normally takes place during execution
Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called?
1.fragmentation
2.paging
3.mapping
4.None of the mentioned
ne way to ensure that the circular wait condition never holds is to ______
1.impose a total ordering of all resource types and to determine whether one precedes another in the ordering
2.to never let a process acquire resources that are held by other processes
3.to let a process wait for only one resource at a time
4. All of the mentioned
Run time mapping from virtual to physical address is done by _____
1.Memory management unit
2.CPU
3.PCI
4.None of the mentioned
Swap space is allocated ______
1.as a chunk of disk
2.separate from a file system
3.into a file system
4.All of the Mentioned
Swapping requires a ________
1.motherboard
2.keyboard
3.monitor
4.backing store
The address generated by the CPU is referred to as _______
1.Physical address
2.Logical address
3.Neither physical nor logical
4.None of the mentioned
The address loaded into the memory address register of the memory is referred to as _____
1.Physical address
2. Logical address
3.Neither physical nor logical
4.None of the mentioned
The Banker’s algorithm is ________ than the resource allocation graph algorithm.
1.less efficient
2.more efficient
3.equal
4.None of the mentioned
The base register is also known as the _______
1.basic register
2.regular register
3.relocation register
4.delocation register
The content of the matrix Need is _______
1. Allocation – Available
2.Max – Available
3.Max – Allocation
4.Allocation – Max
The data structures available in the Banker’s algorithm are _____
1.Available
2.Need
3.Allocation
4.All of the Mentioned
The idea of overlays is to _______
1.data that are needed at any given time
2.enable a process to be larger than the amount of memory allocated to it
3.keep in memory only those instructions
4.All of the Mentioned
The major part of swap time is _______ time.
1.waiting
2.transfer
3.execution
4.None of the mentioned
The process to be aborted is chosen on the basis of the following factors?
1.priority of the process
2.process is interactive or batch
3.how long the process has computed
4.All of the Mentioned
The run time mapping from virtual to physical addresses is done by a hardware device called the _____
1.Virtual to physical mapper
2.Memory management unit
3.Memory mapping unit
4. none of the mentioned
The size of a process is limited to the size of ______
1.physical memory
2.external storage
3. secondary storage
4.None of the mentioned
The ________ consists of all processes whose memory images are in the backing store or in memory and are ready to run.
1. wait queue
2.ready queue
3.cpu
4.secondary storage
The _________ time in a swap out of a running process and swap in of a new process into the memory is very high.
1.context – switch
2.waiting
3.execution
4.All of the Mentioned
The ___________ must design and program the overlay structure.
1.programmer
2.system architect
3.system designer
4.None of the mentioned
The ___________ swaps processes in and out of the memory.
1. Memory manager
2. CPU
3. CPU manager
4.User
Those processes should be aborted on occurrence of a deadlock, the termination of which?
1. is more time consuming
2.incurs minimum cost
3.safety is not hampered
4.All of the mentioned
To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it _______
1.then the process waits for the resources be allocated to it
2.the process keeps sending requests until the resource is allocated to it
3.the process resumes execution without the resource being allocated to it
4.hen all resources currently being held are preempted
To _______ to a safe state, the system needs to keep more information about the states of processes.
1.abort the process
2.roll back the process
3.queue the process
4.None of the mentioned
What is Address Binding?
1.going to an address in memory
2. locating an address with the help of another address
3.binding two addresses together to form a new address in a different memory space
4.a mapping from one address space to another
What is Dynamic loading?
1. loading multiple routines dynamically
2.loading a routine only when it is called
3. loading multiple routines randomly
4.None of the mentioned
What is the advantage of dynamic loading?
1.A used routine is used multiple times
2.An unused routine is never loaded
3.CPU utilization increases
4.All of the Mentioned
What is the solution to starvation?
1.the number of rollbacks must be included in the cost factor
2.the number of resources must be included in resource preemption
3.resource preemption be done instead
4.All of the Mentioned
Which of the following is TRUE?
1.Overlays are used to increase the size of physical memory
2.Overlays are used to increase the logical address space
3. When overlays are used, the size of a process is not limited to the size of the physical memory
4.Overlays are used whenever the physical address space is smaller than the logical address space
Which one of the following is the address generated by CPU?
1.physical address
2.absolute address
3.logical address
4.None of the mentioned