operating system set 1 Detailed Explanation And More Example

Question : 1

Program counter (PC) contains

a) Address of an instruction to be fetched

b) Instructions most recently fetched

c) Data to be written into memory

d) Data to be read from memory

Question : 2

A solution to the Dining Philosophers Problem which avoids deadlock is

a) ensure that all philosophers pick up the left fork before the right fork.

b) ensure that all philosophers pick up the right fork before the left fork.

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.

d) none of the above

Question : 3

With round-robin CPU scheduling in a time shared system

a) using very large time slices degenerates into First-Come First Served Algorithm

b) using extremely small time slices improves performance

c) using very small time slices degenerate into Last-In-First-Out algorithm

d) using medium sized time slices leades to Shortest Request Time First algorithm.

Question : 4

Memory that is located on the disk either Hard or floppy is referred as

a) Virtual memory

b) Real memory

c) Main memory

d) None of these.

Question : 5

The Least Recently Used (LRU) policy

a) Replaces the page in memory that has not been referenced for the least time.

b) Replaces the page in memory that has not been referenced for the longest time.

c) Replaces the page in memory in round robin fashion.

d) None of these.

Question : 6

Memory table is used

a) To allocate main memory to processes

b) To allocate secondary memory to processes

c) To manage virtual memory

d) A, B and C are true.