System Software and Operating System – Previous Year Questions
336 questions from past UGC NET Paper 2 – Computer Science papers, each with the correct answer. Open any question for its explanation.
Topic-wise mock tests
- What shall be the 2nd request processed by the C-LOOK (Right) disk scheduling technique for the given request queue?
- What shall be the total head movement of cylinders for the C-SCAN disk scheduling technique if the head starts moving in the right direction from the initial position? (Assume cylinders 0–199)
- What shall be the 2nd request processed by the SCAN (Left) disk scheduling technique for the given request queue?
- What will be the total head movement of cylinders for the SSTF disk scheduling technique?
- What shall be the total head movement of cylinders if the FCFS disk scheduling method is used?
- Consider the following disk-scheduling movement and identify the algorithm it represents. Request queue: 84, 125, 11, 36, 170, 20, 172, 45 (cylinders 0–199). The head starts at cylinder 28 and services 36 → 45 → 84 → 12…
- Match List I with List IIList I List II A. RAID level 1 I. Bit-interleaved parity organization B. RAID level 2 II. Disk mirroring C. RAID level 3 III. Block-interleaved parity organization D. RAID level 4 IV. ECC organi…
- If the virtual memory size is 32 MB and the physical memory size is 4 MB with a page size of 2 KB, calculate the number of frames available in physical memory.
- Which of the following does NOT interrupt a running process?
- Given the following processes with their burst times and priorities (lower number indicates higher priority), all arriving at time 0, what is the average waiting time using the (non-preemptive) priority scheduling algor…
- Calculate the average response time for these processes with the non-preemptive priority scheduling algorithm. Priorities are as follows; consider that all the processes arrive at time 0 (low numbers represent high prio…
- Find the average weighted turnaround time for these processes using the Highest Response Ratio Next (HRN) algorithm.
- What is the average turnaround time for these processes with the First Come First Serve (FCFS) scheduling algorithm?
- What is the average waiting time for these processes with non-preemptive Shortest Job First (SJF) scheduling?
- When we apply the Shortest Job First (SJF) scheduling algorithm, process P2 faces partial starvation and waits a longer time to execute. Which one of the following algorithms addresses this problem?
- 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 des…
- 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 d…
- Match List I (Algorithms) with List II (Characteristics)List I List 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…
- Match List I (operating system concepts) with List II (characteristics)List I List II (A) Paging (I) Evicts least recently used page (B) LRU (Least Recently Used) (II) Extends physical memory (C) C-SCAN (III) Logical to…
- 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…
- Which of the following is NOT a requirement for the Banker's algorithm to grant a resource request?
- Which data structures does the Banker's Algorithm use to maintain the state of available, maximum and allocated resources?
- What is the significance of the Banker's algorithm in terms of resource management?
- What is the primary goal of the Banker's Algorithm?
- What information is used to determine if a resource request can be granted?
- An address in main memory is called:
- The head of a moving-head disk with 200 tracks, numbered 0 to 199, has just finished a request at track 125 and is currently serving a request at track 143. The queue of requests in FIFO order is 86, 147, 91, 177, 94, 1…
- Given 4 GB (≈ 4.3 × 10⁹ bytes) of virtual space, a typical page size of 4 KB and a page-table entry of 5 bytes, how many virtual pages would this imply, and what is the size of the whole page table?
- In Linux, where is the user password stored?
- Indexed (grouped) allocation is useful because: (A) It supports both sequential and direct access. (B) The entire block is available for data. (C) It does not require lots of space for keeping pointers. (D) There is no…