All mock tests are FREE till 31 December — register to save your progress
UGC NET · PAPER 2

UGC NET Paper 2 Computer Science – Unit 5: System Software and Operating System PYQ (June 2024 Re-Exam)

10 questions · answer key at the end · updated 11 Oct 2026
Q5. Which of the following statements are TRUE about mutual exclusion in concurrent programming?
(A) Mutual exclusion ensures that only one process can be in a critical section at any given time.
(B) Mutual exclusion is designed to prevent conflicts and ensure that only one process can access shared resources at a time.
(C) Mutual exclusion can use various algorithms to ensure that processes do not enter the critical section simultaneously.
(D) Mutual exclusion allows multiple processes to access the critical section simultaneously to improve performance.
Choose the correct answer from the options given below:
  1. (A), (B), (C) Only
  2. (B), (C), (D) Only
  3. (B), (D), (A) Only
  4. (A), (C), (D) Only
Answer & explanation →
Q16. Which of the following statements are TRUE about privileged instructions?
(A) They can only be executed by the operating system kernel and not by user applications.
(B) They are designed to perform operations that can directly affect the hardware or system state, such as I/O operations or changing memory-management settings.
(C) User applications can execute privileged instructions if they have the correct permissions set by the operating system.
(D) They are usually executed in user mode to ensure the safety and security of the system.
Choose the correct answer from the options given below:
  1. (A) and (B) Only
  2. (A), (B) and (C) Only
  3. (B) and (C) Only
  4. (B), (C) and (D) Only
Answer & explanation →
Q55. Match List I (Algorithms) with List II (Characteristics)
List IList II
(A) First Come First Served (FCFS)(I) Each process is assigned a priority.
(B) Shortest Job First (SJF)(II) Ensures fair allocation of CPU time by assigning a time slice.
(C) Round Robin (RR)(III) Processes are executed in the order they arrive.
(D) Priority Scheduling(IV) Selects the process with the smallest next burst time.
  1. (A)-(II), (B)-(III), (C)-(IV), (D)-(I)
  2. (A)-(II), (B)-(IV), (C)-(III), (D)-(I)
  3. (A)-(III), (B)-(IV), (C)-(II), (D)-(I)
  4. (A)-(III), (B)-(IV), (C)-(I), (D)-(II)
Answer & explanation →
Q57. Match List I (operating system concepts) with List II (characteristics)
List IList II
(A) Paging(I) Evicts least recently used page
(B) LRU (Least Recently Used)(II) Extends physical memory
(C) C-SCAN(III) Logical to physical mapping
(D) Virtual Memory(IV) Circular disk access
  1. (A)-(III), (B)-(IV), (C)-(I), (D)-(II)
  2. (A)-(III), (B)-(I), (C)-(IV), (D)-(II)
  3. (A)-(I), (B)-(III), (C)-(IV), (D)-(II)
  4. (A)-(I), (B)-(IV), (C)-(III), (D)-(II)
Answer & explanation →
Q75. Which of the following statements are TRUE about the Process Control Block (PCB)?
(A) The PCB contains information about the process state, such as whether it is running, waiting or terminated.
(B) The PCB includes the program code and data segments of the process.
(C) The PCB stores the process's memory-management information, such as page tables and segment tables.
(D) The PCB is used to track process scheduling information and CPU registers for process execution.
Choose the correct answer from the options given below:
  1. (A), (B) and (C) Only
  2. (B), (C) and (D) Only
  3. (A), (C) and (D) Only
  4. (A) and (B) Only
Answer & explanation →

Directions (Q96–100): The Banker's Algorithm is a deadlock-avoidance method in operating systems, designed to facilitate resource allocation without causing deadlock. It maintains information about the maximum resources each process may require, the currently allocated resources and the available resources in the system. The algorithm checks each resource request to determine whether granting it would leave the system in a safe state, meaning that there is always a sequence in which all processes can complete their execution without getting stuck due to resource unavailability. Each process must specify its maximum demand for each resource type before it starts execution. When a process requests additional resources, the algorithm checks if granting the request will keep the system in a safe state. If so, the resources are allocated; otherwise the process must wait until its request can be safely fulfilled.

Q96. Which of the following is NOT a requirement for the Banker's algorithm to grant a resource request?
  1. The requested resources must be available.
  2. The system must be in a safe state after granting the request.
  3. The request must not exceed the maximum resources the process can request.
  4. The process must be the only one requesting resources.
Answer & explanation →
Q97. Which data structures does the Banker's Algorithm use to maintain the state of available, maximum and allocated resources?
  1. Priority Queue
  2. Hash table
  3. Wait-for Graph
  4. Matrices and Vectors
Answer & explanation →
Q98. What is the significance of the Banker's algorithm in terms of resource management?
  1. It ensures that all processes can finish their execution without deadlock.
  2. It eliminates the need for processes to request resources.
  3. It accelerates the execution of critical sections in processes.
  4. It minimizes the number of context switches between processes.
Answer & explanation →
Q99. What is the primary goal of the Banker's Algorithm?
  1. To allocate resources optimally
  2. To prevent processes from requesting resources
  3. To detect and recover from deadlocks
  4. To maximise CPU utilization
Answer & explanation →
Q100. What information is used to determine if a resource request can be granted?
  1. Available resources and current allocation of each process
  2. CPU utilization of each process
  3. Number of processes waiting for resources
  4. Arrival time of each process
Answer & explanation →

Answer key

  1. 5 – A
  2. 16 – A
  3. 55 – C
  4. 57 – B
  5. 75 – C
  6. 96 – D
  7. 97 – D
  8. 98 – A
  9. 99 – A
  10. 100 – A