Task 1:
float75 = float(75)
string75 = "75"
# you cannot add together a number and a string because a string has no inherent numerical value like a number does.
Task 2:
num = float(input("Enter a number"))
print(num**2)
Task 3:
num = int(input("Enter an integer: "))
print("When you divide "+str(num)+" by 7, the quotient is "+str(num//7)+" and the remainder is "+str(num%7)+".")
Task 4:
gigs = int(input("How many gigabytes does your flashdrive hold? "))
print("A flashdrive with "+str(gigs)+ " gigabyte(s) holds "+str(gigs*8589934592)+" bit(s).")
For task 4, you might have to change the number 8589934592 to something else. I'm not entirely sure how many bits are in a gigabyte. I hope this helps though.
Answer:
B.O(n).
Explanation:
Since the time complexity of visiting a node is O(1) in iterative implementation.So the time complexity of visiting every single node in binary tree is O(n).We can use level order traversal of a binary tree using a queue.Which can visit every node in O(n) time.Level order traversal do it in a single loop without doing any extra traversal.
Motherboard
Power Supply
Graphics Card (gpu)
Storage (Hard Drive or Solid State Drive)
Processor (cpu)
RAM
That should be the main components. There are other non-essential ones.
No speak a Spanish ............
