OS The Linux System
Which of the following page replacement algorithms suffers from Belady’s Anomaly?
Optimal replacement
LRU
FIFO
Both optimal replacement and FIFO
FIFO
Related posts
In the Many to Many models when a thread performs a blocking system call ___________A. other threads are strictly prohibited from running
B. other threads are allowed to run
C. other threads only from other processes are allowed to run
D. none of the mentioned
The first process launched by the linux kernel is ___________
A. init process
B. zombie process
C. batch process
D. boot process
If the memory access time is denoted by ‘ma’ and ‘p’ is the probability of a page fault (0 <= p <= 1). Then the effective access time for a demand paged memory is ____________
A. p x ma + (1-p) x page fault time
B. ma + page fault time
C. (1-p) x ma + p x page fault time
D. none of the mentioned
Thread synchronization is required because ___________
A. all threads of a process share the same address space
B. all threads of a process share the same global variables
C. all threads of a process can share the same files
D. all of the mentioned
When a process begins execution with no pages in memory?
A. process execution becomes impossible
B. a page fault occurs for every page brought into memory
C. process causes system crash
D. none of the mentioned
A process can be ___________
A. single threaded
B. multithreaded
C. both single threaded and multithreaded
D. none of the mentioned
If working set window is too large ____________
A. it will not encompass entire locality
B. it may overlap several localities
C. it will cause memory problems
D. none of the mentioned
Leave a Reply