
OS day 3
Authored by Skill Chaze
Computers
University
Used 1+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
9 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following page replacement algorithms suffers from Belady’s Anomaly?
Optimal replacement
LRU
FIFO
Both optimal replacement and FIFO
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
When a page is selected for replacement, and its modify bit is set ____________
the page is clean
the page has been modified since it was read in from the disk
the page is dirty
the page has been modified since it was read in from the disk & page is dirty
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
LRU page – replacement algorithm associates with each page the ______
time it was brought into memory
the time of that page’s last use
page after and before it
all of the mentioned
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
A process is thrashing if ____________
it spends a lot of time executing, rather than paging
It spends a lot of time paging than executing
it has no memory allocated to it
none of the mentioned
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Thrashing _______ the CPU utilization.
increases
keeps constant
decreases
none of the mentioned
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The DMA transfers are performed by a control circuit called as __________
Device interface
DMA controller
Data controller
Overlooker
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
After the completion of the DMA transfer, the processor is notified by __________
Acknowledge signal
Interrupt signal
WMFC signal
None of the mentioned
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?