Scribd
Upload
15 views2 pages

Operating System 2023

Operating System notes

Uploaded by

Miki Mikido
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
15 views2 pages

Operating System 2023

Operating System notes

Uploaded by

Miki Mikido
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
UNIVERSITY OF NAIROBI. pishsq)x)]2020 FIRST SEMESTER EXAMINATIONS 2022/2023 FOURTH YEAR EXAMINATIONS FOR THE DEGREE OF BACHELOR OF SCIENCE IN COMPUTER SCIENCE CSC 223: OPERATING SYSTEMS DATE: 1/2/2023 Instruction: Answer Question 1 and any other two Questions Question 1 (20 Marks: 8 A) Define the following terms [5 marks] i. Frame ii. Segment ill, Kernel iv. Process ve Deadlock B) Differentiate between user mode and kernel mode. [3 marks] c) Differentiate throughput and response time in process management [3 marks] D) Arunning process is interrupted. Describe any three possible causes of this (3 marks] E) _ Hardware instructions such 4s compare_and_swap can be used to support mutual exclusion. What are the advantages of such instructions? [3 marks] F) _ One way to avoid deadlocks is to avoid hold and wait. What are the main disadvantages of this approach? [3 marks] uestion 2 (15 Marks! A) With a clearly labelled diagram, describe the five state process model e [10 marks] B) A swapped state is one of the other possible states i, What is a swapped state [2 mark] What can cause a process to be swapped [2 mark] What can cause a thread to be swapped [1 mark] Question 3 (15 Marks) A) Asemaphore s has a count value of -2 and two processes in its queue P2 and P3 where P2 is a head. P1 is currently in its critical section. Describe the ‘sequence of events that occurs until P3 completes its critical section assuming no other process requests to enter there critical section [6 marks] B) In deadlock avoidance i. Show the details of the matrices and vectors that are used [6 marks] Page 1 of 2 ii. What equation must be satisfied for a new process n+1 to be initiated? {3 marks] Question 4 (15 Marks) A) Describe the disadvantages of a fixed partition system [3 marks] B) The page table for process b contains the following entries o [2 1 [4 3 [3 4 [5 i. Given that an address is 8 bytes, and that 5 bits are used for the offset. What is the page size? [2 marks] ‘At what address does page 3 start? [2 marks] Given a relative address 100 01001 what is the physical address in binary and decimal? [3 marks] ©) Discuss the clock policy page replacement algorithm. Use a clearly labelled diagram {5 marks] Question 5 (15 Marks) A) Describe the three main types of scheduling supported by the OS_= [6 marks] B) Priority queues are one method that can be used to deal with short term scheduling, Using a diagram, explain how this technique Is implemented [6 marks] C) What are the problems that can arise from the scheme in (B) above and how can they be solved [3 Marks] Page 2 of 2

You might also like