Sure, here are some challenging numerical-based questions related to Operating Systems for

the GATE exam:

1. **Virtual Memory Calculation:**

In a computer system, the physical memory size is 16 GB, and the virtual memory size is
64 GB. The page size is 4 KB. Calculate the number of bits required for the page number and
page offset in the virtual memory system.

2. **Disk Scheduling Algorithm:**

Consider a disk with 800 cylinders numbered from 0 to 799. The disk scheduling algorithm
uses the SCAN (Elevator) algorithm. The disk arm starts at cylinder 50, and the queue of
pending requests, in the order of their arrival, is as follows: 98, 183, 37, 122, 14, 124, 65, 67.
Compute the total distance (in cylinders) that the disk arm moves to satisfy all the pending
requests.

3. **CPU Burst Calculation:**

Given a set of CPU bursts for a process: {5, 8, 12, 3, 10}, and the time quantum for a
round-robin scheduling algorithm is 6 units. Calculate the average waiting time using round-
robin scheduling.

4. **Page Replacement Algorithm:**

Consider a demand-paging system with the following time parameters:
- Page fault service time = 10 milliseconds
- Time to transfer one page to memory = 1 millisecond
- Memory access time = 0.1 milliseconds
If the page fault rate is 0.01, calculate the effective access time.

5. **Banker's Algorithm:**
Consider a system with 5 resource types and 4 processes. The allocation and maximum
need matrices are given below:
Allocation:
```
3110
1000
1354
0632
0011
```
Maximum Need:
```
4211
1100
7899
3333
3333
```
If the available resources are {1, 0, 0, 2}, determine whether the system is in a safe state or
not using the Banker's algorithm.

6. **Page Table Calculation:**

 Consider a computer system with a 32-bit virtual address and a page size of 4 KB. If the
system uses a two-level page table, where each page table entry is 4 bytes, calculate the size
of the outer and inner page tables.

7. **Disk Space Management:**

Suppose a disk block is 512 bytes, and the disk has 1024 blocks. The free space is managed
using a linked list, where each block contains a pointer to the next free block. If each pointer
requires 2 bytes, calculate the percentage of the disk space consumed by pointers.

These questions involve various concepts of Operating Systems and require critical thinking
and problem-solving skills to solve. Let me know if you need solutions or further
explanations for any of these questions!