WorksheetsQuiz 3
Total questions: 15
Worksheet time: 8mins
What is meant by 'processor scheduling policy'?
Selecting a memory location for a process
Adding a processor to the system
Deciding which process to run at given time
None
Mark the incorrect statement.
Scheduling policy should maximize the throughput.
Latency is the time each process waits before executing
Multiprogramming increases the efficiency of the system.
A scheduling policy should minimize the throughput.
High level scheduling policy determines
which jobs the system allows to compete actively for system resources.
which processes shall be allowed to compete for processors.
which active process the system will assign to a processor when one next becomes available.
None
A scheduling policy is preemptive, if
A scheduling policy is preemptive, if
the system can remove the processor from the process it is running.
once the system has assigned a processor to a process, the system can not remove that processor from that process.
it minimizes the latency
The purpose of maintaining a memory hierarchy is
Increase the efficiency and storage capacity
Decrease the throughput
Allocate more jobs to processor
Increase the CPU utilization
Temporal Locality means
Temporary locate the process
Many processes that access data and instructions once are likely to access them again in the future
Temporary locate the memory
None
Three memory management strategies are
First fit, Best fit and Worst fit
Low level, Intermediate level and high level
Fetch, Placement, Replacement
Secondary, Primary and Cache
Internal fragmentation can be seen in
Single user contiguous memory allocation
Fixed partition multiprogramming
Variable partition multiprogramming
Low level scheduling
Disadvantage in Fixed partition multiprogramming is
CPU is idle
A job had its precise location in memory determined before it was launched and could run only in a specific partition.
I/O device resources are wasted.
Low throughput
Solutions for external fragmentation are
Coalescing, memory compaction
Booting
Merging
None
In which memory management strategy, time will be saved?
Best Fit
Worst Fit
First Fit
Good Fit
Time of transferring in memory swapping, will be proportionate to
Capacity of the backing store
No of partitions
Amount of memory swapped
None
Which CPU scheduling will determine the degree of multiprogramming in the computer system?
High Level Scheduling
Low Level Scheduling
Intermediate Level Scheduling
CPU scheduling
Best Fit and Worst Fit strategies will consume time for sorting the available holes in the memory.
Yes
No
Internal Fragmentation occurs in variable partition multiprogramming.
Yes
No
