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.
Answer:
For the first picture, choose the second pair, and for the second one, choose the first pair
Explanation:
Don’t stress. You’re no failure if you believe in yourself. Have some faith. Don’t give up and live your life to the fullest. Take care and stay safe!! :)
Answer:
- var projected_fee = 6000;
-
- for(var i = 1; i <= 5; i++){
- projected_fee = projected_fee * 0.02 + projected_fee;
- console.log("$" + projected_fee.toFixed(2));
- }
Explanation:
Firstly, create a variable, projected_fee, and set the initial tuition fee value to it (Line 1).
Next, user a for loop that run for 5 times to repeatedly calculate the projected_fee based on 2 percent of increment rate (Line 4) and display the projected fee to console terminal (Line 5). The output should be
$6120.00
$6242.40
$6367.25
$6494.59
$6624.48
