Answer:
1000/125 billion instructions per second.
Explanation:
All the stages take 125ps and latch time was outlooked.
The clock speed would be the highest stage time in all 5 stages. Here all are same clock speed it would be 125ps only.
throughput = 1/cycle time so ⇒ 1/125 instructions/ps
Since we want it in billion instructions per second so we have to multiply with 10⁻⁹ /10⁻¹² then the result is 1000/125 billion instructions per second.
import random
def random_number_file_writer(nums):
f = open("random.txt", "w")
i = 0
while i < nums:
f.write(str(random.randint(1,500))+"\n")
i += 1
f.close()
def random_number_file_reader():
f = open("random.txt", "r")
total = 0
count = 0
for x in f.readlines():
total += int(x)
count += 1
print("The total of the numbers is "+str(total))
print("The number of random numbers read from the file is "+str(count))
def main():
random_number_file_writer(int(input("How many random numbers do you want to generate? ")))
random_number_file_reader()
main()
I hope this helps!
Answer:
it may not be easy
Explanation:
because am using a phone not a cuputer
True, in order for the text color to be changed you have to select the entire text. If no text is selected one of two things will happen; either nothing will happen at all, or the next wors you type will be a different color.
Answer:
2 times as many items can be uniquely identified
Explanation:
Option 'C' is the answer. because
if we use 6 bit binary sequence
then
No. of Unique address will be = 2 ^ 6 = 64
as we increase the bit by 1. Now total bits are 7.
so
No. of Unique address for 7 bit Sequence = 2 ^ 7 = 128
So,
128 is double of 64, that is 2 times greater value than 64.
