Closed. This question is not about programming or software development. It is not currently accepting answers.
This question does not appear to be about a specific programming problem, a software algorithm, or software tools primarily used by programmers. If you believe the question would be on-topic on another Stack Exchange site, you can leave a comment to explain where the question may be able to be answered.
Closed 6 days ago.
Improve this question
I'm new to solving big -O and analysis questions and I'm slightly confused on this problem. excuse me if my math is wrong but f(n) <= Cg(n) in this case n(2^n) = f(n) and 2^2n = g(n)
boiling it down I get n/2^n <= C after working it out.
im lost on how to find n0 and C, I assume n0 is 1 as it is usually the case, but im uncertain of C, i assume its 2 but im not sure how to show so.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Closed 9 years ago.
Questions asking for code must demonstrate a minimal understanding of the problem being solved. Include attempted solutions, why they didn't work, and the expected results. See also: Stack Overflow question checklist
This question does not appear to be about a specific programming problem, a software algorithm, or software tools primarily used by programmers. If you believe the question would be on-topic on another Stack Exchange site, you can leave a comment to explain where the question may be able to be answered.
Improve this question
I have this function with R.
immediate.amput.EV <- function(Dead.prob=.010,Dead.cost=40000,Alive.prob=.0990,Alive.cost=50000,high=100,p.payoff=1) {
return((Dead.prob * Dead.cost) + (Alive.prob * Alive.cost))
}
immediate.amput.EV()
It's supposed to output : (0.010 * 40000) + (0.990 * 50000) = 400 + 49500 = 49900
Instead it gives me: 5350
Could you please tell me why?
Thanks..
As Brian Hannays says: Change the definition of Alive.prob to 1-Dead.prob. A good programming habit is to try to avoid redundant (and then possibly conflicting) definitions...
function(Dead.prob=.010,Dead.cost=40000,Alive.prob=1-Dead.prob,Alive.cost=50000,high=100,p.payoff=1) {
return((Dead.prob * Dead.cost) + (Alive.prob * Alive.cost))
}
your math is wrong. In your comments, you added an extra 0
400 + 4950 NOT 49500
.01 *40000 =400 and .099*50000= 4950 and 400+4950 =5350
accept the answer or delete your question.
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 10 years ago.
Improve this question
I am learning binary division following the step-by-step procedure. I am stuck at Step One Repeat One in the remainder section. To get the remainder, the formula is Remainder = Remainder - Divisor.
How do we get to remainder: 11100110? I just don't understand how we have 1110 on the left half of the register. Any guides or help would greatly be appreciated!
Thanks:
The example is 10/5 using an 8 bit ALU.
I have attached a picture of the example for reference
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 12 years ago.
Improve this question
I know it's not programming question but I thought we could all use the challenge :)
Link to diagram
Point A is the source of a laser. It is shinned at a single mirror and then reflected to another mirror finally arriving at point B ... see picture.
The goal is to find the total distance of all the lines.
I am not a student and this is not homework.
Same as a straight line from (-x, y) to (a, -b).
sqrt((a+x)^2 + (b+y)^2)
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 12 years ago.
Improve this question
US coin values:
.01, .05, .10, .25
What is an algorithm to determine what configuration(s) of US coins can be used to match every value from .01-.99 using the fewest coins possible?