Get premium membership and access revision papers, questions with answers as well as video lessons.

Cisy 300:Computer Operating Systems I Question Paper

Cisy 300:Computer Operating Systems I

Course:Computer Science

Institution: Kenya Methodist University question papers

Exam Year:2015

KENYA METHODIST UNIVERSITY

END OF 1''st ''TRIMESTER 2015 (PT) EXAMINATION
FACULTY : COMPUTING & INFORMATICS
DEPARTMENT : COMPUTER SCIENCE
UNIT CODE : CISY 300/BBIT 213
UNIT TITLE : COMPUTER OPERATING SYSTEMS I
TIME : 2 HOURS

INSTRUCTIONS:

Answer question One and any other two questions

Question One (30 marks)

Clearly explain the differences between the following early systems:

(5 marks)

Batch systems
Multiprogrammed batch systems
Time sharing systems
Parallel systems
Real-time systems

Briefly explain two fundamental responsibilities of an operating system

(2 marks)

Five, A through E, arrive at a computer center having estimated run-times of 10, 6, 2, 4 and 8 minutes. Their priorities are 3,5,2,1 and four respectively (with 1 being the highest priority). For each of the following scheduling algorithms. Draw a table and clearly show how the jobs would be processed. Also determine the mean process turnaround time.

Using the Algorithms below

Priority scheduling

(4 marks)

Round Robin

(4 marks)

SJF

(2 marks)

NB: Assume that the time quantum is 1 minute

Briefly describe the following memory management terminologies

Locality of reference

(2 marks)

Working set

(2 marks)

Page replacement policy

(2 marks)

Dirty page /dirty bit

(2 marks)

Outline the various situations when the process schedule has to make scheduling decisions.

(5 marks)

Question Two (15 marks)

Consider the following jobs along with their arrivals time and a time slice of 4 million seconds:

Arrival time 0 1 2 3
Job A B C D
CPU Cycle 8 4 9 5

Using the round robin scheduling algorithm:

Calculate the average turnaround time

(8 marks)

Determine the waiting time

(4 marks)

Differentiate between CPU-bound and memory-bound processes

(3 marks)

Question Three (15 marks)

Describe the RACE CONDITION in process management

(2 marks)

What is the difference between dead lock and starvation

(2 marks)

Analyze the four conditions necessary for Deadlock to occur

(4 marks)

How are the four conditions mentioned in (c) above avoided in deadlock management?

(4 marks)

Differentiate internal and external memory fragmentation

(3 marks)

Question Four (15 marks)

Scheduling algorithms can either be pre-emptive or non-pre-emptive. With the aid of a suitable example, distinguish thee two classes of algorithms.

(3 marks)

Briefly describe the differences among short-term, medium-term and long-term scheduling.

(6 marks)

A solution to a critical section problem must satisfy three requirements clearly explain the requirements

(6 marks)

Cisy 300:Computer Operating Systems I Question Paper

More Question Papers

Popular Exams

Mid Term Exams

End Term 1 Exams

End Term 3 Exams

Opener Exams

Full Set Exams