Sheet-7 (OS)
Mastering Operating Systems: A Comprehensive Quiz
Test your knowledge on operating systems with this engaging quiz designed for students and enthusiasts alike. Challenge yourself with a variety of questions covering key concepts such as virtual memory, paging, segmentation, and memory management techniques. Whether you're preparing for exams or just looking to refresh your skills, this quiz has you covered!
- 30 multiple-choice questions
- Topics include paging, segmentation, and memory management
- Ideal for students and professionals in computer science
The address of a storage location in main memory is the _______.
Address space
Virtual address space
Real address
Virtual address
_______ is the virtual storage assigned to a process.
Virtual address space
Virtual address
Real address
Address space
_______ is the range of memory addresses available to a process.
Address space
Real address
Virtual address
Virtual address space
The _______ structure indexes page table entries by frame number rather than by virtual page number.
Hash table
Segment table
Page table
Inverted page table
The _______ states the process that owns the page.
Process identifier
Control bits
Page number
Chain pointer
A _______ is issued if a desired page is not in main memory.
Paging error
Page replacement policy
Page fault
Page placement policy
_______ allows the programmer to view memory as consisting of multiple address spaces.
Paging
Locality
Segmentation
Resident set management
_______ is transparent to the programmer and eliminates external fragmentation providing efficient use of main memory.
Hashing
Paging
Segmentation
Thrashing
The _______ determines when a page should be brought into main memory.
Page fault
Fetch policy
Working set
Resident set management
With ______ pages other than the one demanded by a page fault are brought in.
Slab allocation
Thrashing
Hashing
Prepaging
The _______ policy results in the fewest number of page faults.
Optimal
FIFO
Clock
LRU
A _______ chooses only among the resident pages of the process that generated the page fault in selecting a page to replace.
Global replacement policy
Page replacement policy
Local replacement policy
Page placement policy
The _______ algorithm requires a use bit to be associated with each page in memory.
Page placement
Working set
VSWS
Page fault frequency
_______ is where modified process pages can be written out at the time of replacement, or a precleaning policy can be used, which clusters the output activity by writing out a number of pages at once.
Load control
Cleaning policy
Placement policy
Replacement policy
_______ is the concept associated with determining the number of processes that will be resident in main memory.
Virtual memory manager
Page fault frequency
LRU policy
Load Control
The size of virtual storage is limited by the actual number of main storage locations.
True
False
The addresses a program may use to reference memory are distinguished from the addresses the memory system uses to identify physical storage sites.
True
False
Most of the memory management issues confronting the operating system designer are in the area of paging when segmentation is combined with paging.
True
False
Segmentation is not visible to the programmer.
True
False
The placement policy determines where in real memory a process piece is to reside.
True
False
Virtual memory allows for very effective multiprogramming and relieves the user of the unnecessarily tight constraints of main memory.
True
False
The principle of locality states that program and data references within a process do not tend to cluster.
True
False
The smaller the page size, the greater the amount of internal fragmentation.
True
False
The design issue of page size is related to the size of physical main memory and program size.
True
False
Segments may be of unequal, indeed dynamic, size.
True
False
The page currently stored in a frame may still be replaced even when the page is locked.
True
False
The PFF policy evaluates the working set of a process at sampling instances based on elapsed virtual time.
True
False
One way to counter the potential performance problems of a variable-allocation global scope policy is to use page buffering.
True
False
A precleaning policy writes modified pages before their page frames are needed so that pages can be written out in batches.
True
False
UNIX is intended to be machine independent; therefore its memory management scheme will vary from one system to the next.
True
False
{"name":"Sheet-7 (OS)", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Test your knowledge on operating systems with this engaging quiz designed for students and enthusiasts alike. Challenge yourself with a variety of questions covering key concepts such as virtual memory, paging, segmentation, and memory management techniques. Whether you're preparing for exams or just looking to refresh your skills, this quiz has you covered! 30 multiple-choice questions Topics include paging, segmentation, and memory management Ideal for students and professionals in computer science","img":"https:/images/course3.png"}