operating system set 1 Detailed Explanation And More Example

Question : 1

In uni-processor scheduling, the shortest process next policy is

1. Non-preemptive policy
2. Preemptive policy
3. A policy where the process with the shortest expected processing time is selected next.
4. A policy where the process with the shortest expected processing time is not selected.

a) A and D are true

b) B and C are true

c) A and C are true

d) B and D are true.

Question : 2

Which types of file organization are supported by magnetic tape?

a) random files

b) contiguous sequential file

c) indexed sequential file

d) all of the above

Question : 3

The following operating system writes through catches?

a) UNIX

b) DOS

c) ULTRIX

d) XENIX

Question : 4

The resident set of process is

a) A process that are actually in main memory at anytime.

b) A process that are actually in virtual memory at any time.

c) A process that are actually in disk.

d) None of these.

Question : 5

A critical section is a program segment

a) which should run in a certain specified amount of time

b) which avoids deadlocks

c) where shared resources are accessed

d) which must be enclosed by a pair of semaphore operations.

Question : 6

In defining page table structure in virtual memory, A page number portion of a virtual address is mapped into a hash table using simple hash function, where hash table contains a pointer to the inverted page table, which contains page table entries, this approach is referred as

a) One page table per process structure.

b) Two level page table structure.

c) Inverted page table structure.

d) None of these.