n tp

1. H thng gm 4 qu trnh v 5 loi ti nguyn. Hy tnh gi tr ti thiu ca X

h thng trng thi an ton.
Bit trng thi cp pht v yu cu ti nguyn c cho trong bng sau
Allocate

Maximum

10211

11213

20111

22211

11010

21310

11110

11221

Need

Available

d
00x11

2. Mt h thng c 2 qu trnh v 3 thc th ti nguyn. Mi qu trnh yu cu ti

a 2 thc th. Deadlock c tn ti khng?
3. Gi s mi qu trnh c cp pht khng gian nh c kch thc 32768 bytes.
Mt qu trnh A yu cu c cp pht vng nh nh sau: text: 10284 bytes, data:
9786 bytes, stack: 11770 bytes.
a. Hy tnh s trang nh c cp ti a cho mi qu trnh nu kch thc mi
trang l 4096 bytes.
b. H thng c th p ng ton b yu cu ca qu trnh A ti cng mt thi
im khng nu kch thc mi trang l 4096 bytes?
c. Nu kch thc mi trang nh l 512 bytes, th s trang nh cn cp pht
cho stack l?
d. H thng c th p ng ton b yu cu ca qu trnh ti cng mt thi
im khng nu kch thc mi trang l 512 bytes?
4. Mt partition a c kch thc 256M c format vi h thng tp tin FAT. Mi
block a chim 1M.
a. Tnh kch thc mt entry ca bng FAT v t tnh kch thc ca bng
FAT.

b. Cho thng tin ca mt tp tin nh bn di. Hy xc nh cc block a cha

ni dung ca tp tin.
1. File name 2. 1st block
3. toto.txt
4. 7
Bit bng FAT c ni dung nh sau:
0

5 end-of-file
6

..

..

5. Cho bit mt block a chim 4KB, mi entry chim 4B. Gi s mt i-node c

th cha 12 pointer tr ti cc data block, 1 pointer tr ti indirect block, 1 pointer
tr ti double indirect block, v 1 pointer tr ti 1 triple indirect block.
a. Hy tnh kch thc ti a m mt tp tin c th c.
b. Xc nh s con tr ca i-node cn s dng cho tp tin toto.txt cu 3.
c. Bao nhiu free block c s dng cp pht cho tp tin c kch thc ti
a cu a.
6. Cho chui tham chiu trang nh di y:

021301401234
a. Hy tnh s li trang khi s dng gii thut Clock vi 3 frame trng.

b. c lng gi tr Hit ratio tng ng vi hai gii thut.

7. Cho bng d liu di y:
Virtual page Valid Physical page
0
No
1
No
2
Yes
1
3
No
4
Yes
3
5
No
6
Yes
0
7
Yes
2
Kch thc mi trang nh l 2K. Mt qu trnh c cp pht 4 frame.
a. Hy xc nh khong a ch lun l cho mi trang.
b. Hy xc nh cc a ch lun l c th gy li trang.
c. Xc nh a ch vt l cho cc a ch lun l sau: 8500, 14000, 5000, 2100.
8. Cho hai qu trnh P0 v P1. Bin turn c khi to gi tr 0. on m ca P0
c trnh by nh sau:
..
while (turn != 0) { } /* Do nothing and wait. */
Cr itical Section /* . . . */
tur n = 0;
.
Vi P1, thay 0 bi 1 vi on code trn. Gii php trn c tho mn bi ton loi
tr tng h khng?

9. Cho 5 qu trnh v cc thng tin ndh sau:

Process

Burst Time Priority

Arrival time

P1

10

P2

P3

P4

4 (highest)

Ps

a. Hy v gin Gantt biu din s thc thi ca cc qu trnh trn vi cc gii

thut nh thi preemptive Priority, Round Robin (q=2), SRTF, SJF.
b. Hy tnh thi gian quay vng trung bnh ca cc qu trnh tng ng vi cc
gii thut nh thi trn.
10. Cho cc qu trnh nh bng di y:
Process

Arrival Time

P1

0.0

P2

0.4

P3

1.0

Burst Time (ms)

Gi thit CPU s trng thi idle 1ms u tin, sau gii thut SJF c s
dng nh thi cc qu trnh.

11. C 5 qu trnh hng i ready. Thi gian CPUburst ca cc qu trnh ln lt nh sau: 9,6,3,5, X.
Cc qu trnh nn c thc hin theo th t no
gim thi gian p ng trung bnh?
12. Thun li v bt li ca vic hin thc thread
trong user space?

13. Gii php Peterson c th vn dng cho

bi ton ng b khi nh thi theo ch
quyt nh preemptive khng? Nu theo ch
quyt nh non-preemptive th s nh th
no?
14. C li xy ra khng khi thanh ghi base v
thanh ghi limit c cng gi tr?
15. Mt h thng c khng gian a ch 32-bit v kch thc mi trang l 8KB.
Bng phn trang s c np vo b nh khi qu trnh bt u thc thi. Np mi
entry ca bng phn trang mt 100nsec. Nu mi qu trnh thc thi 100msec, bao
gm c thi gian np bng phn trang, thi gian CPU c dnh ring cho vic
np bng phn trang l bao nhiu?