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

Comp 220:Operating System March 2011 Question Paper

Comp 220:Operating System March 2011 

Course:Bachelor Of Computer Science

Institution: Kabarak University question papers

Exam Year:2011



KABARAK UNIVERSITY

UNIVERSITY EXAMINATIONS
2010/2011 ACADEMIC YEAR
FOR THE DEGREE OF BACHELOR OF COMPUTER SCIENCE
COURSE CODE: COMP 220

INSTRUCTIONS:

NOTE: - PART-A IS COMPULSORY, HAS 30 MARKS AND FROM PART-B,
YOU CAN ATTEMPT ANY TWO QUESTIONS. EACH QUESTION HAS 20
MARKS.

QUESTION ONE (MAXIMUM MARKS 30) COMPULSORY
a) What are the two main functions of an operating system? Marks 4

b) What are the desirable features of an operating system? Explain any SIX. Marks 6

c) Provide definitions for the following terms:

I. PROGRAM
II. PROCESS
III. PROCESSOR
IV. MULTIPROGRAMMING
V. TIME SHARING Marks 5

d) Explain the memory hierarchy structure. Marks 6
e) Explain all states of a process. Marks 5
f) Explain any four criteria for evaluating scheduling algorithm. Marks 4

QUESTION TWO (MAXIMUM MARKS 20)

a) How do you evaluate scheduling algorithm? Explain any four issues of CPU scheduling.
Marks 4
b) What is the difference between Shortest job first (SJF) and Shortest remaining time first
(SRTF)? Marks 2
c) What is serial processing? Marks 2
d) Explain how the Priority Scheduling works. Marks 2
e) Explain any three categories of file attributes? Marks 3
f) (i) What is in a thread control block? Marks 2
(ii) Why allow threads to access same memory? Marks 2
g) Explain the use of the following DOS commands and give sample syntax of each.
• ATTRIB
• COPY
• DIR Marks 3


QUESTION THREE (MAXIMUM MARKS 20)
a) Explain Why memory management algorithms are important. Marks 4
b) What are the functions (explain any two) of memory management? Why is it necessary?
Marks 4
c) How external fragmentation can be avoided. Explain with an example. Marks 2

d) (i) What is buffering? Explain Marks 2

(ii)What are the limitations of buffering? Marks 2
e) (i) What is spooling? Marks 2
(ii) Explain any two advantages of spooling. Marks 2
f) Explain any four Memory Management Function. Marks 2

QUESTION FOUR (MAXIMUM MARKS 20)
a) Briefly explain how the FCFS, SCAN CSCAN and VSCAN disk head scheduling algorithms
work. Also give one demerit of each of the algorithms above. Marks 8
b) (i) What is a dead lock situation? Give an example. Marks 2
(ii) What are the four conditions for deadlock? Marks 2
(iii) Explain the prevention of any two conditions. Marks 2
c) Explain any four Processor (CPU) Management Function. Marks 2
d) What are the differences between segmentation and paging? What are their advantages
and disadvantages? Marks 4






More Question Papers


Popular Exams


Mid Term Exams

End Term 1 Exams

End Term 3 Exams

Opener Exams

Full Set Exams



Return to Question Papers