Professional Documents
Culture Documents
Operating Systems INT2206 20 (2019-2020) : Uetots
Operating Systems INT2206 20 (2019-2020) : Uetots
Question 1 Suppose a system uses paging on demand without a Translation Look-aside Table
Correct (TLB). The memory access time is 200 nano seconds; page-fault service time is 8
miliseconds; page-fault rate is 1/1000. Which is the Effective Access Time (EAT) (in
Mark 1.00 out of
micro second) of the system?
1.00
Question 2 Suppose a system uses paging on demand without a Translation Look-aside Table
Correct (TLB). The memory access time is 200 nano seconds; page-fault service time is 9
miliseconds; page-fault rate is 1/1000. Which is the Effective Access Time (EAT) of the
Mark 1.00 out of
system?
1.00
Question 3 A system uses Translation Look-aside Buffer (TLB) for address translation in paging (1
Correct level page table). Suppose the access time of TLB is 20ms; the access time of the
memory is 200ms; and the hit rate of TLB is 84%. Which is the Effective Access Time
Mark 1.00 out of
(EAT) of the system?
1.00
251 ms
252 ms
Question 4 Suppose a system uses segmentation memory allocation. The content of the segment
Correct table (limit, base) of a process is [(1000, 1400), (400, 6300), (400, 4300), (1100, 3200),
(1000, 4700)]. Calculate the physical address of the reference (4, 106) (e.g. a number or
Mark 1.00 out of
invalid)?
1.00
Flag question
Answer: 4806
Question 5 Suppose a system uses paging on demand without a Translation Look-aside Table
Correct (TLB). The memory access time is 200 nano seconds; page-fault service time is 8
miliseconds; page-fault rate is 1/1000. Calculate the Effective Access Time (EAT) (in
Mark 1.00 out of
micro second) of the system (e.g. 7.8)?
1.00
Flag question
Answer: 8.2
Question 6 Suppose a paging system has the page fault rate=0.048%; the memory access time is:
Correct 320 nano seconds; and the page fault handling time is: 9 milli seconds. How many times
the performance is slowdown? (eg. 87).
Mark 1.00 out of
1.00
Answer: 14
Flag question
Question 7 Suppose a system uses paging with 2-level page table without Translation Look-aside
Correct Buffer (TLB). Which is INCORRECT?
Question 9 Suppose a system uses paging on demand without a Translation Look-aside Table
Correct (TLB). The memory access time is 200 nano seconds; page-fault service time is 9
miliseconds; page-fault rate is 3/1000. Which is the Effective Access Time (EAT) of the
Mark 1.00 out of
system?
1.00
Question 10 A system uses proportional memory allocation method. There are 3 processes in the
Correct system: P1, P2, P3 with the size of 138KB, 96KB, and 164KB, correspondingly.
Suppose the memory size is 180KB, and the frame size is 2KB, calculate the number of
Mark 1.00 out of
frames allocated for processes P1, P2, P3 (e.g. 23:34:12)?
1.00
Flag question
Answer: 31:22:37
Question 11 Given the 1-level page table of a process as bellow, with the frame size=1KB.
Correct
FRAME VALID
Mark 1.00 out of
1.00
Flag question
0 4 1
1 12 0
2 5 1
3 23 0
4 51 1
/
Calculate the physical address of the logical address 3874? (e.g. 1
8932 or error)
Answer: error
Question 12 Suppose a system uses paging on demand without a Translation Look-aside Table
Correct (TLB). The memory access time is 200 nano seconds; page-fault service time is 8
miliseconds; page-fault rate is 3/1000. Which is the Effective Access Time (EAT) of the
Mark 1.00 out of
system?
1.00
Question 13 Given the 1-level page table of a process as bellow, with the frame size=1KB.
Correct
FRAME VALID
Mark 1.00 out of
1.00
Flag question
0 4 1
1 12 0
2 5 1
3 23 0
4 51 1
/
Answer: 4922
Question 14 A system uses Translation Look-aside Buffer (TLB) for address translation in paging (1
Correct level page table). Suppose the access time of TLB is 20ms; the access time of the
memory is 250ms; and the hit rate of TLB is 95%. Which is the Effective Access Time
Mark 1.00 out of
(EAT) of the system?
1.00
281.5 ms
284.5 ms
Question 15 Which is NOT a dynamic allocation algorithm used in MVT and MFT systems?
Correct
Select one:
Mark 1.00 out of
1.00 Worst fit
Well fit
First fit
Question 16 Suppose a paging system has the page fault rate=0.18%; the memory access time is:
Correct 320 nano seconds; and the page fault handling time is: 6 milli seconds. How many times
the performance is slowdown? (eg. 87).
Mark 1.00 out of
1.00
Answer: 35
Flag question
Question 17 Suppose a system has 6GB RAM with paging, and the frame size is 1KB, frame number
Correct field is 4 bytes. Which is the maximum size of a page table?
24 MB
One of the algorithms does not need to search the whole free memory list to find a
suitable memory region
Flag question
Finish review
QUIZ NAVIGATION
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
Show one page at a time
Finish review