1 Which of the following is not a function of the boot block?

A. To load the operating system into memory

B. To verify the integrity of the operating system
C. To configure the system's hardware and software settings
D. To provide a user interface for interacting with the operating system

Ans:- d

2 Which of the following is not a part of context switching?

a. Saving the state of the current process
b. Loading the state of the next process
c. Scheduling the next process
d. Swapping the memory pages of the current process

Ans:- d

3 What is the purpose of context switching?

a. To allow multiple processes to run concurrently
b. To allow the operating system to run more efficiently
c. To allow the operating system to handle interrupts
d. All of the above

Ans:- d

4 What is the difference between a preemptive and a non-preemptive scheduler?

(a) A preemptive scheduler can interrupt a running process, while a non-preemptive scheduler
cannot.
(b) A preemptive scheduler is more efficient than a non-preemptive scheduler.
(c) A non-preemptive scheduler is more fair than a preemptive scheduler.
(d) Both (a) and (c).

Ans:- d

5 What is the purpose of a CPU scheduler?

(a) To ensure that all processes get an equal amount of CPU time.
(b) To ensure that the shortest job gets the most CPU time.
(c) To keep the CPU busy at all times.
(d) To ensure that the most important processes get the most CPU time.

Ans:- d

6 What is the starvation problem?

(a) The starvation problem occurs when a process is never given any CPU time.
(b) The starvation problem occurs when a process is given very little CPU time.
(c) The starvation problem occurs when a process is given too much CPU time.
(d) The starvation problem does not exist.

Ans:- a

7 Which of the following scheduling algorithms is most likely to starve a process?

(a) FCFS
(b) SJF
(c) Priority scheduling
(d) Round robin

Ans:- c

8 Which of the following is a disadvantage of the round robin scheduling algorithm?

(a) It is not fair to all processes.
(b) It can starve a process.
(c) It is not efficient in terms of CPU utilization.
(d) All of the above.

Ans:- d

9 Which of the following is a real-time scheduling algorithm?

(a) FCFS
(b) SJF
(c) Priority scheduling
(d) Round robin

Ans:- c

10 Which of the following is a disadvantage of the Shortest Remaining Time First (SRTF)
scheduling algorithm?
(a) It is not fair to all processes.
(b) It can starve a process.
(c) It is not efficient in terms of CPU utilization.
(d) It is not efficient in terms of response time.

Ans:- b

11 What is the ready state of a process?

a) when process is scheduled to run after some execution
b) when process is unable to run until some task has been completed
c) when process is using the CPU
d) none of the mentioned
Ans:- a

12 Which system call can be used by a parent process to determine the termination of child
process?
a) wait
b) exit
c) fork
d) get

Ans;- a

13 The address of the next instruction to be executed by the current process is provided by the
a) CPU registers
b) Program counter
c) Process stack
d) Pipe

Ans:- b

14 A process can be terminated due to __________

a) normal exit
b) fatal error
c) killed by another process
d) all of the mentioned

Ans:- d

15 A process stack does not contain __________

a) Function parameters
b) Local variables
c) Return addresses
d) PID of child process

Ans:- d