Trng i hc Cng ngh Thng Tin

Khoa K thut My tnh

THI S 1

MN H IU HNH
Thi gian: 120 pht
(Sinh vin c php tham kho ti liu , cn b coi thi khng gii thch g thm)
Cu 1
Gia thit P1 ,P2 ,P3 ,P4 va P5 cung ti luc v:
Process
Burst Time
P1
10
P2
29
P3
3
P4
7
P5
12
V s Gannt v cho bit thi gian p ng trung bnh (average response time) cho cc
tin trnh trong giai thut nh thi :
a) FCFS
b) SJF (non preemptive scheduling)
c) RR vi quantum = 10
Cu 2
a) Semaphore l g ? Phn loi ? Cch s dng ?
b) Giai quyt bi ton c in b m c gii hn vi semaphore
(ch r cch s dng tng loi).
Cu 3
Cho 5 processes P0 P4;
H thng c 3 loi ti nguyn: A (10 instances), B (5 instances), and C (7 instances).
Ti thi im T0:
Allocation
Max
Available
ABC
ABC
ABC
P0
010
753
332
P1
200
322
P2
302
902
P3
211
222
P4
002
433
a) H thng c an ton khng, ti sao ?
b) Ti thi im T1: P4 yu cu (3,3,0), h thng s nh th no ?
Cu 4
Cho h thng demand paging vi 3 frame v chui tham chiu nh sau vi 8 page:
7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1,7, 0, 1
Gia s b nh ban u trng, cho bit qu trnh thay th trang nh vi cc giai thut:
a) FIFO
b) Optimal
c) LRU
Ht

Trng i hc Cng ngh Thng Tin

Khoa K thut My tnh
THI S 2

MN H IU HNH
Thi gian: 120 pht
(Sinh vin c php tham kho ti liu , cn b coi thi khng gii thch g thm)
Cu 1
Gia thit P1 ,P2 ,P3 ,P4 va P5 cung ti luc v:
Process
Burst Time
P1
29
P2
10
P3
7
P4
3
P5
12
V s Gannt v cho bit thi gian p ng trung bnh (average response time) cho cc
tin trnh trong giai thut nh thi :
d) FCFS
e) SJF (non preemptive scheduling)
f) RR vi quantum = 10
Cu 2
c) Semaphore l g ? Phn loi ? Cch s dng ?
d) Giai quyt bi ton c in Readers v Writers vi semaphore
(ch r cch s dng tng loi).
Cu 3
Cho 5 processes P0 P4;
H thng c 3 loi ti nguyn: A (10 instances), B (5 instances), and C (7 instances).
Ti thi im T0:
Allocation
Max
Available
ABC
ABC
ABC
P0
010
753
332
P1
200
322
P2
302
902
P3
211
222
P4
002
433
c) H thng c an ton khng, ti sao ?
d) Ti thi im T1: P0 yu cu (0,2,0), h thng s nh th no ?
Cu 4
Cho h thng demand paging vi 3 frame v chui tham chiu nh sau vi 8 page:
7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1,7, 0, 1
Gia s b nh ban u khng trng, c bao nhiu li trang (page fault) xay ra nu qu
trnh thay th trang nh vi cc giai thut:
d) FIFO
e) Optimal
f) LRU
Ht -