Which one of the following types of operating systems is designed... | Computer Science MCQ [Updated November 2026] | GkGet

1

Consider a system with four processes and four resources: P1 holds R1 and requests R2 P2 holds R2 and requests R3 P3 holds R3 and requests R4 P4 holds R4 and requests R2 Each resource has exactly one instance. Which statement is correct?

Solve Question→

2

A system has 18 instances of a single resource type, shared among n processes. If each process requires at most 5 instances, what is the maximum value of n for which the system can guarantee that a deadlock will never occur?

Solve Question→

3

In a system implementing the Readers–Writers synchronization mechanism, consider the following statements: 1. Multiple readers can access the shared data simultaneously if no writer is writing. 2. A writer must get exclusive access to the shared data while writing. 3. Readers and writers can access the shared data simultaneously without causing inconsistency. Choose the correct answer from the options given below:

Solve Question→

4

Suppose P1, P2, P3, and P4 are cooperating processes sharing a common resource under the Mutual Exclusion condition. If process P3 is currently executing inside its critical section, then which of the following must be true?

Solve Question→

5

Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. Assertion A: Increasing the total number of physical memory frames allocated to a process can counterintuitively result in an increased number of page faults when using the First-In-First-Out (FIFO) algorithm. Reason R: The FIFO algorithm is not a stack-based algorithm, whereas algorithms like Optimal (OPT) or Least Recently Used (LRU) belong to the stack-based category. In the light of the above statements, choose the most appropriate answer from the options given below:

Solve Question→

6

Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. Assertion A: Compaction is a technique utilized to eliminate external fragmentation by shuffling memory contents to gather all free memory into a single contiguous block. Reason R: The process of compaction strictly necessitates the use of execution-time binding because memory addresses must be changed and data relocated while the program is running. In the light of the above statements, choose the most appropriate answer from the options given below:

Solve Question→

7

Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. Assertion A: In an operating system utilizing basic paging, the time required to access a memory location is inherently double that of a standard physical memory access. Reason R: A Translation Lookaside Buffer (TLB) functions as a high-speed associative hardware cache that stores recently used mappings from the page table to improve system performance. In the light of the above statements, choose the most appropriate answer from the options given below:

Solve Question→

8

Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. Assertion A: Execution-time address binding necessitates the use of a hardware-based Memory Management Unit (MMU) to perform runtime address translation. Reason R: Modern operating system features, such as virtual memory and dynamic relocation, are fundamentally built upon the capabilities provided by execution-time binding. In the light of the above statements, choose the most appropriate answer from the options given below:

Solve Question→

Which one of the following types of operating systems is designed to respond to an event within a strictly predetermined or rigid time constraint?

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Computer Science?

Which one of the following types of operating systems is designed to respond to an event within a strictly predetermined or rigid time constraint?

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Computer Science?

Related Practice Questions