SULIT SULIT
CONFIDENTIAL
UNIVERSITI TEKNIKAL MALAYSIA MALAYSIA MELAKA PEPERIKSAAN AKHIR SEMESTER I FINAL EXAMINATION EXAMINATION SEMESTER I
SESI 2012/2013 SESSION 2012/2013
FAKULTI TEKNOLOGI MAKLUMAT DAN KOMUNIKASI KOD MATAPELAJARAN
: DITS 2213
SUBJECT CODE
MATAPELAJARAN
: SISTEM PENGOPERASIAN
SUBJECT
OPERATING OPERATING SYSTEM
PENYELARAS
: SYARULNAZIAH ANAWAR
COORDINATOR
KURSUS
: BITC / BITS / BITD
COURSE
MASA
: 2 JAM DAN 30 MINIT
TIME
2 HOURS AND 30 MINUTES
TARIKH
:
DATE
TEMPAT
:
VENUE ARAHAN KEPADA CALON: INSTRUCTION INSTRUCTION TO CANDIDATES: CANDIDATES:
1
K!"#$ !"#$%% %&$'$ &$'$( ( )() *!(+$ !(+$(, (,-( -(+) +) 2 BAH BAHAGI AGIAN: AN: BAHAGIAN A: A: S$#- .1 %&$'$( .S)'$ $$ %!*-$ %&$'$( BAHAGIAN B: L)*$ . %&$'$( .S)'$ $$ TIGA .3 %&$'$( %$4$$ The e!" #!#e$ %&'()(*( &+ 2 PARTS, PART PART A: A: O'e -1. e(*)&' e(*)&' -Pe!(e !'(e$ ALL ALL e(*)&'(. e(*)&'(. PART PART B: F)e F)e -4. e(*)&'( e(*)&'( -Pe!(e !'(e$ !'(e$ THREE -3. e(*)&'( &'5. &'5.
2
S)'$ S)'$ $$ $$ ,) ,) ,$' ,$'$* $* -5 -5- $ $$6$ $6$( ( 7$ 7$(+ ,)% ,)%!,)$ !,)$5 5$( $( Pe!(e !'(e$ !'(e$ )' *he !'(e$ 6&&7e* #$&)8e8,
3
K!"#$% K!"# $% %&$'$ %&$'$( ( )() )() *!*6 *!*6-( -(7$ 7$)) 8!"% 8!"%)) ,)9 ,)9$ $4$ 4$%$ %$ V!"%) "%) B$4$ B$4$%$ %$ I(++! I(++!") ")%% !"* !"*-' -'$ $ ,$") ,$")6$ 6$,$ ,$ *-5$%-"$# 2 4)(++$ ; *$($5$'$ 8!"%) B$4$%$ M!'$7- !"*-'$ ,$")6$,$ *-5$%-"$# < 4)(++$ 1= The e!" #!#e$ %&'()(*( &+ 8!9!'!e e$()&', The E')(h e$()&' (*!$*( +$&" #!e 2 *& ;< he$e!( *he M!!5 e$()&' (*!$*( +$&" #!e = *& 1>,
KERTAS KERTAS SOALAN INI TERDIRI DARIPADA DARIPADA .1= MUKA SURAT SAHAJA (TERMASUK MUKA SURAT HADAPAN THIS ?UESTION PAPER CONTAINS -1>. PAGES ONLY -INCLUSIVE OF FRONT PAGE.
SULIT
SULIT (DITS 2213) PART A .2 MARKS A(%!" ALL >-!%#)&(%
(a) Define the following terminologies for memory management. You can raw a iagram to su!!ort your efinition. i. "rame (3 #ar$s) ii.
%age (3 #ar$s)
iii.
Segment (& #ar$s)
(') "ile systems !roie functions which can 'e !erforme on files. List an 'riefly e!lain FIVE (*) of the functions. (1+ #ar$s) (c) In Ta'le 1, ientify FIVE (*) grain si-e of !arallelism in multi!rocessors that iffers in the egree of granularity. (* #ar$s) T$'! 1: Synchroni-ation ranularity an %rocesses D!%?")6#)&(
%arallelism inherent in a single instruction stream #ulti!rocessing of concurrent !rocesses in a multi!rogramming enironment Distri'ute !rocessing across networ$ noes to form a single com!uting enironment #ulti!le unrelate !rocesses %arallel !rocessing or multitas$ing within a single a!!lication
PART B . MARKS A(%!" THREE .3 -!%#)&(% &('7
G"$)( %)@!
SULIT (DITS 2213) >-!%#)&( 1 .2 M$"5%
(a) Dynamic !artitioning are !artitions of a aria'le length an num'er. %rocess is allocate eactly as much memory as re/uire. i. 0!lain how each algorithm iffers in their o!eration. ( #ar$s) ii.
ase on the figure, which algorithm !erforms its 'est 4ustify your answer. (5 #ar$s)
(') 6onsier the following !age aress stream forme 'y eecuting a !rogram7 1 2 3 & * 2 1 3 3 2 3 & * & * 1 1 3 2 * 6alculate the num'er of !age faults that woul occur if the wor$ing set !olicy with "irst in "irst out ("I"8) an 8!timal !olicies were use with fie frame allocation for the !rogram of three frames. (1+ #ar$s)
>-!%#)&( 2 .2 M$"5%
a) The actual etails of is$ in!ut9out!ut (I98) o!eration e!en on the timing of is$ I98 transfer. Discuss is$ !erformance !arameters as shown in "igure 2.
F)+-"! 2: Timing of a is$ I98 transfer
(1+ #ar$s) ') The re/ueste trac$s, in the orer receie 'y the is$ scheuler are7 2: 12 11+ 1;5 1&: &1 1+ 5& 12+
SULIT (DITS 2213) S6<= is$ scheuling !olicies, ,"$ the scanning gra!h, an -%#)7 the !olicies !erformance accoring to your results.
(1* #ar$s) >-!%#)&( 3 .2 M$"5%
6onsier the following set of !rocesses7 T$'! 27 %rocess Scheuling P"&?!%%
A"")8$' T)*!
S!"8)?! T)*!
<
+
3
1
*
6
3
2
D
*
0
12
*
%erform an analysis for the set of !rocesses in Ta'le 2 to escri'e ?oun>ro'in (/@&), Shortest %rocess =et (S%=) an Shortest ?emaining Time (S?T) scheuling !olicies !erformance. In your analysis, you are re/uire to7 a) Illustrate the eecution !attern for each !olicy for one cycle. ( #ar$s)
') 0stimate the finish time an normali-e turnaroun timeA which is the ratio of turnaroun time to serice time. (15 #ar$s)
>-!%#)&( .2 M$"5%
SULIT (DITS 2213) $ In multiuser system, there is a wie ariety of access rights hae 'een use 'y
arious systems. riefly e!lain THREE (3) of them. (5 #ar$s) "ile organi-ation refers to the logical structuring of recors an is etermine 'y
the way files are accesse. 0la'orate on how to organi-e recors in a file an access a !articular recor in a file. (1+ #ar$s) ? loc$s are the unit for I98 with seconary storage. y using iagram, emonsrate
the 'loc$ing techni/ues to organi-e recors as a se/uence of 'loc$s for I98 ( #ar$s)
>-!%#)&( .2 M$"5%
a) 0!lain the ifference 'etween !erioic an a!erioic tas$ in real>time scheuling. (& #ar$s)
') 0la'orate the conce!t of B!re>em!tieC in real time scheuling. %roie an eam!le of how !re>em!tie is a!!lie to real>time scheuling to su!!ort your fact. (* #ar$s)
c) 6onsier a set of fie a!erioic tas$s with the eecution !rofiles as shown in Ta'le 3. T$'! 37 0ecution %rofile of Two
SULIT (DITS 2213) 6 D 0
2+ &+ *+ 5+
2+ 2+ 2+ 2+
2+ *+ + :+
Illustrate the scheuling of Time Tas$s 'loc$s iagram an ustify the scheuling !erformance if using7 i.
0arliest ealine for this set of tas$s. ii. 0arliest ealine with unforce ile time for this set of tas$s. ( 15 #ar$s )
>0=D>
