DITS 2213 Final Exam OS

SULIT
SULIT
CONFIDENTIAL
UNIVERSITI TEKNIKAL MALAYSIA MELAKA

PEPERIKSAAN AKHIR SEMESTER I
FINAL 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 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 TO CANDIDATES:
1.
Kertas soalan ini mengandungi 2 BAHAGIAN:

BAHAGIAN A: Satu (1) soalan (Sila jawab semua soalan)
BAHAGIAN B: Lima (5) soalan (Sila jawab TIGA (3) soalan sahaja)
The exam paper consists of 2 PARTS.
PART A: One (1) question (Please answer ALL questions)
PART B: Five (5) questions (Please answer THREE (3) questions only)
2.
Sila jawab di dalam buku jawapan yang disediakan.

Please answer in the answer booklet provided.
3.
Kertas soalan ini mempunyai versi dwi-bahasa. Versi Bahasa Inggeris bermula daripada
mukasurat 2 hingga 8, manakala versi Bahasa Melayu bermula daripada mukasurat 9 hingga 16.
The exam paper consists of dual-language version. The English version starts from page 2 to 8, whereas
the Malay version starts from page 9 to 16.
KERTAS SOALAN INI TERDIRI DARIPADA (16) MUKA SURAT SAHAJA

(TERMASUK MUKA SURAT HADAPAN)
THIS QUESTION PAPER CONTAINS (16) PAGES ONLY
(INCLUSIVE OF FRONT PAGE)
SULIT
SULIT
(DITS 2213)
PART A (25 MARKS)
Answer ALL Questions
(a) Define the following terminologies for memory management. You can draw a
diagram to support your definition.
i. Frame
(3 Marks)
ii.
Page
iii.
Segment
(3 Marks)
(4 Marks)
(b) File systems provide functions which can be performed on files. List and briefly
explain FIVE (5) of the functions.
(10 Marks)
(c) In Table 1, identify FIVE (5) grain size of parallelism in multiprocessors that
differs in the degree of granularity.
(5 Marks)
Table 1: Synchronization Granularity and Processes
Description
Parallelism inherent in a single instruction stream
Multiprocessing of concurrent processes in a
multiprogramming environment
Distributed processing across network nodes to form a single
computing environment
Multiple unrelated processes
Parallel processing or multitasking within a single application
PART B (75 MARKS)

Answer THREE (3) questions only
Grain size
SULIT
(DITS 2213)
Question 1 (25 Marks)
(a) Dynamic partitioning are partitions of a variable length and number. Process is
allocated exactly as much memory as required.
i. Explain how each algorithm differs in their operation.
(9 Marks)
ii.
Based on the figure, which algorithm performs its best? Justify your
answer.
(6 Marks)
(b) Consider the following page address stream formed by executing a program:
1 2 3 4 5 2 1 3 3 2 3 4 5 4 5 1 1 3 2 5
Calculate the number of page faults that would occur if the working set policy
with First in First out (FIFO) and Optimal policies were used with fixed frame
allocation for the program of three frames.
(10 Marks)

a) The actual details of disk input/output (I/O) operation depend on the timing of
disk I/O transfer. Discuss disk performance parameters as shown in Figure 2.
Figure 2: Timing of a disk I/O transfer

(10 Marks)
b) The requested tracks, in the order received by the disk scheduler are:
27 129 110 186 147 41 10 64 120
SULIT
(DITS 2213)
Assume that the disk head is initially positioned over track 100 and is moving in
the direction of decreasing track number. Estimate the average seek time for
SCAN and C-SCAN disk scheduling policies, draw the scanning graph, and
justify the policies performance according to your results.
(15 Marks)
Consider the following set of processes:
Table 2: Process Scheduling
Process
Arrival Time
Service Time
12
Perform an analysis for the set of processes in Table 2 to describe Round-robin (q=4),
Shortest Process Next (SPN) and Shortest Remaining Time (SRT) scheduling policies
performance. In your analysis, you are required to:
a) Illustrate the execution pattern for each policy for one cycle.
(9 Marks)
b) Estimate the finish time and normalized turnaround time; which is the ratio of
turnaround time to service time.
(16 Marks)
SULIT
(DITS 2213)
a) In multiuser system, there is a wide variety of access rights have been used by
various systems. Briefly explain THREE (3) of them.
(6 Marks)
b) File organization refers to the logical structuring of records and is determined by
the way files are accessed. Elaborate on how to organize records in a file and
access a particular record in a file.
(10 Marks)
c) Blocks are the unit for I/O with secondary storage. By using diagram, demonsrate
the blocking techniques to organize records as a sequence of blocks for I/O?
(9 Marks)

a) Explain the difference between periodic and aperiodic task in real-time
scheduling.
(4 Marks)
b) Elaborate the concept of pre-emptive in real time scheduling. Provide an
example of how pre-emptive is applied to real-time scheduling to support your
fact.
(5 Marks)
c) Consider a set of five aperiodic tasks with the execution profiles as shown in
Table 3.
Table 3: Execution Profile of Two Aperiodic Tasks
Process
Arrival Time Execution Time
Earliest
Deadline
A
10
20
110
SULIT
(DITS 2213)
B
C
D
E
20
40
50
60
20
20
20
20
20
50
90
70
Illustrate the scheduling of Aperiodic Real-Time Tasks blocks diagram and justify
the scheduling performance if using:
i.
Earliest deadline for this set of tasks.

ii.
Earliest deadline with unforced idle time for this set of tasks.
( 16 Marks )
-END-

DITS 2213 Final Exam OS

Uploaded by

Copyright:

Available Formats

DITS 2213 Final Exam OS

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DITS 2213 Final Exam OS

Uploaded by

Copyright:

Available Formats

Discuss disk performance parameters as shown in Figure 2.

Perform an analysis for the set of processes in Table 2 to describe Round-robin (q=4), Shortest Process Next (SPN) and Shortest Remaining Time (SRT) scheduling policies performance.

SULIT

UNIVERSITI TEKNIKAL MALAYSIA MELAKA

FAKULTI TEKNOLOGI MAKLUMAT DAN KOMUNIKASI

: BITC / BITS / BITD

: 2 JAM DAN 30 MINIT

2 HOURS AND 30 MINUTES

Kertas soalan ini mengandungi 2 BAHAGIAN:

Sila jawab di dalam buku jawapan yang disediakan.

KERTAS SOALAN INI TERDIRI DARIPADA (16) MUKA SURAT SAHAJA

PART B (75 MARKS)

Question 2 (25 Marks)

Figure 2: Timing of a disk I/O transfer

Question 4 (25 Marks)

Question 5 (25 Marks)

Earliest deadline for this set of tasks.

You might also like