Q1 (a) The difference between block devices and character devices is that a block is a device

whose drivers communicates by sending entire blocks of data and their examples are hard disks,
usb, camera while character devices is a device whose drivers communicates by sending and
receive single character bytes stets and their examples are serial ports parallel ports sound cards
etc.

(B).1. buffering is a process of temporally storing data that is passing between a processing and a
peripheral

(2) Spooling is a process in which data is temporally held to be used and executed by a device
program in a system.

(c) An interrupt is a response by a process or an event that need attention from the software and
CPU rely in the data contain by in a couple register to correctly handle interrupts

(d) A typical device driver is a computer program that operates or control particular type of
device that is attached to a computer.

Q2 (a) -process management,

- Memory management,

-secondary system management, I/O system

-and file management.

(b) (1)Assumption ,assume that variable memory location can only have on value .it processes A
and B write a value in a same memory location at the same tune either either the value from will
written rather some scrambling .

(2)Peterson algorithm is a simple algorithm that can be ran by two processes to ensure mutual
execution for the resource.

3)

4)(a)

© -security

-Job accountancy
-Error detecting

-Coordination between other software and users

Memory management /device management and processor management.

(D)1)Phrase race condition is an desirable situation that occurs when a device or a system
attempts to perform two /more operations at the same time but because of nature of the device or
system operation must be done in a proper sequence and correctly .

(2)Can be avoided by proper thread synchronization in actual sectional.

Q3) (a) the CPU executes the instruction that make up a computer, it perform basic arithmetic,
logic, controlling input/output operations specified by instructions in the program

(b) Memory map shows what is included in each memory region.

Q4)

Q5)a)(!)kernel manage and schedule all threads significant overhead and increase in kernel
complicity ,kernel level threads are slow and inefficient compared to user level threads ,its
operation hundred time slower compared to user level threads .

(2)operating system software that manages computer hardware software resources and provide
common service for computer programs and time sharing Schedule task for efficient use and
Unix likes such as Solaris and Linux .

(b)LRU result to be best algorithm for page replacement to implement but it has some
disadvantages to implement but it maintains a linked list in the memory in which the most
recently used page is replaced at front and the least recently used page is placed at the rear.

Q6)There are three ways of handling deadlocks ,deadlocks prevention ,it can be prevented by
preventing at least one of the four required conditions example mutual conditions these share
resources such as read only and files do not lead to deadlocks. Also hold and wait.

No preemption can prevent this conditions of deadlocks when it is possible.

And circular is to number all resources only in strictly increasing or decreasing order. , or
avoidance –these do not allow the system to get into deadlock states
D (a)=deadlock detection and recovery –abort a process or preempt some resources when
deadlocks are detected .

Deadlock avoidance is to prevent deadlock from ever happening, by preventing at least one of
the aforementioned conditions.

(b) Mutual exclusion –at least one process must be held in a non- sharable mode

Hold and wait –there must be a process holding one resources and wait for another.