iven:
- Logical address space = 32 bits → total addressable memory = \( 2^{32} \) bytes
- Page size = 4 KB = \( 2^{12} \) bytes → So, 12 bits for offset
That leaves: \[ 32 - 12 = 20 \text{ bits for the page number} \]
Now, two-level paging splits this 20-bit page number into:
- Outer page table bits (say, \( x \))
- Inner page table bits (remaining bits = \( 20 - x \))
We are told that the outer page table has 1024 entries. So:
\[ \text{Number of entries} = 2^x = 1024 \Rightarrow x = 10 \]
Hence, the number of bits used for the outer page number is 10.
Consider a system with the following: - \(\mathbb{P} = \{ P_1, P_2, P_3, P_4 \}\) consists of all active processes in an operating system. - \(\mathbb{R} = \{ R_1, R_2, R_3, R_4 \}\) consists of single instances of distinct types of resources in the system.
The resource allocation graph has the following assignment and claim edges: Assignment edges: \[ R_1 \to P_1, \quad R_2 \to P_2, \quad R_3 \to P_3, \quad R_4 \to P_4 \] (The assignment edge \( R_1 \to P_1 \) means resource \( R_1 \) is assigned to process \( P_1 \), and so on for others.)
Claim edges: \[ P_1 \to R_2, \quad P_2 \to R_3, \quad P_3 \to R_1, \quad P_2 \to R_4, \quad P_4 \to R_2 \] (The claim edge \( P_1 \to R_2 \) means process \( P_1 \) is waiting for resource \( R_2 \), and so on for others.)
Which of the following statement(s) is/are CORRECT?
Five friends A, B, C, D, and E are sitting in a row facing north, but not necessarily in the same order:
B is to the immediate left of C
E is not at any of the ends
D is to the right of E but not next to C
A is at one of the ends
Who is sitting in the middle?
Which of the following is not a characteristic of Object-Oriented Programming?