How efficient well if we are transmitting 6bits and we need 10 to transmit the 6 bits that would be 6/10 = .6 = 60% efficient.
No. The attributes of the table correspond to columns within the table. Each unique set of attribute values taken together correspond to table rows. Sometimes referred to as "records".
Answer:
- def is_prime(n):
- for i in range(2, n):
- if(n % i == 0):
- return False
- return True
-
- prime_truths = [is_prime(x) for x in range(2,101)]
- print(prime_truths)
Explanation:
The solution code is written in Python 3.
Presume there is a given function is_prime (Line 1 - 5) which will return True if the n is a prime number and return False if n is not prime.
Next, we can use the list comprehension to generate a list of True and False based on the prime status (Line 7). To do so, we use is_prime function as the expression in the comprehension list and use for loop to traverse through the number from 2 to 100. The every loop, one value x will be passed to is_prime and the function will return either true or false and add the result to prime_truth list.
After completion of loop within the comprehension list, we can print the generated prime_truths list (Line 8).
Answer:
Fault-Tolerance
Explanation:
Fault tolerance refers to the ability of a system (computer, network, cloud cluster, etc.) to continue operating without interruption when one or more of its components fail.
Answer:
19.71 ms
Explanation:
The disk rotates at 3600 rpm, hence the time for one revolution = 60 / 3600 rpm = 16.67 ms.
Hence time to read or write on a sector = time for one revolution / number of sectors per track = 16.67 ms / 32 sectors = 0.52 ms
Head movement time from track 8 to track 9 = seek time = 2 ms
rotation time to head up sector 1 on track 8 to sector 1 on track 9 = 16.67 * 31/32 = 16.15 ms
The total time = sector read time +head movement time + rotational delay + sector write time = 0.52 ms + 2 ms + 16.15 ms + 0.52 ms = 19.19 ms
