Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
51 views

Computer Operating Systems Exam

This document contains an exam for an Operating Systems course, with 5 questions covering key topics. Question 1 asks students to [1] define operating system, process, and synchronization, [2] describe 4 OS services, [3] discuss CPU performance metrics, and [4] differentiate RAM and ROM with an example of semaphores. Question 2 covers [1] paging vs segmentation, [2] 4 page replacement algorithms, [3] memory hierarchy, and [4] network OS features. Question 3 addresses [1] race conditions and critical sections, [2] avoiding critical sections, [3] scheduling algorithms, and [4] how registers, cache and virtual memory impact processor speed

Uploaded by

clinton koech
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
51 views

Computer Operating Systems Exam

This document contains an exam for an Operating Systems course, with 5 questions covering key topics. Question 1 asks students to [1] define operating system, process, and synchronization, [2] describe 4 OS services, [3] discuss CPU performance metrics, and [4] differentiate RAM and ROM with an example of semaphores. Question 2 covers [1] paging vs segmentation, [2] 4 page replacement algorithms, [3] memory hierarchy, and [4] network OS features. Question 3 addresses [1] race conditions and critical sections, [2] avoiding critical sections, [3] scheduling algorithms, and [4] how registers, cache and virtual memory impact processor speed

Uploaded by

clinton koech
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

THE EAST AFRICAN UNIVERSITY (TEAU)

SCHOOL OF COMPUTER SCIENCE AND IT


DEPARTMENT OF COMPUTER SCIENCE
JAN – APRIL 2019, MAIN EXAMINATION

COURSE : OPERATING SYSTEMS


CODE : BIT 210
TIME : 2 Hours

INSTRUCTIONS
1. The Paper is made up of FIVE (5) Questions, question ONE is compulsory plus any other
TWO questions.
2. Credit is given for legibility, clarity of expressions and use of relevant illustrations.
3. Clearly write your registration number on each answer sheet used.

DO NOT WRITE ANYWHERE ON THIS QUESTION PAPER

QUESTION ONE

a. Define the following terms: [6mks]

i. Operating system

ii. Process

iii. Synchronization

b. State and explain any four services provided by an operating system [8mks]

c. Discuss the metrics used to measure CPU performance. [5mks]

d. Differentiate between RAM and ROM [4mks]

e. Using an example, describe a semaphore [5mks]

f. Differentiate between process competition and process cooperation [2mks]

QUESTION TWO
a. Differentiate between paging and segmentation [4mks]

b. Describe the four page replacement algorithms [8mks]

c. Using a well labeled diagram, describe computer memory hierarchy [5mks]

d. Describe any three features of a network operating system [3mks]

QUESTION THREE

a. Define the terms below:

i. Race condition

ii. Critical section [3mks]

b. Describe four conditions needed to avoid the critical section. [8mks]

c. Explain any three scheduling algorithms. [3mks]

d. Describe how each of the following elements enhances the speed of the processor (if at
all).

i. Registers
ii. Cache
iii. Virtual memory [6mks]

QUESTION FOUR

a. Using a well labeled diagram, describe the file system architecture [10mks]

b. State and explain any four factors that should be considered when choosing a file

organization method [4mks]

c. State and explain any three types of threats to computer systems [6mks]

QUESTION FIVE

a. Differentiate between preemptive and non-preemptive scheduling [4mks]

b. Using an example, illustrate the First in First out (FIFO) scheduling algorithm. Calculate

the average waiting time and turn-around time for each process. [6mks]

c. Using a diagram, describe the five-state process model [5mks]


d. Explain the concept of virtual memory in computer storage. [5mks]

You might also like