Answer:
Given that:
A= 40n^2
B = 2n^3
By given scenario:
40n^2=2n^3
dividing both sides by 2
20n^2=n^3
dividing both sides by n^2 we get
20 = n
Now putting n=20 in algorithms A and B:
A=40n^2
= 40 (20)^2
= 40 * (400)
A= 16000
B= 2n^3
= 2 (20)^3
= 2(8000)
B= 16000
Now as A and B got same on n = 20, then as given:
n0 <20 for n =20
Let us take n0 = 19, it will prove A is better than B.
We can also match the respective graphs of algorithms of A and B to see which one leads and which one lags, before they cross at n= 20.
Answer:
command line and graphical user interface
Explanation:
there were (and still are) operating system with no graphical user interface at all, as for example some Unix releases
<span>ExpressCard modules and USB adapters are faster and smaller. They are easier to plug into a computer and allow a person to add memory, wired and wireless communications, multimedia, and security features by inserting the small card or adapter into a small slot in the computer.</span>
Answer: $1,500
Explanation:
The future value of value using simple interest is:
Future value = Value * ( 1 + rate * time)
2,400 = Value * (1 + 15% * 4)
2,400 = Value * 1.6
Value = 2,400 / 1.6
Value = $1,500
/*
Since we have to check the first two options only as mentioned in last part of question the loop will work 2 times only and will compare the cost of first element and second and assign the healthoption accordingly
*/
for(int i =0;i<=1;i++){
if(annualCost[i]<annualCost[i+1]
best2 = healthOption[i]
else
best2 = healthOption[i+1]
}