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
Answer:
def main():
# Accept data from the user
n=int(input('Enter the value of n:'))
k=2;
sum=0
print('The list of the prime numbers are as follows:')
# This loop runs from k to n
while k<=n:
# Call is_prime() method,
# to check whether k is a prime or not
sum=sum+is_prime(k)
k=k+1
print('Sum of the prime numbers:',sum)
# is_prime() Method
def is_prime(k):
prime=0
i=1
# Check k is a prime or not
while i<=int(k):
# Find the factors of k
if (k % i) == 0:
prime=prime+1
i=i+1
# If k as two factors
if(prime==2):
print(k)
return k;
# If k as more than two factors
else:
return 0;
# Call the main() method
main()
Explanation:
Answer:
B. Perform a scan of the drive for file fragmentation
Explanation:
When files are deleted from a drive chunks might be left behind, so over time there's chucks scattered around. When new files are added, they are also scattered around into the gaps left by the fragments (chunks of files scattered around the drive) making it harder to read for the system especially because they are large files. So the Hard drive has to be defragmented to rearrange the chucks and allow files to be easily read.
Answer:
NO .THATS NOT A GOOD QUESTIONS.
Explanation:THOSE R PERSONAL
