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

Bbit 213/ Cisy 300(Computer Operating System )(2 Trimester 2016) Full Time Question Paper

Bbit 213/ Cisy 300(Computer Operating System )(2 Trimester 2016) Full Time

Course:Bachelor Of Business Information Technology

Institution: Kenya Methodist University question papers

Exam Year:2016

BBIT 213/ CISY 300(computer Operating system )(2 trimester 2016) full time
KENYA METHODIST UNIVERSITY

END OF 2'ND 'TRIMESTER 2016 (FT) EXAMINATION

FACULTY : COMPUTING & INFORMATICS
DEPARTMENT : COMPUTER SCIENCE
UNIT CODE : BBIT 213/CISY 300
UNIT TITLE : COMPUTER OPERATING SYSTEMS 1
TIME : 2 HOURS

INSTRUCTIONS

Answer Question One and any other Two Questions.
SECTION A

'Question One '(30 marks)

Define the term Operating system. (2 marks)
List four components of an operating system (2 marks)
What is the distinguishing characteristic of real time operating system?
(2 marks)
Discuss the role of the following schedulers in process control:
Short term scheduler
Medium term scheduler
Long term scheduler (6 marks)
Below is a set of processes available for execution in a multi programmed environment:
Process Burst time Arrival time
1 10 0
2 7 1
3 2 2
4 5 3
5 3 6

Schedule the processes using First Come First Served ( FCFS) and Shortest Remaining Time Next(SRTN) and comment on your average turn around time and the average waiting time. (9 marks)
Describe briefly Main memory management based on the following:
Memory fixed partition (3 marks)
Memory dynamic partition (3 marks)
What is inferred when a section of code is described as a critical section?
(3 marks)

'Question Two '(20 marks)

Define the term process. (2 marks)
Describe the possible states of a process and the transitions between them.
(5 marks)
Explain three advantages of a multi threading applications in comparison with single threaded applications.
(3 marks)
The table below shows jobs submitted for execution in a computer system with time sharing capability:
Job Arrival time CPU burst
A 0 12
B 1 2
C 3 1
D 5 5
The arrival time and CPU burst are arbitrary units.

Using the table Construct Gantt charts for Shortest Job First (SJF), and Round Robin (RR) (Time slice=2) scheduling algorithms. (3 marks)
For each algorithm, work out the Average Turn around Time (ATT) and Average Waiting Time (AWT). (6 marks)
Which of the algorithms provide optimal values for AWT and ATT? Explain.
(1 mark)

'Question Three '( 20 marks)

Define the term deadlock and illustrate a situation where deadlock can occur.
(4 marks)
List and explain the conditions sufficient and necessary to produce deadlock?
(4 marks)
Identify three strategies that can be used to deal with deadlocks.
(3 marks)

Describe the following disk scheduling algorithms:
First Come First Served
Shortest Seek Time First (SSTF)
SCAN.
(9 marks)

'Question Four '(20 marks)

Describe briefly the following concepts based on operating system structure:
Layered structure
Micro kernel structure
Simple structure (3 marks)
Discuss the following file allocation methods citing one advantage and one disadvantage of each method.
Contiguous allocation (4 marks)
Linked allocation (4 marks)
Explain the advantages of a multi-level queue in CPU scheduling.
(3 marks)

Bbit 213/ Cisy 300(Computer Operating System )(2 Trimester 2016) Full Time Question Paper

More Question Papers

Popular Exams