operating system set 1 Detailed Explanation And More Example

Question : 1

In real time scheduling: A: Static table driven approach, B: Static priority driven preemptive approach, C: Dynamic planning based approach; 1- A static analysis of feasible scheduler of dispatching is done and implemented. 2- A static analysis of feasible schedules of dispatching is done and assigns priorities to tasks. 3- Feasibility is determined at run time.

a) A - 1, B - 2, C - 3

b) A - 2, B - 3, C - 1

c) A - 3, B - 1, C - 2

d) None of these.

Question : 2

In multi processor scheduling, independent parallelism indicates

a) There is synchronization among processes at gross level.

b) There is no explicit synchronization among processes.

c) A parallel processing or multi tasking is done within a single application.

d) None of these.

Question : 3

Multiprogramming systems

a) are easier to develop than single programming systems

b) execute each job faster

c) execute more jobs in the same time period

d) are used only one large mainframe computers

Question : 4

In system buffer cache, used in UNIX, following not true

a) It is a disk cache

b) It is not a disk cache

c) Data transfer between buffer cache and user process space always occurs using DMA.

d) I/O operations with disk are handled through buffer code.

Question : 5

Data from and to magnetic disk is transformed in

a) Continuation

b) Blocks

c) Block and Continuation both

d) None of these.

Question : 6

A set or resource allocations such that the system can allocate resources to each process in some order, and still avoids a deadlock is called

a) unsafe state

b) safe state

c) starvation

d) greedy allocation