UGC NET · PAPER 2
UGC NET Paper 2 Computer Science – Unit 5: System Software and Operating System PYQ (September 2022)
Q22. If an operating system does not allow a child process to exist when its parent process has terminated, this phenomenon is called
- Threading
- Cascading termination
- Zombie termination
- Process killing
Q23. What is called journalling in the Linux operating system?
- Process scheduling
- File saving as a transaction
- A type of thread
- An editor
Q63. For the page reference string 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5, the number of page faults with LRU page replacement and 3 frames is
- 6
- 8
- 10
- 12
Q67. Match List I with List II.
Choose the correct answer from the options given below:
Choose the correct answer from the options given below:
| List I | List II |
|---|---|
| A. Activation record | I. Linker loader |
| B. Location counter | II. Garbage collection |
| C. Reference count | III. Subroutine call |
| D. Address relocation | IV. Assembler |
- A-III, B-IV, C-II, D-I
- A-IV, B-III, C-I, D-II
- A-IV, B-III, C-II, D-I
- A-II, B-III, C-I, D-IV
Q80. Match List I with List II.
Choose the correct answer from the options given below:
Choose the correct answer from the options given below:
| List I | List II |
|---|---|
| A. Least frequently used | I. Memory is distributed among processors |
| B. Critical section | II. Page replacement policy in cache memory |
| C. Loosely coupled multiprocessor system | III. Program section that once begun must complete execution before another processor accesses the same shared resource |
| D. Distributed operating system organization | IV. O/S routines are distributed among available processors |
- A-III, B-II, C-IV, D-I
- A-I, B-II, C-III, D-IV
- A-II, B-III, C-I, D-IV
- A-II, B-I, C-III, D-IV
Q81. Match List I with List II.
Choose the correct answer from the options given below:
Choose the correct answer from the options given below:
| List I | List II |
|---|---|
| A. Firmware | I. Number of logical records into physical blocks |
| B. Batch file | II. ASCII format |
| C. Packing | III. Resource allocation |
| D. Banker's algorithm | IV. ROM |
- A-II, B-I, C-IV, D-III
- A-II, B-I, C-III, D-IV
- A-IV, B-II, C-I, D-III
- A-IV, B-I, C-II, D-III
Q86. Match List I with List II.
Choose the correct answer from the options given below:
Choose the correct answer from the options given below:
| List I | List II |
|---|---|
| A. Stack algorithm | I. Deadlock |
| B. Elevator algorithm | II. Disk scheduling |
| C. Priority scheduling | III. Page replacement algorithm |
| D. Havender's algorithm | IV. CPU scheduling |
- A-III, B-II, C-IV, D-I
- A-II, B-III, C-IV, D-I
- A-III, B-II, C-I, D-IV
- A-II, B-III, C-I, D-IV
Q97. Given below are two statements: Assertion (A) and Reason (R).
Assertion (A): A load-and-go assembler avoids the overhead of writing the object program out and reading it back in.
Reason (R): This can be done with either a one-pass or a two-pass assembler.
Choose the correct answer.
Assertion (A): A load-and-go assembler avoids the overhead of writing the object program out and reading it back in.
Reason (R): This can be done with either a one-pass or a two-pass assembler.
Choose the correct answer.
- Both (A) and (R) are true and (R) is the correct explanation of (A)
- Both (A) and (R) are true but (R) is NOT the correct explanation of (A)
- (A) is true but (R) is false
- (A) is false but (R) is true