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

Bbit 213: Operating Systems I (Cisy 300) 2Nd Trimester 2012 Question Paper

Bbit 213: Operating Systems I (Cisy 300) 2Nd Trimester 2012

Course:Bachelor Of Business Information Technology

Institution: Kenya Methodist University question papers

Exam Year:2012

OPERATING SYSTEMS I (CISY 300) 2ND TRIMESTER 2012
KENYA METHODIST UNIVERSITY

END OF 2'ND 'TRIMESTER 2012 (DAY) EXAMINATIONS

FACULTY : COMPUTING AND INFORMATICS
DEPARTMENT : COMPUTER INFORMATION SYSTEM
UNIT CODE : BBIT 213/CISY 300
UNIT TITLE : OPERATING SYSTEMS I
TIME : 2 HOURS

Instructions:

Answer question ONE from section A and TWO form section B.
SECTION A

Question One

Explain the advantages and disadvantages of batch systems? (6mks)
Describe demand paging and its advantages.
(4mks)
Describe paged memory allocation concept and its two disadvantages.
(6mks)
Differentiate between pre-emptive and non-pre-emptive scheduling algorithms.
(4mks)
Explain the abstract view of a computer system.
(4mks)
Explain the process states that are encountered by the process scheduler.
(6mks)
SECTION B

Question Two

The batch systems were marked with major problems during their historical development of the operating system, discuss some of these problems and the possible solutions that were offered.
(10mks)
Discuss three functions of operating systems. (6mks)
What is virtual memory management and what are its advantages. (4mks)

Question Three

Differentiate between dynamic partition and re-locatable dynamic partitions, in the variable memory management schemes.
(4mks)
Describe three categories of system devices.
(6mks)
Describe a deadlock.
(2mks)
What are the various measures undertaken to prevent deadlocks? (using indirect methods)?
(8mks)

Question Four

Explain three examples of multilevel quees found in operating systems.
(6mks)
Briefly explain three functions carried out by the device manager. (6mks)
Briefly describe the three categories of system devices.
(6mks)
Describe process management accomplished by the operating system.
(2mks)

Question Five

Using the diagram below, calculate the average turnaround time and average waiting time, using the shortest job next algorithm. (4mks)
Process Arrival time Burst time
P1 0 7
P2 2 4
P3 4 1
P4 5 4

Using appropriate examples, discuss two strategies of selecting memory blocks in dynamic memory partitions.
(4mks)
Briefly discuss the three CPU scheduling algorithms.
(6mks)
Describe the process control block and the various pieces of information that it contains in regard of process management.
(6mks)

Bbit 213: Operating Systems I (Cisy 300) 2Nd Trimester 2012 Question Paper

More Question Papers

Popular Exams

Mid Term Exams

End Term 1 Exams

End Term 3 Exams

Opener Exams

Full Set Exams