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

Computer Operating Systems (Cisy 300) (Bbit 213) (Dcis 201) (Dbit 210) 1St Trimester 2016 Question Paper

Computer Operating Systems (Cisy 300) (Bbit 213) (Dcis 201) (Dbit 210) 1St Trimester 2016

Course:Bachelor Of Business Information Technology

Institution: Kenya Methodist University question papers

Exam Year:2016

Computer Operating Systems (CISY 300) (BBIT 213) (DCIS 201) (DBIT 210) 1st trimester 2016
KENYA METHODIST UNIVERSITY

END OF 1STTRIMESTER 2016(DAY) EXAMINATIONS

SCHOOL : SCIENCE & TECHNOLOGY
DEPARTMENT : COMPUTING & INFORMATION SCIENCE
UNIT CODE : 'CISY 300/BBIT 213/DCIS 201/DBIT 210
UNIT TITLE : 'COMPUTER OPERATING SYSTEMS
TIME : 2 HOURS

INSTRUCTIONS

Answer question one and any other two questions

QUESTION ONE (30 MARKS)

Define the following terms as used with operating systems
System call
Deadlock
Batch system
Virtual memory
Device driver
[10 marks]
State and briefly describe the four conditions necessary for a deadlock to occur.
[8 marks]
Distinguish between the following operating systems concepts
Multiprogramming and multiprocessing
Deadlock avoidance and deadlock prevention
Paging and segmentation
[6 marks]
Describe a semaphore and how it is used to solve the critical section problem and ensure mutual exclusion
[4 marks]
State any two file structures
[2 marks]

QUESTION TWO (20 MARKS)

Briefly describe five operating system components
[10 marks]
Outline two challenges encountered when using multiprogramming with fixed partitions for memory management and how the use of swapping with variable partitions helps overcome the challenges.
[6 marks]
Give the four layers of the I/O software structure
[4 marks]

QUESTION THREE (20 MARKS)

With the help of a diagram describe the process states and the transitions that occur between them. In your answer describe what causes the transition
[10 marks]
Briefly describe the following concepts in virtual memory implementations
Page table
Memory management unit
Page fault
[6 marks]
List four page replacement algorithms
[4 marks]
QUESTION FOUR (20 MARKS)

Briefly describe three memory allocation algorithms when using swapping with variable partitions.
[6 marks]
Consider the following jobs each with the indicated time required to complete completion in seconds. Also assume, where applicable, a time quantum of 5 seconds. Show the sequence in which the jobs will be executed and give the turnaround time for each job when using the following CPU scheduling algorithms.
Job. Time.
A 12
B 6
C 17
D 8
E 3

Shortest Job first
Round robin
[12 marks]
Give two operating system services relating to memory management.
[2 marks]

Computer Operating Systems (Cisy 300) (Bbit 213) (Dcis 201) (Dbit 210) 1St Trimester 2016 Question Paper

More Question Papers

Popular Exams

Mid Term Exams

End Term 1 Exams

End Term 3 Exams

Opener Exams

Full Set Exams