operating system set 4 Detailed Explanation And More Example

Question : 1

Following is not the state of Five-State process model

a) Ready

b) Running

c) Not Running

d) New.

Question : 2

The FIFO algorithm

a) executes first the job that last entered the queue

b) executes first the job that first entered the queue

c) executes first the job with the least processor needs

d) executes first the job that has been in the queue the longest

Question : 3

• Statement A:
• In memory management, the replacement policy deals with the selection of pages in memory to be replaced by an arrived new page.
• Statement B:
• In memory management, the policy the fetch policy determines when a page should be bought into main memory.

a) A and B both false

b) A and B both true

c) A is true, B is false

d) A is false, B is true

Question : 4

In uni-processor management processor through put

a) Is a measure of how much work is being performed

b) Is the percentage of time that the processor is busy

c) Is a time interval between the submission of a process and its completion

d) None of these

Question : 5

Multithreading allows

a) To run threads concurrently

b) To run threads independently

c) A is true, B is false

d) A and B both true.

Question : 6

The allocation map

a) is used to store program data

b) specifies which blocks are used by which file

c) is updated by applications programs

d) allows programs to erase files