CONFIDENTIAL

CS/OCT 2010/CSC520/ITC520

UNIVERSITI TEKNOLOGI MARA FINAL EXAMINATION

COURSE COURSE CODE EXAMINATION TIME

PRINCIPLES OF OPERATING SYSTEMS/ OPERATING SYSTEMS CONCEPT CSC520/ITC520 OCTOBER 2010 3 HOURS

INSTRUCTIONS TO CANDIDATES 1. This question paper consists of two (2) parts : PART A (10 Questions) PART B (3 Questions)

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. Please check to make sure that this examination pack consists of: i) ii) the Question Paper an Answer Booklet - provided by the Faculty

4.

DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO

This examination paper consists of 6 printed pages
Hak Cipta Universiti Teknologi MARA CONFIDENTIAL

CONFIDENTIAL

CS/OCT 2010/CSC520/ITC520

PART A (40 MARKS)

QUESTION 1 An operating system manages resource sharing through time-multiplexing and space multiplexing. Explain about time multiplexing and space multiplexing. (4 marks) QUESTION 2 Another purpose of operating system is responsible for resource abstraction. Define what a resource abstraction is and the benefit of providing resource abstraction. (4 marks) QUESTION 3 Direct Memory Access (DMA) is an efficient technique to reduce bottleneck performance in I/O operation. Explain how DMA is carrying out its operation? (4 marks) QUESTION 4 The process manager is responsible for implementing the process, thread, and resource abstraction to provide the abstract machine function. Describe three activities control by a process manager. (3 marks) QUESTION 5 Context switches will occur whenever the operating system gets control of the processor. Define a context switch. (2 marks) QUESTION 6 Process manager, use a state variable as a summary status of the process. The variable could be viewed through a state diagram. Describe a state diagram. (6 marks) QUESTION 7 The existence of critical section creates an environment called deadlock. Describe the situation of deadlock that occurs in software. (3 marks) QUESTION 8 Describe the three aspect of paging policy. (6 marks)
Hak Cipta Universiti Teknologi MARA CONFIDENTIAL

CONFIDENTIAL

CS/OCT 2010/CSC520/ITC520

QUESTION 9 Virtual memory system could enhance the ability of an operating system in managing memory. Explain what a virtual memory is. (4 marks) QUESTION 10 a) State ONE (1) activity manages by a file manager. (1 mark) b) List three different strategies managed by file manager while mapping user data to blocks of secondary storage. (3 marks)

Hak Cipta Universiti Teknologi MARA

CONFIDENTIAL

CONFIDENTIAL

CS/OCT 2010/CSC520/ITC520

PART B (60 MARKS)

Answer ALL Questions.

QUESTION 1 a) Draw the execution model of process scheduling. (5 marks) b) Compare between nonpreemptive scheduling algorithm and preemptive scheduling algorithm. (4 marks) c) Assume that you have a system with the following given process /', their service time x(pi) and arrival time to execute with one processor.

/'

T(Pi)

0 1 2 3 4

20 35 20 15 25

priority number 1 4 2 3 5

Arrival Th 0 10 30 40 55

Draw a Gantt chart to illustrate the execution of all processes using priority scheduling algorithm. (6 marks) ii. Calculate the average turnaround time for all processes, (3 marks) iii. Calculate the average waiting time for all processes. (2 marks)

QUESTION 2 a) Identify two goals of paging system. (2 marks) b) Name the page replacement policy from the following descriptions : i. Look ahead in reference for page that won't be needed for longest time. ii. Replace a page with maximal backward distance. iii. Replace a page with minimum use. (3 marks)
Hak Cipta Universiti Teknologi MARA CONFIDENTIAL

CONFIDENTIAL

CS/OCT 2010/CSC520/ITC520

c) Explain what is a page fault? (2 marks) d) Given a list of page reference stream named S:

S= 5 ' 1 2 1 0 2 7 6 2 0 2 5 0 1 4 1
i.

7 3 5 3 4 7 3 4 6 0 3

Determine the number of page fault using Least Recently Used algorithm with given 4 frame. (7 marks)

ii. Determine the number of page fault using Least Recently Used algorithm if the number of frame increase 1. (6 marks)

QUESTION 3 a) Describe the sequence of actions when processes want to view state transitions in deadlock handling. (5 marks) b) Describe each of the resource allocation graph below : (8 marks) PI R1

o.
R2 P2

P3

P4

Hak Cipta Universiti Teknologi MARA

CONFIDENTIAL

CONFIDENTIAL

CS/OCT 2010/CSC520/ITC520

IV.

c) What is an unsafe state? (2 marks) d) Suppose that a system below is in an unsafe state. The system has 12 resources and three processes: P0,P1,P2. Process PO P1 P2 Max 10 4 9 Current 5 2 3 Need 5 2 6

Discuss how possible for the processes PO, P1 and P2 in the system could complete their execution without entering a deadlock state. (5 marks)

END OF QUESTION PAPER

Hak Cipta Universiti Teknologi MARA

CONFIDENTIAL