n tp gia kz

Thi gian : 60

Chng 1
nh ngha H iu Hnh Mt s cc khi nim:
HH dnh cho mainframe HH dnh cho my server HH dnh cho PC HH dnh cho PDA HH dnh cho my chuyn bit

Chng 1
Mt s cc khi nim (tt):
H thng x l theo l. H thng a chng. H thng chia s thi gian H thng song song
i xng Bt i xng

H thng phn tn
Client/server Peer to peer.
3

Chng 2
Cc thnh phn ca h iu hnh:
Qun l qu trnh. Qun l b nh chnh. Qun l file. Qun l h thng I/O. Qun l h thng lu tr th cp. H thng bo v. H thng thng dch lnh
4

Chng 2
Cc dch v h iu hnh cung cp. Cc chng trnh h thng. Cu trc h thng:
Cu trc n gin. Cu trc phn tng. Cu trc vi nhn. u im & khuyt im.

My o: u im, cng dng.

5

Chng 3
Phn bit chng trnh & qu trnh Mt qu trnh gm c cc thnh phn no? Cc trng thi ca process:
Khi to: vng nh, quan h cha con. Kt thc: OS user.

2 loi qu trnh:
Qu trnh hng I/O Qu trnh hng CPU

B nh thi trung gian.

6

Chng 3
To process: void main(){ printf (hi);//1 fork (); fork ();//2 fork (); printf (Hello); fork (); printf (Bye); } Hi chng trnh in ra cc dng ch no trn mn hnh.
7

Chng 3
C ch ng b ha gia cc process. Thng tin v thread.

Chng 4
Dispatcher Cc thng s:
thi gian p ng thi gian quay vng thi gian ch thng lng

Ch quyt nh:
preemptive non preemptive
9

Chng 4
Cc gii thut nh thi:
FCFS Shortest-Job-First(SJF) Priority Scheduling Round robin

Preemptive: SJF, Priority Scheduling. B nh chnh c nhiu hng i:

n x l tun t a x l song song u tin quay vng
10

11