Answer: "N" is considered as the size of the input that is being given in the algorithm.
Explanation: During a problem solving process , a algorithm is used to analyze the problem . Many function and steps are to be taken care of while analyzing algorithm. Among analyzing step, input is also given which is usually zero more than that . An input has a certain size which is given by the initial "N". The input size defines the length of the string for the input.
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:
Time taken to travel from one track to the next = 0.08ms
Initial track= 15 0
4 (15-4)*(0.08)= 0.88
40 (40-4)*(0.08)= 2.88
35 (40-35)*(0.08)= 0.4
11 (35-11)*(0.08)= 1.92
14 (14-11)*(0.08)= 0.24
7 (14-7)*(0.08)= 0.56
----------------------------------------------
Total seek time=0.88+2.88+0.4+1.92+0.24+0.56=6.88ms
Explanation:
We caculate the seek time for each request, and then add them together to find the total seek time. The final track number for the current request becomes the current track of next request, and this process is repeated till the last request is processed.
Answer:
Monday or Tuesday or Wednesday I am going back to work
Explanation:
