Operating System(Computer Aptitude ) Questions and answers for exam Preparation

Computer Aptitude

OPERATING SYSTEM MCQs

Total Questions : 814 | Page 4 of 82 pages

Question 31. A solution to the Dining Philosophers Problem which avoids deadlock is

ensure that all philosophers pick up the left fork before the right fork.
ensure that all philosophers pick up the right fork before the left fork.
ensure that one particular philosopher picks up the left fork before the right fork, and all other philosophers pick up the right fork before the left fork.
none of the above

Discuss Question

Answer: Option C. -> ensure that one particular philosopher picks up the left fork before the right fork, and all other philosophers pick up the right fork before the left fork.
Answer: (c)

Question 32. In two level scheme for page table, if one assume byte-level addressing and 4-kbyte (2 ¹² pages) then the 4-Gbyte (2 ³²) virtual address space is composed of

2 10 pages
2 20 pages
2 30 pages
2 40 pages

Discuss Question

Answer: Option B. -> 2 20 pages
Answer: (b)

Question 33. A situation where two or more processes coordinate their activities based on a condition is referred as

Synchronization
Dead lock
Starvation
Par begin

Discuss Question

Answer: Option A. -> Synchronization
Answer: (a)

Question 34. In memory management when demand cleaning policy is applied

A modified page is written before their page frames are needed to so that pages can be written out in batches.
A page is written out to secondary memory only when it has been selected for replacement.
A and B both true.
None of these.

Discuss Question

Answer: Option B. -> A page is written out to secondary memory only when it has been selected for replacement.
Answer: (b)

Question 35. User-visible register

Enables machine language programmer to minimize main memory reference by optimizing register use.
Enables assembly language programmer to minimize main memory reference by optimizing register use.
A and B both true.
A and B both false.

Discuss Question

Answer: Option C. -> A and B both true.
Answer: (c)

Question 36. Which is the correct definition of a valid process transition in an operating system?

Wake up: ready ? running
Dispatch: ready? running
Block: ready ? running
Timer runout : ready ? blocked

Discuss Question

Answer: Option B. -> Dispatch: ready? running
Answer: (b)

Question 37. The deterministic operating system

Where operations are performed with in pre-determined time interval.
Where operations can be performed with out pre-determined time interval.
The operating time can not be determined.
None of these.

Discuss Question

Answer: Option A. -> Where operations are performed with in pre-determined time interval.
Answer: (a)

Question 38. A policy in memory management referred as clock policy because one can visualize the page frames as laid out in

Straight line
Rectangle
Circle
Square

Discuss Question

Answer: Option C. -> Circle
Answer: (c)

Question 39. A set or resource allocations such that the system can allocate resources to each process in some order, and still avoids a deadlock is called