Register

NIELIT 2021 Dec Scientist B - Section B: 69

• edited by
360 views
0 votes
0 votes

If the size of the logical address space is $2^{m}$ and the page size is $2^{n}$ addressing units, then the high order $\text{m-n bits}$ of a logical address designate the _____________ .

  1. offset 
  2. page no 
  3. frame no
  4. physical address
• edited by
User Avatar

1 Answer

1 votes
1 votes
page number offset

                 m-n bit                                                              n nit

logical address space =2^m. so m bit require to represent the address space 

page size=2^n. so n bit require for offset.

so page number =m-n.

Ans is option B.

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
soujanyareddy13 asked Dec 7, 2021
927 views
NIELIT 2021 Dec Scientist B - Section B: 43
Write Recurrence of Quick Sort in worst case. $ \text{T(n)} = \text{T (n-1)} + 1 $ $ \text{T(n)} = \text{T (n-1) + n} $ $ \text{T(n)} = 2 \text{T (n-1) + n} $ $ \text{T(n)} = \text{ T (n/3) + T (2n/2) + n} $
Write Recurrence of Quick Sort in worst case.$ \text{T(n)} = \text{T (n-1)} + 1 $$ \text{T(n)} = \text{T (n-1) + n} $$ \text{T(n)} = 2 \text{T (n-1) + n} $$ \text{T(n)} =...
User Avatar
0 votes
0 votes
0 answers
2
soujanyareddy13 asked Dec 7, 2021
536 views
NIELIT 2021 Dec Scientist B - Section B: 44
$y = 10 \cos (1800 \; \pi t) + 20 \cos (2000 \; \pi t) + 10 \cos (220 \; \pi t).$ Find the modulation index $(\mu)$ of the given wave. $0.3$ $0.5$ $0.7$ $1$
$y = 10 \cos (1800 \; \pi t) + 20 \cos (2000 \; \pi t) + 10 \cos (220 \; \pi t).$ Find the modulation index $(\mu)$ of the given wave. $0.3$$0.5$$0.7$$1$
User Avatar
0 votes
0 votes
1 answer
3
soujanyareddy13 asked Dec 7, 2021
591 views
NIELIT 2021 Dec Scientist B - Section B: 45
Match the following: ... $\text{W-3, X-1, Y-4, Z-2}$ $\text{W-3, X-1, Y-2, Z-4}$
Match the following:$$\begin{array} {llll} & \textbf{List-I} & & \textbf{List-II} \\ \text{W.} & \text{Condition coverage} & 1. & \text{Black-box testing} \\ \text{X.} ...
User Avatar
0 votes
0 votes
2 answers
4
soujanyareddy13 asked Dec 7, 2021
3,320 views
NIELIT 2021 Dec Scientist B - Section B: 46
_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms. $\text{NP}$ $\text{P}$ Hard Complete
_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms.$\text{NP}$$\text{P}$HardComplete
User Avatar
Link Copied!