- Type
- Quiz
- Course
- CS604 Operating Systems
- Size
- PDF 657 KB
- Updated
- 23 Oct 2026
You get 3 free files a day on the website. Add the Chrome extensionSign in with the extension for 30 a day.
Preview text
Text from pages 2, 3, 4 of 27. Download the file for all 27 pages.
For some page replacement algorithms, the page fault rate may increase as the number of allocated frames __________. A. Constant
B. Increased Page 202
C. Decreased D. All of the given
In ______ allocation scheme number of frames allocated to a process is proportional to its size . A. Fixed Allocation B. Priority Allocation
C. Proportional Allocation Page 205
D. None of the given options
In a UNIX system,__________ system call can be used to request the operating system to memory map an opened file. A. fork ( ) B. exec( ) C. read( )
D. mmap( ) Page 195
--------------refers to the situation when free memory space exists to load a process in the memory but the space is not contiguous. A. Swapping B. Segmentation C. Internal fragmentation
D. External Fragmentation Page 162
In case of thrashing if CPU utilization is too low the operating system ______ the degree of multiprogramming. A. Decreases
B. Increases Page 208
C. None of the given options D. sometimes increases and sometimes decreases
----------holds the smallest legal physical memory address for a process A. Index register B. Limit register
C. Base register Page 10
D. Stack pointers register
A process is _____________if it is spending more time on paging A. Paging
B. Thrashing Page 207
C. Fixed Allocation D. Demand paging
Each page is a power of -------- bytes long in paging scheme. A. 3 B. 5 C. 4
D. 2 Page 167
An optimal page-replacement algorithm has the lowest page fault rate of all algorithms.
True Page 199
False
Segmentation is a memory management scheme that supports
A. None of the given B. System’s view of memory C. Hardware’s view of memory
D. Programmer’s view of memory Page 175
This __________ algorithm is based on the locality of reference concept. A. All of above B. Page Buffering Algorithm
C. Least Frequently Used (LFU) Page 203
D. Most Frequently Used (MFU)
___________ is a memory management scheme that supports programmer’s view of Memory. A. Stack B. Assembly
C. Segmentation Page 175
D. Fragmentation
Overlays are implemented by the _________________ A. Shell B. Kernel
C. Programmer Page 156
D. Operating system
In __________ scheme free frames are equally divided among processes.
A. Fixed Allocation Page 204
B. Priority Allocation C. Proportional Allocation D. None of the given options
We want a page replacement algorithm with the _____________ pagefault rate.
A. Lowest Page 198
B. Normal C. Highest D. None of the given
Related CS604 files
All CS604 files →- CS604 Handouts by VUBuddy Handout PDF 5.8 MB
- CS604 Final Term Past Papers File 1 by Waqar Siddhu Final term PDF 4 MB
- CS604 Slides Lectures 1-45 Quiz RAR 30.7 MB
- CS604 Quiz 4 MCQs by Waqas Qureshi MCQs PDF 3.5 MB
- CS604 MCQs with References by Miss Kazmi MCQs PDF 280 KB
- CS604 Final Term Quiz 4 Quiz PDF 4 MB
Get more out of VUBuddy, for free
- Unlimited downloads
- The explanation behind every MCQ answer
- Study offline on slow data
- 30 downloads a day instead of 3
- Sign in and buy Pro Semester here
One Pro Semester membership works in both the extension and the app.