Answer:
2^11
Explanation:
Physical Memory Size = 32 KB = 32 x 2^10 B
Virtual Address space = 216 B
Page size is always equal to frame size.
Page size = 16 B. Therefore, Frame size = 16 B
If there is a restriction, the number of bits is calculated like this:
number of page entries = 2^[log2(physical memory size) - log2(n bit machine)]
where
physical memory size = 32KB which is the restriction
n bit machine = frame size = 16
Hence, we have page entries = 2^[log2(32*2^10) - log2(16)] = 2ˆ[15 - 4 ] = 2ˆ11
I would think Microsoft Word would be the answer. It does everything a typewriter can.
Answer:
The FIND function returns the position (as a number) of one text string inside another. If there is more than one occurrence of the search string, FIND returns the position of the first occurrence. FIND does not support wildcards, and is always case-sensitive.
Explanation:
I would say the best clear answer is D, because A is a little bit unclear but I would say the best answer is D.
Why?
Mesh Topology is expensive considering more links as compared to Ring topology.
Answer:
The correct answer to the following question will be "Anonymous logon".
Explanation:
- Windows would never let anyone sign in interactively with an anonymous logon to the device, a person who has linked to the device without a login and password being given.
- So they won't have to verify to an account of the user just whether you are running any shares.r document, let everyone log into the machine collaboratively with such a logon.
Therefore, Anonymous logon is the right answer.
