Solution:
initial = float(eval(input('Enter the monthly saving amount: ')))
x = (1 + 0.00417)
month_one = initial * x
month_two = (initial + month_one) * x
month_three = (initial + month_two) * x
month_four = (initial + month_three) * x
month_five = (initial + month_four) * x
month_six = (initial + month_five) * x
print('The sixth month value is: '+str(month_six))
Don't forget the saving amount, and initialize the balance with that amount. Inside the loop, work out and add the interest and then add the saving amount for the next month.
balance = 801
for month in range(6):
balance = balance * (1.00417)
print(balance)
Computational thinking inclines invokes the techniques of decomposition, latter reconstruction, abstraction & algorithms development
Answer:
d. Merge sort
Explanation:
Merge sort is example of an efficient sorting alogrithm. The Divide and conquer rule is used in this technique. This method breakdown the list into multiple sublists and each sublist contains a single element. This technique merged in the form of sorted lists. This technique uses external memory of the system while sorting.
Merge sort is used to sort the 10,000 items using only 1,000 slots available in the RAM.
<span>Second generation of computer apparatus. Second Generation: Transistors
(1956-1963)</span>
The world
would see transistors substitute vacuum tubes in the second generation of
computers. The transistor was created at Bell Labs in 1947 but did not see omnipresent
use in computers until the late 1950s.
The
transistor enormously higher positioning to the vacuum tube, allowing PCs to
transform into littler, speedier, less expensive, more vitality effective and
more dependable than their first-generation predecessors. Though the transistor
still generated a great deal of heat that subjected the computer to destruction,
it was a vast development over the vacuum tube. Second-generation computers
still confidence on punched cards for input and printouts for production.
<span> </span>
Answer:
Check the explanation
Explanation:
bool oneSale(string item){
for(int i=0;i<capacity;i++){ // iterate till the capcity of array
if(item==grocerryList[i].name()){ // if name matches
if(grocerryList[i].getStock()>0){ // and stock is greater than 0
grocerryList[i].setStock(grocerryList[i].getStock()-1); // subtract 1 from the stock
// or alternate is grocerryList[i].stock= grocerryList[i].stock-1;
return true; // return true
}
}
else if(item==grocerryList[i].name()){ // if name matches
if(grocerryList.getStock()==0){ // but stock is empty
return false; // return falsse
}
}
else{ // means item is not available so there is no need to check stock
return false; // return false
}
}
}
