NEED HELP WITH PYTHON CODE. AND PLEASE PROVIDE DETAILS ON HOW AND WHAT DID YOU USE FOR YOUR WORK SEPARATELY. For tax purpose an item may be depreciated over a period of several years. With the straight-line method ofdepreciation, each year the item depreciates by (1/n)th of its original value. With the double-declining-balancemethod of depreciation, each year the item depreciates by (2/n)ths of its value at the beginning of that year. (In thefinal year it is depreciated by its value at the beginning of the year). Write a program that perform the followingtasks:a) Request a description of the item, the year of purchase, the cost of the item, the number of years to bedepreciated (estimated life), and the method of depreciation.b) Display a year-by-year description of the depreciation in a table setting. See Output Examples below:Output ExamplesEnter nane of iten purchased: conputerEnter year purchased: 2016Enter cost of iten: 2000Enter estinated life of iten (in years): 5Enter method of depreciation (SL or DDB>: SLDescription: computerYear of purchase: 2016Cost: $2,08.00Estimated life: 5 yearsMethod of depreciation: straight-line20162017201820192020Value atBeg of Yr.2,000.001,600.001,200.00800.00400.00Amount DeprecDuring Year400.00400.00400.00400.00400.00Total Depreciationto End of Year400.00800.001,200.001,600.002,000.00Enter name of iten purchased: conputerEnter year purchased: 2016Enter cost of iten: 2000Enter estinated life of iten (in years): 5Enter method of depreciation (SL or DDB): ddbDescription: computerYear of purchase: 2016Cost: $2,000.00Estinated life: 5 yearsMethod of depreciation: double-declining balance20162017201820192020Value atBeg of Yr.2,000.001,200.00720.00432.00259.20Anount DeprecDuring YearŠ08.80480.00288.00172.80259.20Total Depreciationto End of Year800.001,280.001,568.001,740.802,000.00 DDB Value BreakdownYearValue atBeg of yr.AmountTotal DepreciationDeprecTo end of YearDuringYear20162,000.00800.00800.002/5*200020171,200.00480.001280.002000-800=12002/5*1200800+480=12802018720.00288.001568.002000-1200-480=7202/5*720800+480+2882019432.00172.801740.802000-1200-480-288=4322/5*432800+580+288+172.802020259.20259.202000.002000-1200-480-288-172.80=259.20800+580+288+172.80+259.20

Actually, program is a executable software that runs on a computer.

For tax purpose an item may be depreciated over a period of several years. With the straight-line method of depreciation, cach year the item depreciates by (l/n)th of its original value. With the double-declining-balance method of depreciation, cach year the item depreciates by (2/n)ths of its value at the beginning of that year. (Int final year it is depreciated by its value at the beginning of the year). Write a program that perform the following tasks: a) Request a description of the item, the year of purchase, the cost of the item, the number of years to be depreciate d (estimated life), and the method of depreciation. b) Display a year-by-ycar description of the depreciation in a table setting. See Output Examples below: Putrut Exampiss

For tax purpose an item may be depreciated over a period of several years. With the straight-line method of depreciation, cach year the item depreciates by (l/n)th of its original value. With the double-declining-balance method of depreciation, cach year the item depreciates by (2/n)ths of its value at the beginning of that year. (Int final year it is depreciated by its value at the beginning of the year). Write a program that perform the following tasks: a) Request a description of the item, the year of purchase, the cost of the item, the number of years to be depreciate d (estimated life), and the method of depreciation. b) Display a year-by-ycar description of the depreciation in a table setting. See Output Examples below: Putrut Exampiss

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter12: Review Of Calculus And Probability

Section12.5: Random Variables, Mean, Variance, And Covariance

Problem 5P

See similar textbooks

Similar questions

Suppose for an international football tournament, you wish to find the probability of the country who can win the final game. You can find the odds for winning from your local bookie [A bookie sets odds, accepts and places bets, and pays out winnings on behalf of other people]. Odds are mathematically treated as a fraction. If the odds for the Morocco vs Argentina game are 5 to 1, the fraction is 1 / 5. So to convert the fraction into probability of winning, take the numerator and divide it by the denominator plus 1. Use the Frac.class in Java to help you convert any given odds into probability. Display your result as a percentage on you console.
There are three financial aid counselors. If a student’s last initial is from A – H, let them know that their counselor is Jon Stewart. If a student’s last initial is from I – Q, let them know that their counselor is Chelsea Handler. If a student’s last initial is from R – Z, let them know that their counselor is Brian Williams.Ask student for the FICO score, if it’s less than 660 tell that this student cannot have a loan.
In R-Studio Problem 2. Find a large set of integers (with at least 10000 observations) representing a sample drawn from real life (i.e., do not generate the numbers using some random number generator). First, explain what the integers correspond to in real life. Then, investigate the distribution of the integers, and also the first and last digits of the integers in this sample (For example, if the data has [34 65], plot the distribution of these numbers and also distribution of [3,6] and [4 ,5] separately). Does any of these digits follow a uniform distribution? Is this expected? If one of them does not follow a uniform distribution, what distribution does it follow? Can you explain why? [You can analyze the image age dataset provided by IMDB Wiki, which contains the ages of actors and actresses whose photos are present in the IMDB database. The data contains 459868 age values in years, ranging from 1 to 99 years.]
In practical life, the employees get salaries and pay taxes honestly. Sometimes, the process of drawing salariesand payment of taxes may lead to some interesting situation. Suppose, a person draws salary of Rs. 10,000 permonth. A certain percentage of tax is charged on that amount, which is deducted every month. But if the salaryof the person is more than Rs. 10,000 per month, then the tax rate is different. Similarly if a person is getting Rs.20,000 per month, he/she would be charged more under a different tax rate slab. The interesting situationdevelops if there is an anomaly in the tax rates i.e. a person who is getting higher salary takes home lesser moneyas compared to the other person with less gross salary.To further elaborate it, we suppose that there is company 'C' where 100 or less than 100persons are employed. The salaries of the employees and their tax rates are known to us.We are required to list those unlucky persons, who are getting lesser take-home salary(net salary)…
More and more seafood is being farm-raised these days. A model (differentialequation) used for the rate of change for a fish population, P(t) in farmingponds is given by P'(t) = b(1-(P(t)/Pm)) - hP(t) where b is the birth rate, PM is the maximum number of fish the pond cansupport, and h is the rate the fish are harvested. Write a python code that implements the Forward Euler method to solve thedifferential equation Suppose that the carrying capacity PM = 20, 000 fish with a birth rateof 6% and a harvesting rate of h = 0%, use your Python code to findand plot the numerical solution for the first 400 days for different valuesof y0. Pick y0 < 20, 000, y0 > 20, 000. Don’t forget to label all your plotswith x and y axes label, titles and legends. Use a time step ∆t = 0.1
Suppose a person can buy a chocolate bar from the vending machine for $1 each. Inside every chocolate bar is a coupon. A person can redeem 3 coupons for one chocolate bar from the machine. This means that once a person has started buying chocolate bars from the machine, he/she always has some coupons. A person would like to know how many chocolate bars can be bought, if a person starts with N dollars and always redeem coupons, if he/she has enough for an additional chocolate bar. For example: With 3 dollars a person could buy 4 chocolate bars after purchasing 3 bars giving him/her 3 coupons and then redeeming the 3 coupons for one bar. This would leave him/her with one extra coupon. Thus, will have 4 chocolate bars and still have one coupon leftover. For 11 dollars, a person can have 16 chocolate bars and still have one coupon leftover. For 12 dollars, a person can have 17 chocolate bars and have two coupons leftover. Write a complete Python program that prompts a buyer to input…
In Python, write a function that produces plots of statistical power versus sample size for simple linear regression. The function should be of the form LinRegPower(N,B,A,sd,nrep), where N is a vector/list of sample sizes, B is the true slope, A is the true intercept, sd is the true standard deviation of the residuals, and nrep is the number of simulation replicates. The function should conduct simulations and then produce a plot of statistical power versus the sample sizes in N for the hypothesis test of whether the slope is different than zero. B and A can be vectors/lists of equal length. In this case, the plot should have separate lines for each pair of A and B values (A[1] with B[1], A[2] with B[2], etc). The function should produce an informative error message if A and B are not the same length. It should also give an informative error message if N only has a single value. Demonstrate your function with some sample plots. Find some cases where power varies from close to zero to…
There are three financial aid counselors. If a student’s last initial is from A – H, let them know that their counselor is Jon Stewart. If a student’s last initial is from I – Q, let them know that their counselor is Chelsea Handler. If a student’s last initial is from R – Z, let them know that their counselor is Brian Williams.Ask student for the FICO score, if it’s less than 660 tell that this student cannot have a loan. c++
In Duolingo, it is the case that whenever the streak - number of days it is used in a row - reaches a number n divisible by 10, one obtains n/10 so called lingots. There is a possiblility to buy streak freezes, each costing 10 lingots. How many days in a row, starting from day zero, one needs to keep up the streak without using a streak freeze in order to gain so many lingots that one can only use streak freezes from that day on?
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies. Design a bottom-up (non-recursive) O(nk)-time algorithm that makes change for any set of k different coin denominations. Write down the pseudocode and analyze its running time. Argue why your choice of the array and the order in which you fill in the values is the correct one. Notice how it is a lot easier to analyze the running time of…
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies. Design a bottom-up (non-recursive) O(nk)-time algorithm that makes change for any set of k different coin denominations. Write down the pseudocode and analyze its running time. Argue why your choice of the array and the order in which you ll in the values is the correct one.
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies. Prove that the coin changing problem exhibits optimal substructure. Design a recursive backtracking (brute-force) algorithm that returns the minimum number of coins needed to make change for n cents for any set of k different coin denominations. Write down the pseudocode and prove that your algorithm is correct.