Answer:
The time complexity of the code is O(log₇n).
Explanation:
The i is updated by 7*i.On each iteration i is multiplied by 7.So on finding the time complexity of the code given above it will come out to be log base 7.
When we divide the input by 2 the time complexity is log base 2.
So on dividing it by 7 we get the time complexity of log base 7.
Answer:
cell address is the exact location of a particular cell of ms-excle
Explanation:
A1 refers to first row and first column.
A2 refers to second row first column.
i.e.
in 'A1' : 'A' indicate column { A= first column, B= second
column, C= third column. and soon.....}
'1' indicate row { 1 = first row, 2 = second row, 3= third row..... soon .......}
The answer to your question is true
Answer:
3 bits
Explanation:
Capacity of main memory=16 Bytes=24
The number of address bits= 4 bits.
The size of the word= 1 Byte=20
The word bits=0.
Number of lines =4
Number of sets required=21
The sets bits is =1
The number of offset bits=20=0
Number of tag bits= total number of address bits - (word bits + offset bits + set bits)
= 4 - 0 -0- 1
= 3 bits
