Process


Q1.

The operating system and the other processes are protected from being modified by an already running process because
GateOverflow

Q2.

Consider the following statements about process state transitions for a system using preemptive scheduling. I. A running process can move to ready state. II. A ready process can move to running state. III. A blocked process can move to running state. IV. A blocked process can move to ready state. Which of the above statements are TRUE?
GateOverflow

Q3.

Suppose a system contains n processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited ready queue of the process
GateOverflow

Q4.

The maximum number of processes that can be in Ready state for a computer system with n CPUs is
GateOverflow

Q5.

The process state transition diagram of an operating system is as given below. Which of the following must be FALSE about the above operating system?
GateOverflow

Q6.

What is the swap space in the disk used for?
GateOverflow

Q7.

Where does the swap space reside ?
GateOverflow

Q8.

Which of the following actions is/are typically not performed by the operating system when switching context from process A to process B?
GateOverflow

Q9.

Which of the following need not necessarily be saved on a context switch between processes?
GateOverflow

Q10.

The state of a process after it encounters an I/O instruction is?
GateOverflow