Answer:
Time Complexity of Problem - O(n)
Explanation:
When n= 1024 time taken is t. on a particular computer.
When computer is 8 times faster in same time t , n can be equal to 8192. It means on increasing processing speed input grows linearly.
When computer is 8 times slow then with same time t , n will be 128 which is (1/8)th time 1024.
It means with increase in processing speed by x factor time taken will decrease by (1/x) factor. Or input size can be increased by x times. This signifies that time taken by program grows linearly with input size n. Therefore time complexity of problem will be O(n).
If we double the speed of original machine then we can solve problems of size 2n in time t.
The term would process. A process is an instance of a program being executed.
The program is an illustration of recursive functions in Python;
Recursive functions are functions executed from within itself
<h3>The python program</h3>
The program written in python, where comments are used to explain each action is as follows:
#This defines the function
def revStr(myStr):
#This returns an empty string if the string is empty
if myStr == "":
return myStr
#If otherwise, this returns the reversed string recursively
else:
return revStr(myStr[1:]) + myStr[0]
Read more about python recursions at:
brainly.com/question/19089783
#SPJ1
Answer:
When you shut down your PC, all your open programs close and the PC shuts down your operating system. but In sleep mode, the PC enters a low-power state. The PC's state is kept in memory, but other parts of the PC are shut down and won't use any power.
Explanation:
Answer:
acceleration = 4.76 m/s²
Explanation:
Given that"
the mass of the dynamic trolley = 0.6 kg
the mass of the load = 1.5 kg
total mass = (0.6 + 1.5) kg = 2.1 kg
the force = 10 N
Thus;
using the formula of force which is;
Force = mass × acceleration
10 = 2.1 × acceleration
acceleration = 10/2.1
acceleration = 4.76 m/s²
