OSG202 TL4, OSG202 TL6, OSG202
version 4, OSG202
version 3, OSG202 version 2,
OSG202 v ersion 1
final - have a nice quizz
Operating System (Trường Đại
học FPT)
,
, OSG202 TL4, OSG202 TL6, OSG202 version 4, OSG202
version 3, OSG202 version 2, OSG202 version 1
Học trực tuyến tại quizlet.com/_3l0m1p
1. d Which strategy is a simplest design for speeding up
Paging? Page table is loaded into registers
Page table is loaded into main memory
Page table is loaded into disk
Page table is loaded into TLB
2. c The____policy is based on the theory that the best page to remove is the one that has been in memory the longest
NRU
LRU
FIFO
LIFO
3. a The page table for each process maintains:
The page frame location for each page of the process
The page location for each frame of the process
The physical memory location of the process
None of the other choices
4. d Assume that process A-D make up the set of runnable processes on memory
as B1 B2 B3 A1 A2 A5 A7 D3 D4 D6 C1 C6 C5.
Suppose D gets a page fault.
Which page is replaced using the local policy? Assume that the replaced page is always a last
page. D6
B3
C5
None of the others
5. a Which of the following information bits in the entry of page table is used to indicate what kinds of access are
permitted? Present/absent bit
Caching disabled
Protection bit
Modified bit
6. d Which of the following is appropriate to determine program size and create page
table? Process creation
Process execution
Page fault time
Process termination time
7. d One of the most important innovations of demand paging was that it made____feasible
Memory
demand Virtual
demand Virtual
paging Virtual
memory.
8. c Which of the following statements is incorrect about Translation Look-aside Buffer (TLB)?
TLB only maintains a subset of the entries stored in the full memory-based page
table When there is a TLB miss the system needs to access the page table
The use of TLB eliminates the need for keeping a page table in
memory None of the other choices
9. a Page replacement algorithms determine
When the system should update page table entries
How many pages should be added to main memory
Which pages should be brought into memory because a process is likely to reference them soon
Which page to remove to provide space for an incoming page
, 10. b When a virtual memory system manages memory in fixed length units, which of the following terms correctly represents its
unit? Frame
Page
Block
Segment
11. a Which of these statements about the algorithm "Worst fit" is true?
Memory Manager scans along the list of segments until it finds a hole that is big enough.
Memory Manager starting searching the list of segments from the place where it left off last
time.
Memory Manager searches the entire list of segments from beginning to end and take smallest hole that is adequate.
None of the other choices
12. d Which of following statements about the memory hierarchy is false?
Small amount of fast expensive memory - cache
Some medium-speed medium price main
memory Gigabytes of slow cheap disk storage
None of the other choices
13. c Which of these statements about the algorithm "Best fit" is true?
Memory Manager scans along the list of segments until it finds a hole that is big enough.
Memory Manager starting searching the list of segments from the place where it left off last
time.
Memory Manager searches the entire list of segments from beginning to end and take smallest hole that is adequate.
None of the other choices
14. a Which is not true about "Backing up pages
dynamically"? Pages do not have fixed swap area on
the disk
Requires a disk map in memory
When a page is swapped out, an empty disk page is chosen on the fly and disk map is updated
accordingly Needs less main memory than the method "Paging to a static swap area"
15. c The task of subdividing memory between the OS and processes is performed automatically by the OS and is
called: Protection
Relocation
Memory Management
All of the other choices
16. b Working set model is used for:
Finding the minimum number of frames necessary for a job so that jobs can be run without
"thrashing" Finding the average number of frames a job will need to run smoothly
Determining whether page replacement is
needed All of the other choices
17. c The actual location in main memory is called
a(n): Relative address
Logical address
Absolute
address
None of the other choices
18. b In terms of storage utilization the best method of Dynamic Storage Allocation is:
Next fit
First fit
Best fit
Worst fit
19. b The page size that is too small will generate ____
Excessive internal fragmentation
Very long Page tables
More difficult to calculate actual
position Excessive external
fragmentation
version 4, OSG202
version 3, OSG202 version 2,
OSG202 v ersion 1
final - have a nice quizz
Operating System (Trường Đại
học FPT)
,
, OSG202 TL4, OSG202 TL6, OSG202 version 4, OSG202
version 3, OSG202 version 2, OSG202 version 1
Học trực tuyến tại quizlet.com/_3l0m1p
1. d Which strategy is a simplest design for speeding up
Paging? Page table is loaded into registers
Page table is loaded into main memory
Page table is loaded into disk
Page table is loaded into TLB
2. c The____policy is based on the theory that the best page to remove is the one that has been in memory the longest
NRU
LRU
FIFO
LIFO
3. a The page table for each process maintains:
The page frame location for each page of the process
The page location for each frame of the process
The physical memory location of the process
None of the other choices
4. d Assume that process A-D make up the set of runnable processes on memory
as B1 B2 B3 A1 A2 A5 A7 D3 D4 D6 C1 C6 C5.
Suppose D gets a page fault.
Which page is replaced using the local policy? Assume that the replaced page is always a last
page. D6
B3
C5
None of the others
5. a Which of the following information bits in the entry of page table is used to indicate what kinds of access are
permitted? Present/absent bit
Caching disabled
Protection bit
Modified bit
6. d Which of the following is appropriate to determine program size and create page
table? Process creation
Process execution
Page fault time
Process termination time
7. d One of the most important innovations of demand paging was that it made____feasible
Memory
demand Virtual
demand Virtual
paging Virtual
memory.
8. c Which of the following statements is incorrect about Translation Look-aside Buffer (TLB)?
TLB only maintains a subset of the entries stored in the full memory-based page
table When there is a TLB miss the system needs to access the page table
The use of TLB eliminates the need for keeping a page table in
memory None of the other choices
9. a Page replacement algorithms determine
When the system should update page table entries
How many pages should be added to main memory
Which pages should be brought into memory because a process is likely to reference them soon
Which page to remove to provide space for an incoming page
, 10. b When a virtual memory system manages memory in fixed length units, which of the following terms correctly represents its
unit? Frame
Page
Block
Segment
11. a Which of these statements about the algorithm "Worst fit" is true?
Memory Manager scans along the list of segments until it finds a hole that is big enough.
Memory Manager starting searching the list of segments from the place where it left off last
time.
Memory Manager searches the entire list of segments from beginning to end and take smallest hole that is adequate.
None of the other choices
12. d Which of following statements about the memory hierarchy is false?
Small amount of fast expensive memory - cache
Some medium-speed medium price main
memory Gigabytes of slow cheap disk storage
None of the other choices
13. c Which of these statements about the algorithm "Best fit" is true?
Memory Manager scans along the list of segments until it finds a hole that is big enough.
Memory Manager starting searching the list of segments from the place where it left off last
time.
Memory Manager searches the entire list of segments from beginning to end and take smallest hole that is adequate.
None of the other choices
14. a Which is not true about "Backing up pages
dynamically"? Pages do not have fixed swap area on
the disk
Requires a disk map in memory
When a page is swapped out, an empty disk page is chosen on the fly and disk map is updated
accordingly Needs less main memory than the method "Paging to a static swap area"
15. c The task of subdividing memory between the OS and processes is performed automatically by the OS and is
called: Protection
Relocation
Memory Management
All of the other choices
16. b Working set model is used for:
Finding the minimum number of frames necessary for a job so that jobs can be run without
"thrashing" Finding the average number of frames a job will need to run smoothly
Determining whether page replacement is
needed All of the other choices
17. c The actual location in main memory is called
a(n): Relative address
Logical address
Absolute
address
None of the other choices
18. b In terms of storage utilization the best method of Dynamic Storage Allocation is:
Next fit
First fit
Best fit
Worst fit
19. b The page size that is too small will generate ____
Excessive internal fragmentation
Very long Page tables
More difficult to calculate actual
position Excessive external
fragmentation
