Qus : 1
UGC NET Computer Science PYQ 4 Consider the following interrupt protection levels in Linux, and arrange them in the increasing order of their priorities:
A. User-Mode Programs (Preemptible )
B. Bottom Half Interrupt Handlers
C. Top Half Interrupt Handlers
D. Kernel System Service Routines (Preemptible )
Choose the correct answer from the options given below: 1
B → A → C → D 2
C → B → A → D 3
C → A → B → D 4
A → D → B → C Go to Discussion UGC NET Computer Science UGC NET PYQ UGC NET Computer Science UGC NET Computer Science 26 June 2025 (Paper II) PYQ Solution
User-Mode Programs have the lowest priority and are preemptible.Kernel System Service Routines run in kernel mode and can be preempted by higher priority tasks like interrupts.Bottom Half Interrupt Handlers execute after the top half and have higher priority than kernel threads.Top Half Interrupt Handlers handle immediate hardware responses and have the highest priority.
Qus : 2
UGC NET Computer Science PYQ 2 Match List I with List II
List I
List II
A. Clustered Page Table
III. Useful for sparse address spaces.
B. Hierarchical Page Table
I. Generally considered inappropriate for 64-bit architectures.
C. Segmentation
IV. Supports a user view of the system.
D. Inverted Page Table
II. Has only entry for each real page (or frame) of memory.
Choose the correct answer from the options given below:
1
$A \rightarrow III,\; B \rightarrow I,\; C \rightarrow II,\; D \rightarrow IV$ 2
$A \rightarrow III,\; B \rightarrow I,\; C \rightarrow IV,\; D \rightarrow II$ 3
$A \rightarrow III,\; B \rightarrow III,\; C \rightarrow I,\; D \rightarrow IV$ 4
$A \rightarrow IV,\; B \rightarrow III,\; C \rightarrow II,\; D \rightarrow I$ Go to Discussion UGC NET Computer Science UGC NET PYQ UGC NET Computer Science UGC NET Computer Science 26 June 2025 (Paper II) PYQ Solution Explanation:
$A \rightarrow III$ → Clustered Page Table is useful for sparse address spaces .
$B \rightarrow I$ → Hierarchical Page Table is inappropriate for 64-bit architectures .
$C \rightarrow IV$ → Segmentation supports user’s logical view .
$D \rightarrow II$ → Inverted Page Table has only one entry per real page frame .
Qus : 3
UGC NET Computer Science PYQ 2 Arrange the process of virtualization in cloud environments.
A. Hypervisor installed on physical server
B. Virtual machines created
C. Resources allocated to Virtual machines
D. Virtual machines run isolated workloads
1
B, C, A, D 2
A, B, C, D 3
A, C, B, D 4
B, C, D, A Go to Discussion UGC NET Computer Science UGC NET PYQ UGC NET Computer Science UGC NET Computer Science 26 June 2025 (Paper II) PYQ Solution Step 1 – Install hypervisor on the physical server.
Step 2 – Create virtual machines.
Step 3 – Allocate resources (CPU, RAM, etc.) to each VM.
Step 4 – VMs run isolated workloads.
Qus : 5
UGC NET Computer Science PYQ 2 List I (RAID Levels) List II (Description) A. RAID Level 2 IV. Also known as Memory style error correcting code organization B. RAID Level 3 III. Bit interleaved parity C. RAID Level 5 I. Block interleaved distribution parity D. RAID Level 6 II. Also known as P+Q redundancy scheme
Choose the correct answer from the options given below:
1
A→IV, B→III, C→I, D→II 2
A→III, B→IV, C→I, D→II 3
A→I, B→III, C→IV, D→II 4
A→II, B→IV, C→I, D→III Go to Discussion UGC NET Computer Science UGC NET PYQ UGC NET Computer Science UGC NET Computer Science 26 June 2025 (Paper II) PYQ
Solution
Qus : 6
UGC NET Computer Science PYQ 4 Consider the following table about processes, their burst time and arrival time
Process Burst Time Arrival Time P1 9 0 P2 30 0 P3 4 0 P4 8 2 P5 11 6
Now, which process finishes second last in the Gantt chart for:
non-preemptive SJF, and
Round Robin (time quantum = 10)?
1
SJF : $P_4$ ; RR : $P_4$ 2
SJF : $P_5$ ; RR : $P_4$ 3
SJF : $P_4$ ; RR : $P_3$ 4
SJF : $P_5$ ; RR : $P_5$ Go to Discussion UGC NET Computer Science UGC NET PYQ UGC NET Computer Science UGC NET Computer Science 26 June 2025 (Paper II) PYQ Solution Scheduling Execution order (finish times) Second last finisher Non-preemptive SJF P3(0–4) → P4(4–12) → P1(12–21) → P5(21–32) → P2(32–62) P5 Round Robin, q=10 P1(0–9, finishes) → P2(9–19) → P3(19–23, finishes) → P4(23–31, finishes) → P5(31–41) → P2(41–51) → P5(51–52, finishes) → P2(52–62, finishes) P5
Qus : 10
UGC NET Computer Science PYQ 1 Identify the correct statement(s) from the following with respect to Spinlock Semaphores:
A. The name refers to busy waiting semaphores.
B. They are not useful when the locks are to be held for a short duration of time.
C. It may require multiple context switches when a process waits on a lock.
D. They are often employed on Uniprocessor systems.
1
A Only 2
D Only 3
B, D Only
4
A, C and D Only Go to Discussion UGC NET Computer Science UGC NET PYQ UGC NET Computer Science UGC NET Computer Science 26 June 2025 (Paper II) PYQ Solution Spinlocks are busy waiting locks, meaning the thread repeatedly checks until the lock becomes available — so A is correct.
They are actually useful for short duration locks, since blocking (context switch) is costlier — so B is incorrect.
They do not cause context switches, as the waiting is done actively in CPU — so C is incorrect.
Spinlocks are inefficient on uniprocessor systems, because while one thread spins, the other cannot release the lock — so D is incorrect.
[{"qus_id":"14622","year":"2025"},{"qus_id":"14982","year":"2025"},{"qus_id":"14985","year":"2025"},{"qus_id":"14988","year":"2025"},{"qus_id":"14990","year":"2025"},{"qus_id":"14998","year":"2025"},{"qus_id":"15001","year":"2025"},{"qus_id":"15003","year":"2025"},{"qus_id":"15011","year":"2025"},{"qus_id":"15019","year":"2025"},{"qus_id":"15035","year":"2025"},{"qus_id":"15040","year":"2025"}]
