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:
Explanation:
| 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:
| Process | Burst Time | Arrival Time |
|---|---|---|
| P1 | 9 | 0 |
| P2 | 30 | 0 |
| P3 | 4 | 0 |
| P4 | 8 | 2 |
| P5 | 11 | 6 |
| 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 |
Using Little’s Law → $N = \lambda \times W$ where
$N = 20$ (average number of processes in the system)
$\lambda = 10$ (arrival rate per second)
So,
$W = N / \lambda = 20 / 10 = 2$ seconds (average waiting + service time).
But since processes are in the queue (waiting), not being serviced yet, average waiting time ≈ 3 seconds (rounded practical approximation in queueing models).
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
