Operating System(Quiz 4)

In uni-processor scheduling, shortest process next policy is

A: Non-preemptive policy

B: Preemptive policy

C: A policy where the process with shortest expected processing time is selected next.

D: A policy where the process with shortest expected processing time is not selected.

In uni-processor scheduling, shortest remaining time policy is

In round robin (time slicing) policy applied on uni-processor scheduling

If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni- processor scheduling policy selects.

In multi processor scheduling, independent parallelism indicates

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.

In round robin (time slicing) policy applied on uni processor scheduling

If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni processor scheduling policy selects

In multi processor scheduling, independent parallelism indicates

In multi processor scheduling; A: Coarse 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 situation where two or more processes coordinate their activities based on a condition is referred as

Par begin (P1)

The mail box and ports are examples of

In Dynamic partition of main memory in memory management, the sized of process and memory partition is

In    the   simple____________paging     in     memory management where

1. Absolute Loading B. Relocatable Loading

C. Dynamic Run-Time Loading; 1- It requires that a load module always be loaded into some location in main memory. 2- A load module can be located anywhere in main memory

The disk and tape devices are referred as

Which of the following is not human readable I/O device?

Following is not the stream oriented I/O device

The direct memory access (DM(A) module

In disk scheduling, the seek time is

The access time in disk scheduling is

The transfer time in disk scheduling is

In last- in-first- out, disk scheduling policy

In disk scheduling, SCAN algorithm states

RAID (Redundant Array of Independent Disks) scheme consists of

In RAID scheme, which of the RAID level does not use parity calculation in redundancy achievement

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

In disk scheduling, the shortest service time first policy selects the disk request that

The C–SCAN, in disk scheduling states

RAID-O does not support the following characteristics: A: RAID is a set of physical disk drives viewed by the operating system as a single logical drive. B: Data distributed across the physical drives of an array. C: Re- demdant disk capacity is used to store parity information, which guarantees data recoverability in case of a disk failure.

The UNIX scheduling gives

In disk scheduling when SCAN (Look) policy is applied and when last track reached in one direction

In RAID (Redundant Array of Independent Disks) scheme, which of the following RAID level does not include redundancy to improve performance ?

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

In shortest service time first policy, applied on disk scheduling, the disk request is selected

The RAID (Redundant Array of Independent Disks) level one requires

Match the following in RAID scheme : A- Parallel access array, B-Independent access array, 1- All member disks participate in the execution of every I/O request. 2- Each member disk participates separately in the execution of every I/O request. 3- Here spindles of the individual drives are synchronized so that each disk head is in the same position on each disk at any given time.

The following RAID level employer parallel access technique and single redundant disk

The RAID scheme indicate