Homework #1 Finding the Optimal State-Value Function Problem Description The game DieN is played in the following way: 1. You will be given a die with N sides. You will know the size of N, and can assume that N is a value greater than 1 and less than or equal to 30. 2. You will be given a bit mask vector isBadSide representing the sides of a die that will make you lose. The vector will be of size N, and 1 indexed. (there is no 0 side) 3. You start with 0 dollars. 4. At any time you have the option to roll the die or to quit the game a. If you decide to roll: i. And you roll a number not in isBadSide, you receive that many dollars. (eg. if you roll the number 2 and 2 is not active — meaning the second element of the vector is 0 — in isBadSide, then you receive 2 dollars) Repeat step 4. ii. And you roll a number in isBadSide, then you lose all money obtained in previous rolls and the game ends. b. If you decide to quit: i. You keep all money gained from previous rolls and the game ends. Procedure ● For this problem, determine an optimal policy for playing the game DieN for N sides. You will be given N and the array isBadSide which indicates which sides are bad. As you will see, the optimal policy for this game will depend on your current bankroll. ● You can try solving this problem either by creating an MDP of the game (state, action, transition, reward function, and assume a gamma of 1) and then calculating the optimal state-value function or you can plug-in values and solve directly using the Bellman Equations. ● What is the expected amount of dollars for this game if you follow an optimal policy? That is, what is the optimal state-value function for the initial state of the game? Provide answers for the problems you are given in the “Solve for Code” tab on the Heroku site. Your answer must be correct to 3 decimal places. Examples The following examples can be used to verify your calculation is correct. ● Input: N = 21, isBadSide = {1,1,1,1,0,0,0,0,1,0,1,0,1,1,0,1,0,0,0,1,0}, Output: 7.3799 ● Input: N = 22, isBadSide = {1,1,1,1,1,1,0,1,0,1,1,0,1,0,1,0,0,1,0,0,1,0}, Output: 6.314 ● Input: N = 6, isBadSide = {1,1,1,0,0,0}, Output: 2.5833
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Homework Week 2 Chapter 19 Problem 1 California Surplus Inc Qualifies To Use
/in Uncategorized /by developerQ1)California Surplus Inc. qualifies to use the installment-sales method for tax purposes and sold an investment on an installment basis. The total gain of $75000 was reported for financial reporting purposes in the period of sale. The installment period is 3 years; one-third of the sale price is collected in 2012 and the rest in 2013. The tax rate was 35% in 2012, and 30% in 2013 and 30% in 2014. The accounting and tax data is shown below.
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Homework 1 Cs512 Data Structures Deadline You Will Submit Your Completed Homewor
/in Uncategorized /by developerHOMEWORK 1
CS512 Data Structures
Deadline: This assignment is due by the next class on Friday, June 2, 2017. You will submit your completed homework via EMS.
Find the Big-O complexity of the following growth functions? (5 points)
6.4n2 + 0.98n + 0.2
83t1/4 + 71/4 +9t3/4
10n3 + 78
n2log n
y4 + y6 –
Find the dominant term in the following growth functions. (5 points)
7t8(1+t2)
log m + m log m
6n + 5n-1
71n4 + 75n2 + 7
1 + n4
Find the order of complexity for each of these expressions.
x3 + x 2 − 3x + 2
44log n + 6
3n + n3
998
y2 + y + 11.2
Arrange the growth functions above in the decreasing order of their time complexity (5 points)
How many terms are in the following growth function: T(x) = 3×5 + 6×2 + x
Use a calculator and the tabular method to determine the dominant term of the function.
What is the Big-O complexity of the function?
(5 points)
Explain the following aspects of good software quality:
Efficiency
Portability (5 points)
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Homework 1 Due Thursday January 17 1 Circles C And D Meet At Points A And B The
/in Uncategorized /by developerHomework #1 due Thursday January 17 1. Circles C and D meet at points A and B. The tangent to C at A meets D at a point P. Define Q to be any point of D inside C, and let S be the point where line BQ meets C. Prove that AS is parallel to PQ. For any diameter AA” of circle C = (O, r), let C1 = (O1, a) and C2 = (O2, a) be congruent circles, with a < r, that are internally tangent to C at A and A”, respectively. On the same side of AA” inside C we draw two more circles (O3, b) and (O4, c) externally tangent to one another and internally tangent to C, with the first circle tangent externally to C1 and the second to C2. Prove that (i) r = a + b + c, and (ii) O3O4 || AA”.
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Homework 1 Econ 111a American Economic History Due Wednesday October 26 2016 Que
/in Uncategorized /by developerHomework 1:
Econ 111a American Economic History
Due Wednesday October 26, 2016
Question 1: The American colonies regularly faced a trade deficit in the eighteenth century, but it faced a small balance of payments deficit. Use the following table on the Balance of Payments for the 13 Colonies from 1768-1772 to discuss why this was the case.
Question 2: Greater Productivity is one of the key reasons that income per capita grows over time. Some argue that technological change is the main cause of productivity growth. Discuss whether the productivity growth of shipping in the American colonies supports this view or whether it is a counter-example.
Question 3: Based on the two charts below, does life expectancy appear to be a reasonable proxy for per capita income? Explain. Note: France and United Kingdom are part of Western Europe. In 1700, India had a higher per capita income than the USA. By 2003, incomes in the USA were ten time higher than those in India. What two factors would Douglas North argue explain the difference in Indian and USA development? Name them and briefly explain their importance.
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Homework 1 Finding The Optimal State Value Function Problem Description The Game
/in Uncategorized /by developerHomework #1 Finding the Optimal State-Value Function Problem Description The game DieN is played in the following way: 1. You will be given a die with N sides. You will know the size of N, and can assume that N is a value greater than 1 and less than or equal to 30. 2. You will be given a bit mask vector isBadSide representing the sides of a die that will make you lose. The vector will be of size N, and 1 indexed. (there is no 0 side) 3. You start with 0 dollars. 4. At any time you have the option to roll the die or to quit the game a. If you decide to roll: i. And you roll a number not in isBadSide, you receive that many dollars. (eg. if you roll the number 2 and 2 is not active — meaning the second element of the vector is 0 — in isBadSide, then you receive 2 dollars) Repeat step 4. ii. And you roll a number in isBadSide, then you lose all money obtained in previous rolls and the game ends. b. If you decide to quit: i. You keep all money gained from previous rolls and the game ends. Procedure ● For this problem, determine an optimal policy for playing the game DieN for N sides. You will be given N and the array isBadSide which indicates which sides are bad. As you will see, the optimal policy for this game will depend on your current bankroll. ● You can try solving this problem either by creating an MDP of the game (state, action, transition, reward function, and assume a gamma of 1) and then calculating the optimal state-value function or you can plug-in values and solve directly using the Bellman Equations. ● What is the expected amount of dollars for this game if you follow an optimal policy? That is, what is the optimal state-value function for the initial state of the game? Provide answers for the problems you are given in the “Solve for Code” tab on the Heroku site. Your answer must be correct to 3 decimal places. Examples The following examples can be used to verify your calculation is correct. ● Input: N = 21, isBadSide = {1,1,1,1,0,0,0,0,1,0,1,0,1,1,0,1,0,0,0,1,0}, Output: 7.3799 ● Input: N = 22, isBadSide = {1,1,1,1,1,1,0,1,0,1,1,0,1,0,1,0,0,1,0,0,1,0}, Output: 6.314 ● Input: N = 6, isBadSide = {1,1,1,0,0,0}, Output: 2.5833
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Homework 1 Machine Dynamics Mech 320 Due 1 Week After The Date Review Of Mechani
/in Uncategorized /by developerP5) an elastic cable, whose stiffness is 5lb/ft and whose unstretched length is 2ft, is fastened to a fixed pin at A and to block B. The block, which weighs 12 oz, is given the initial motion shown. determine the velocity components of the block in the position where the cable becomes slack.
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Homework 2 Cs512 Data Structures Deadline 30 Pm Provide Efficient Solutions Fo
/in Uncategorized /by developerHOMEWORK 2
CS512 – Data Structures
Deadline
4 1 + 3 * 7 1 3 * 4 + –
7 4 + 2 * 8 3 * 4 – +
1.Enter elements into stack till operator is seen.Stack: 4, 1 +Add and push it onto stack:Stack: 5Stack: 5, 3 *Multiply and push it onto stack:Stack: 15Stack: 15, 7, 1, 3, *Multiply and…
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Homework 2 Csci4350 Summer 2016 Due Date Wed May 25 2016 1 20 Points Consider A
/in Uncategorized /by developer(30 points) Consider an architecture that has four types of instructions: additions, multiplications,memory operations, and branches. The following table gives the number of instructions that belong toeach type in a program, the number of cycles it takes to execute each instruction of that type, and thespeedup in execution of that instruction type from a proposed improvement.
detail are in attacehemnet Q2
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Homework 2 Ec 320 Professor Mastromonaco Fall 2015 Due Week Of October 12th 2015
/in Uncategorized /by developerSuppose that a random sample of 200 twenty-year-old men is selected from a population and these men’s height (in inches), Hi , and weight (in pounds), Wi , are recorded. OLS estimation of a simple linear regression model relating weight to height yields the fitted regression model:
Wi = 25 + 1.75Hi
a) What is the regression’s weight prediction for someone who is 60inches tall?
b) A man has alate growth spurt and grows 2inches over the course of a year. What is the regression’s prediction for the increase in this man’s weight?
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Homework 249
/in Uncategorized /by developerHi
This is for BA 3010 Data Anlyasis
Questions
1 to 10 all
11 – 19 Odds
21 to 26 all
Can you send me the answer of those questions on the Word program, please?
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"