operating system set 6 Detailed Explanation And More Example

Question : 1

In which of the following RAID scheme, redundancy is achieved by the simple expedient of duplicating all the data ?

a) RAID level 0

b) RAID level 1

c) RAID level 2

d) RAID level 3

Question : 2

The UNIX scheduling gives

a) Highest preference to real time processes

b) Highest preference to kernel mode processes

c) Highest preference to user mode processes

d) Highest preference to shared processes.

Question : 3

In multi processor scheduling : A: Course gained parallelism, B: Medium grained parallelism, C: Fine grained parallelism; 1- Concurrent processes running on a multi programmed uni- processor. 2- Parallel processing or multi tasking is done within a single application. 3- Parallel processing is done within a single instruction stream.

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

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

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

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

Question : 4

In memory management where replacement is allowed in First-in-First-out (FIFO) fashion

a) The page frames are allocated to a process as circular buffer and pages are removed in random order.

b) The page frames are allocated to a process as circular buffer and pages are removed in round-robin order.

c) Replaces the pages that are least referred.

d) Replaces the pages that are most referred.

Question : 5

The demand paging and pre paging of virtual memory management are

• P - Fetch, Q -Demand paging, R -Prepaging;
• 1-Determines when a page should be bought into main memory. 2- A page is bought into main memory only when a reference is made to a location on that page. 3-Pages other than the one demanded by a page fault are bought in.

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

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

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

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

Question : 6

Memory buffer register (MBR) contains

a) Data that is to be written into memory

b) A particular I/O device.

c) Exchange data between I/O module and the processor.

d) The instruction most recently fetched.