operating system set 1 Detailed Explanation And More Example

Question : 1

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 : 2

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.

Question : 3

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 : 4

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 : 5

The amount of memory (in bytes) required for a block bitmap is

a) Disk size x 8

b) Disk size/ (8 x file system block size)

c) File system block size/disk size

d) None of these.

Question : 6

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.