MFT

1. What is a "race condition"?

A) When processes are scheduled in an incorrect order
B) A situation where multiple processes access shared data concurrently
and the outcome depends on the order of execution
C) The time taken by a process to complete its execution
D) None of the above
2. Which of the following is NOT a solution for mutual exclusion?
A) Spinlocks
B) Semaphores
C) Monitors
D) CPU Scheduling
3. What is "busy waiting"?
A) Waiting for a resource to become available without releasing the CPU
B) Sleeping for a certain amount of time
C) Not using any CPU cycles at all
D) None of the above
4. What are semaphores used for?
A) To improve process scheduling
B) To provide mutual exclusion and synchronization
C) To manage CPU cache
D) To maximize throughput
5. In the context of interprocess communication, what does "message passing" refer
to?
A) Sharing memory segments directly between processes
B) Sending messages between processes to synchronize actions
C) The format of CPU instructions
D) None of the above
6. In a Round Robin scheduling algorithm, what is the main characteristic?
A) Priority-based execution
B) Each process gets a fixed time in cyclic order
C) The shortest job is executed first
 D) Decisions are made by the operating system
7. What is the goal of priority scheduling?
A) To minimize turnaround time
B) To ensure that all processes get equal CPU time
C) To execute processes based on their importance
D) None of the above
8. of the following scheduling algorithms can lead to starvation?
A) Round Robin
B) Shortest Job First
C) First-Come, First-Served
D) All of the above
9. What is two-level scheduling?
A) Dividing processes into two priority queues
B) Using both foreground and background processes
C) Scheduling processes at two different levels of granularity
D) None of the above
10. What does "guaranteed scheduling" mean in process scheduling?
A) All processes will complete in a guaranteed maximum time
B) Every process gets a fixed amount of CPU time
C) Prioritization ensures every high-priority process will eventually
execute
D) None of the above
Long Answers:
(11) Explain Process control block. Also define Interprocess Communication.[BL-2]
(12) Explain the types of scheduling and explain Round Robin Scheduling with example
[BL-2]
(13) Discuss Message passing in inter process communication. [BL-2]
(14) Discuss bounded buffer problem. Explain Virtual memory in cotext of Operating System
[BL-2]
(15) Explain swapping and types of swapping with example. [BL-2]
(16) List two programming examples of multithreading giving improved performance over a
single-threaded solution. [BL-3]
(17) Discuss how the following pairs of scheduling criteria conflict in certain settings. i) CPU
utilization and response time ii) Average turn around time and maximum waiting time
iii)I/O device utilization and CPU utilization. [BL-3]
(18) Explain dining philosopher’s problem with its advantages. [BL-2]
(19) Elaborate the actions taken by the kernel to context-switch between processes. [BL-2]
(20) State critical section problem? Discuss three solutions to solve the critical section
problem. [BL-2]
(21) Explain the difference between pre-emptive and non-pre-emptive scheduling. [BL-2]
(22) Illustrate an example situation in which ordinary pipes are more suitable than named
pipes and an example situation in which named pipes are more suitable than ordinary
pipes. [BL-3]
(23) Distinguish among short-term, medium-term and long-term scheduling with suitable
example. [BL-2]
(24) Write about the various CPU scheduling [Link] details. [BL-2]
(25) Consider the following resource-allocation policy. Requests and releases for resources
are allowed at any time. If a request for resources cannot be satisfied because the
resources are not available, then we check any processes that are blocked, waiting for
resources. If they have the desired resources, then these resources are taken away from
them and are given to the requesting process. The vector of resources for which the
waiting process is waiting is increased to include the resources that were taken away.
For example, consider a system with three resource types and the vector Available
initialized to (4,2,2). If process P0 asks for (2,2,1), it gets them. If P1 asks for (1,0,1), it
gets them. Then, if P0 asks for (0,0,1), it is blocked (resource not available). If P2 now
asks for (2,0,0), it gets the available one (1,0,0) and one that was allocated to P0 (since
P0 is blocked). P0‘s Allocation vector goes down to (1,2,1), and its Need vector goes up
to (1,0,1). a. Predict whether deadlock occurs? If so, give an example. If not, which
necessary condition cannot occur? b. Predict whether indefinite blocking occurs?
[BL-3]