Quiz
os 10
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (23)
1Which of the following is a benefit of allowing a program that is only partially in memory to execute?
- APrograms can be written to use more memory than is available in physical memory.
- BCPU utilization and throughput is increased.
- CLess I/O is needed to load or swap each user program into memory.
- DAll of the above
2In systems that support virtual memory, ____.
- Avirtual memory is separated from logical memory.
- Bvirtual memory is separated from physical memory.
- Cphysical memory is separated from secondary storage.
- Dphysical memory is separated from logical memory.
3The vfork() system call in UNIX ____.
- Aallows the child process to use the address space of the parent
- Buses copy-on-write with the fork() call
- Cis not intended to be used when the child process calls exec() immediately after creation
- Dduplicates all pages that are modified by the child process
4Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are
three frames within our system. Using the FIFO replacement algorithm, what is the number of page faults for the given reference string?- A14
- B8
- C13
- D10
5Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. Using the FIFO replacement algorithm, what will be the final configuration of the three frames following the execution of the given reference string?
- A4, 1, 3
- B3, 1, 4
- C4, 2, 3
- D3, 4, 2
6Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. Using the LRU replacement algorithm, what is the number of page faults for the given reference string?
- A14
- B13
- C8
- D10
7Given the reference string of page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and a system with three page frames, what is the final configuration of the three frames after the LRU algorithm is applied?
- A1, 3, 4
- B3, 1, 4
- C4, 1, 2
- D1, 2, 3
8Belady's anomaly states that ____.
- Agiving more memory to a process will improve its performance
- Bas the number of allocated frames increases, the page-fault rate may decrease for all page replacement algorithms
- Cfor some page replacement algorithms, the page-fault rate may decrease as the number of allocated frames increases
- Dfor some page replacement algorithms, the page-fault rate may increase as the number of allocated frames increases
9Optimal page replacement ____.
- Ais the page-replacement algorithm most often implemented
- Bis used mostly for comparison with other page-replacement schemes
- Ccan suffer from Belady's anomaly
- Drequires that the system keep track of previously used pages
10In the enhanced second chance algorithm, which of the following ordered pairs represents a page that would be the best choice for replacement?
- A(0,0)
- B(0,1)
- C(1,0)
- D(1,1)
11The _____ allocation algorithm allocates available memory to each process according to its size.
- Aequal
- Bglobal
- Cproportional
- Dslab
12The ____ is the number of entries in the TLB multiplied by the page size.
- ATLB cache
- Bpage resolution
- CTLB reach
- Dhit ratio
13________ allows the parent and child processes to initially share the same pages, but when either process modifies a page, a copy of the shared page is created.
- Acopy-on-write
- Bzero-fill-on-demand
- Cmemory-mapped
- Dvirtual memory fork
14_____ is the algorithm implemented on most systems.
- AFIFO
- BLeast frequently used
- CMost frequently used
- DLRU
15_____ occurs when a process spends more time paging than executing.
- AThrashing
- BMemory-mapping
- CDemand paging
- DSwapping
16Windows uses a local page replacement policy _____.
- Awhen a process exceeds its working set minimum
- Bwhen a process exceeds its working set maximum
- Cwhen the system undergoes automatic working set trimming
- Dunder all circumstances
17Which of the following statements is false with regard to Solaris memory management?
- AThe speed at which pages are examined (the scanrate) is constant.
- BThe pageout process only runs if the number of free pages is less than lotsfree.
- CAn LRU approximation algorithm is employed.
- DPages selected for replacement may be reclaimed before being placed on the free list.
18What size segment will be allocated for a 39 KB request on a system using the Buddy system for kernel memory allocation?
- A39 KB
- B42 KB
- C64 KB
- DNone of the above
19Which of the following statements is false with regard to allocating kernel memory?
- ASlab allocation does not suffer from fragmentation.
- BAdjacent segments can be combined into one larger segment with the buddy system.
- CBecause the kernel requests memory of varying sizes, some of which may be quite small, the system does not have to be concerned about wasting memory.
- DThe slab allocator allows memory requests to be satisfied very quickly.
20The _____ is an approximation of a program's locality.
- Alocality model
- Bworking set
- Cpage fault frequency
- Dpage replacement algorithm
21______ allows a portion of a virtual address space to be logically associated with a file.
- AMemory-mapping
- BShared memory
- CSlab allocation
- DLocality of reference
22Systems in which memory access times vary significantly are known as __________.
- Amemory-mapped I/O
- Bdemand-paged memory
- Cnon-uniform memory access
- Dcopy-on-write memory
23Which of the following is considered a benefit when using the slab allocator?
- AMemory is allocated using a simple power-of-2 allocator.
- BIt allows kernel code and data to be efficiently paged.
- CIt allows larger segments to be combined using coalescing.
- DThere is no memory fragmentation.
Information
- Description
- Quiz on os 10, created by Adam Whiteside on 24/04/2019.
- Author
- Adam Whiteside
- Language
- English
- Views
- 38
- History
- Created on 24 Apr 2019 · updated on 24 Apr 2019
- Rating
- No ratings yet Rate this quiz