UETOTS Nguyễn Quang Huy
Operating systems INT2206 20 (2019-2020)
Home ► My courses ► Operating Systems ► S2_NT220620_20_1920 ► 7 June - 13 June ►
Bài kiểm tra chương 5-6
Started on Sunday, 31 May 2020, 3:00 PM
State Finished
Completed on Sunday, 31 May 2020, 3:22 PM
Time taken 22 mins 19 secs
Marks 20.00/20.00
Grade 10.00 out of 10.00 (100%)
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
Flag question Select one:
8.5 micro seconds
8.4 micro seconds
8.2 micro seconds
8.3 micro seconds
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
Flag question Select one:
7.2 micro seconds
6.2 micro seconds
8.2 micro seconds
9.2 micro seconds
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
Flag question Select one:
250 ms
/
253 ms
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?
Mark 1.00 out of
Select one:
1.00
The address register is split as follows: p1, p2, d, where p1 spans m bits, p2 spans
Flag question
n bits, d spans k bits
It takes 3 memory accesses for a reference
The physical address of a reference is f1*2m+f2*2n+d, where f1 and f2 are the
values from outer and inner page tables, correspondingly
A reference has the form of (p,d)
Question 8 Which is INCORRECT about paging (1-level page table)?
Correct
Select one:
Mark 1.00 out of
1.00 The system finds n consecutive frames such that n * frame_size is greater than or
equal process size
Flag question
/
There is internal fragmentation
Memory is divided into equal frames
The system finds n frames such that n * frame_size is greater than or equal process
size
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
Flag question Select one:
28.2 micro seconds
26.2 micro seconds
27.2 micro seconds
29.2 micro seconds
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
Flag question Select one:
25.2 micro seconds
24.2 micro seconds
27.2 micro seconds
26.2 micro seconds
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
Calculate the physical address of the logical address 826? (e.g. 18
932 or error)
/
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
Flag question Select one:
283.5 ms
282.5 ms
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
Flag question Best 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?
Mark 1.00 out of
Select one:
1.00
8 MB
Flag question
32 MB
16 MB
24 MB
Question 18 Which is INCORRECT about dynamic allocation algorithms?
Correct
Select one:
/
Mark 1.00 out of They are called whenever a new process arrives
1.00
They are only used in MFT systems
Flag question
Their task is to find a suitable memory region to load the process into
One of the algorithms does not need to search the whole free memory list to find a
suitable memory region
Question 19 Given the reference string: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5. Suppose the Optimal (page
Correct replacement) algorithm) is used (with 4 frames), calculate the total page faults?
Mark 1.00 out of
1.00 Answer: 6
Flag question
Question 20 Given the reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1. Optimal (page
Correct replacement) algorithm) is used (with 3 frames), calculate the total page faults?
Mark 1.00 out of
1.00 Answer: 9
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
You are logged in as Nguyễn Quang Huy (Log out)
S2_NT220620_20_1920
