CONFIDENTIAL

x
9
y
CS/APR 2011/CSC520/ITC520
UNIVERSITI TEKNOLOGI MARA
FINAL EXAMINATION
COURSE
COURSE CODE
EXAMINATION
TIME
PRINCIPLES OF OPERATING SYSTEMS/
OPERATING SYSTEMS CONCEPT
CSC520/ITC520
APRIL 2011
3 HOURS
INSTRUCTIONS TO CANDIDATES
1. This question paper consists of two (2) parts : PART A (9 Questions)
PART B (3 Questions)
2. Answer ALL questions in the Answer Booklet. Start each answer on PART B on a new
page.
3. Do not bring any material into the examination room unless permission is given by the
invigilator.
4. Please check to make sure that this examination pack consists of:
i) the Question Paper
ii) an Answer Booklet - provided by the Faculty
DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO
This examination paper consists of 5 printed pages
Hak Cipta Universiti Teknologi MARA CONFIDENTIAL
CONFIDENTIAL 2 CS/APR 2011/CSC520/ITC520
PART A (40 MARKS)
QUESTION 1
An operating system manages resource sharing from the idea of multiprogramming. Explain
how the concept of multiprogramming used in shared resources.
(4 marks)
QUESTION 2
Draw the environment model of process abstraction.
(4 marks)
QUESTION 3
Describe what a process address space is and why it was important to a process.
(4 marks)
QUESTION 4
Define what a resource is and the difference between reusable resources and consumable
resources.
(5 marks)
QUESTION 5
When a process has been created, the process manager creates a process descriptor.
Explain about a process descriptor.
(4 marks)
QUESTION 6
Explain the existence of critical section and the occurrence of race condition in cooperating
process.
(5 marks)
QUESTION 7
Describe a starvation problem that possibly occurs in CPU allocation and how it could be
solved.
(5 marks)
Hak Cipta Universiti Teknologi MARA CONFIDENTIAL
CONFIDENTIAL 3 CS/APR 2011/CSC520/ITC520
QUESTION 8
One of the strategies managed by memory manager is swapping. Explain what necessitate
swapping in memory system.
(4 marks)
QUESTION 9
Fragmentation is usually happens while managing main memory blocks. Describe the
occurrence of fragmentation in main memory.
(5 marks)
Hak Cipta Universiti Teknologi MARA
CONFIDENTIAL
CONFIDENTIAL 4 CS/APR 2011/CSC520/ITC520
PART B (60 MARKS)
QUESTION 1
a) Describe the three aspects of a scheduling mechanism.
(6 marks)
b) Assume that you have a system with the following given process /', their service time
x(Pi) and the arrival time to execute with one processor.
/
0
1
2
3
4
5
x(Pi)
35
20
40
15
28
14
Arrival Time
0
20
30
35
45
60
i. Create a Gantt chart to illustrate the execution of these processes using First come
First Serve (FCFS) scheduling algorithm.
(6 marks)
ii. Calculate the waiting time and the average waiting time for all processes
(4 marks)
iii. FCFS scheduling only consider two states. Explain each of them.
(2 marks)
iv. What is the weakness of implementing FCFS scheduling?
(2 marks)
Hak Cipta Universiti Teknologi MARA CONFIDENTIAL
CONFIDENTIAL S CS/APR 2011/CSC520/ITC520
QUESTION 2
a) Given a list of blocks with size 2300,1200,1000,1500 and 2050 bytes. By using Best fit
and First Fit approach, draw a memory diagram to show the placement of block request
1290,2000,1400,1000,1399 bytes which arrived in order.
(5 marks)
b) Describe two category blocks of virtual address space transferred by virtual memory
system to or from primary memory
(4 marks)
c) Explain two possible issues when implementing a virtual memory.
(3 marks)
d) Given a list of page reference stream named T:
T = 3 1 6 2 4 2 7 2 5 0 2 7 1 3 4 1 4 3 1 7 5 4 1 0 7
Determine the number of page fault using Least Recently Used algorithm with given 4
frame. Show your work to support your answer.
(8 marks)
QUESTION 3
a) Explain what are the fundamental causes of deadlock?
(4 marks)
b) Give three examples of possible occurrence of deadlock in our computer system.
(3 marks)
c) Define a circular wait condition in deadlock.
(2 marks)
d) Describe two approach used to deny hold and wait condition.
(4 marks)
e) The possible side effects of preventing deadlocks are low device utilization and reduced
system throughput. However, there is an alternative method to manage the occurrence
of deadlock. Explain what the method is.
(4 marks)
f) What are the two ways that need to be taken to recover a deadlock in a system?
(3 marks)
END OF QUESTION PAPER
Hak Cipta Universiti Teknologi MARA
CONFIDENTIAL