Answer:
i think its b if not sorry
Explanation:
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
Answer:
A and C are the only <u>legal</u> but unethical options
3. 8.1
Looking at the functions "average", and "mystery" it's pretty obvious that "average" returns a double precision average of the value of an integer array. The function "mystery" returns an array of integers with each value in the array being the length of the string in the array of strings passed to "mystery" in the same ordinal position.
The main body of the code initializes an array of strings and then passes that array to "mystery" who's output is then passed into the function "average". Since the lengths of the words passed to "mystery" is 7, 5, 6, 10, 10, 8, 13, 6, 8, 8, the sum will be 81, so the average will be 81/10 = 8.1 which matches option "3".
