NEW
Font size
WorksheetsMemory Management and Disk Scheduling Quiz
Total questions: 40
Worksheet time: 20mins
In paging, each process is divided into fixed-size blocks called:
Segments
Pages
Frames
Blocks
Which of the following reduces external fragmentation?
Fixed partitioning
Variable partitioning
Paging
Swapping
The memory unit that translates logical addresses to physical addresses is called:
CPU
ALU
Memory Management Unit (MMU)
DMA
The time taken to position the disk arm over the required track is called:
Latency
Access time
Seek time
Rotational delay
Which algorithm prevents deadlock by allocating resources only if it leaves the system in a safe state?
Deadlock Detection
Deadlock Prevention
Banker’s Algorithm
Resource Preemption
Logical address space is generated by:
CPU
MMU
Disk Controller
I/O System
In variable partition allocation, external fragmentation occurs due to:
Variable size processes
Fixed-size memory
Paging
Stack overflow
The process of transferring entire processes between main memory and backing store is called:
Paging
Fragmentation
Swapping
Scheduling
The “hold and wait” condition means a process is:
Holding no resource
Holding some resources and waiting for others
Waiting for CPU
In ready state
Deadlock prevention ensures that:
At least one necessary condition is violated
All resources are preempted
Processes terminate
System stops requests
In disk scheduling, which algorithm gives the shortest average seek time?
FCFS
SSTF
C-SCAN
LOOK
Rotational delay is the time:
To locate track
For disk to rotate to correct sector
For head movement
For read/write operation
Segmentation divides memory based on:
Equal blocks
Fixed sizes
Logical divisions
Random sizes
Which of the following is not part of the memory hierarchy?
Cache
Registers
ALU
Magnetic Disk
The main goal of disk scheduling is to:
Minimize CPU usage
Maximize memory
Reduce seek time
Avoid fragmentation
The wait-for graph is used in:
Deadlock prevention
Deadlock detection
Deadlock recovery
Deadlock avoidance
Caching improves performance because:
It increases disk access time
It stores frequently used data
It compresses data
It increases CPU speed
Buffering is required because:
I/O devices and CPU operate at different speeds
Disk speed is same as CPU
To reduce deadlock
To compact memory
The SCAN algorithm is also known as:
Elevator Algorithm
Rotational Method
Random Access
Head Movement Scheme
Deadlock avoidance requires:
No resources
Infinite memory
Prior knowledge of resource requirements
Preemptive scheduling
Segmentation with paging eliminates:
Internal fragmentation
External fragmentation
Both A and B
None
The main disadvantage of swapping is:
High disk I/O overhead
Reduces fragmentation
Improves speed
Decreases memory size
In Banker’s Algorithm, a system is safe if:
There exists a safe sequence
Resources are free
All processes are blocked
CPU is idle
To recover from deadlock, the system may:
Abort all processes
Preempt resources
Use rollback or process termination
All of the above
In segmentation with paging, each segment is divided into:
Frames
Pages
Blocks
Fields
The optimal page replacement algorithm requires:
Past references
Future knowledge of references
Random choice
FIFO order
If each segment is stored in non-contiguous locations, the OS uses:
Segment table with page tables
Page table only
Inverted table
Register map
A resource allocation graph has a cycle only if:
System is safe
Deadlock is possible
No resources allocated
System idle
When deadlock detection is used, the OS must:
Periodically test for cycles
Use Banker's algorithm
Terminate processes immediately
Ignore waits
Which disk scheduling algorithm may cause starvation?
FCFS
SCAN
SSTF
LOOK
Caching differs from buffering because caching:
Stores copies of data for faster access
Synchronizes I/O
Holds data temporarily during transfer
Compresses data
The system is said to be in a deadlock state when:
Processes wait indefinitely for resources
CPU stops
All processes terminate
Memory full
Disk throughput can be maximized by:
Minimizing seek and rotational delay
Increasing track distance
Slowing disk
Fragmenting files
Deadlock prevention technique that denies "Hold and Wait" condition requires:
Processes to request all resources at once
Preemption
Resource ordering
Rollback
If a process requests resources exceeding declared maximum, the system:
Denies request (Banker’s Algorithm)
Grants request
Swaps process
Detects deadlock
In segmentation, a logical address consists of:
Segment number and offset
Page number only
Offset only
Frame number
In paging, the page table is stored in:
Main memory
Cache
Disk
Registers only
The main objective of rotational optimization is to:
Reduce latency time
Increase seek time
Minimize buffer use
Allocate more memory
In deadlock detection using Resource Allocation Graph, edges are removed when:
Process releases a resource
Process requests
Process terminates
New process arrives
A system becomes unsafe in Banker’s Algorithm when:
No safe sequence exists
Processes request resources
Resources exceed max
All processes waiting
