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 (22 June 2026)

8 questions · answer key at the end · updated 1 Oct 2026
Q56. Match List - I with List - II.
List - IList - II
A. LatencyI. number of tasks completed in a given time period
B. DelayII. causes the current activity to be deferred
C. ThroughputIII. time elapsed before next activity starts
D. InterruptIV. time to complete a single task
Choose the correct answer from the options given below:
  1. A-I, B-III, C-II, D-IV
  2. A-III, B-IV, C-I, D-II
  3. A-IV, B-II, C-III, D-I
  4. A-IV, B-III, C-I, D-II
Answer & explanation →
Q79. In Rate Monotonic scheduling, if a task has a period of 80 ms and an execution time of 55 ms, then its processor utilization and task rate will be
  1. 0.69, 12.5 Hz
  2. 0.58, 12.3 Hz
  3. 0.48, 11.4 Hz
  4. 0.38, 10.5 Hz
Answer & explanation →
Q83. Match the LIST-I with LIST-II.
LIST-ILIST-II
A. Disk SchedulingI. Round Robin
B. Batch ProcessingII. SCAN
C. Time SharingIII. LIFO
D. Interrupt ProcessingIV. FIFO
Choose the correct answer from the options given below:
  1. A-III, B-IV, C-II, D-I
  2. A-IV, B-III, C-II, D-I
  3. A-II, B-IV, C-I, D-III
  4. A-II, B-I, C-IV, D-III
Answer & explanation →
Q108. For the reference string: (given that number of frames is 3)
7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1
for the optimal page replacement algorithm, which of the following will represent the hit ratio?
  1. 11/20
  2. 10/20
  3. 9/20
  4. 12/20
Answer & explanation →
Q109. Which of the following is not an interprocessor communication mechanism in UNIX?
  1. Pipes
  2. Messages
  3. Shared memory
  4. Semaphore
Answer & explanation →
Q125. In disk scheduling example, suppose the disk tracks are numbered from 0 to 49. Head is presently positioned at track 15 and requests for tracks 4, 40, 11, 35, 7 and 14 have arrived (in that order). It takes 1 ms to travel from one track to the next adjacent track. Following disk scheduling algorithms are to be executed and total time traversed is to be recorded (in ms) in ascending order (assume arm-movement toward high numbered request first, wherever needed):
A. FCFS
B. LOOK
C. SSTF
D. SCAN
Choose the correct answer from the options given below:
  1. C, B, D, A
  2. B, A, C, D
  3. C, D, B, A
  4. D, B, C, A
Answer & explanation →
Q128. Following is not the feature/characteristic of Linked-List allocation of Files in a File system:
  1. No space is lost in this allocation to disk fragmentation (except for internal fragmentation in the last block)
  2. Reading of files or accessing them in Random access is very fast
  3. Amount of data stored in a block is not in powers of 2 as pointer takes few bytes
  4. The disadvantages of Linked-List allocation can be overcome by using a Table in main memory called FAT
Answer & explanation →
Q129. Match List - I with List - II.
List - IList - II
A. MacrosI. Converts high level code to object (Machine) code
B. AssemblerII. Used for code Expansion
C. LoaderIII. Used to translate assembly language code to object code
D. CompilerIV. Used to allocate memory and relocate program in memory
Choose the correct answer from the options given below:
  1. A-IV, B-III, C-I, D-II
  2. A-II, B-III, C-I, D-IV
  3. A-II, B-III, C-IV, D-I
  4. A-IV, B-I, C-III, D-II
Answer & explanation →

Answer key

  1. 56 – D
  2. 79 – A
  3. 83 – C
  4. 108 – A
  5. 109 – D
  6. 125 – A
  7. 128 – B
  8. 129 – C