0
Still curious? Ask our experts.
Chat with our AI personalities
Ezra
Devin
ViviAdd your answer:
Earn +20 pts
Difference between np hard and np complete?
All NP complete problems are NP hard problems when solved in a different way. But, all NP hard problems are not NP complete. Ex: 1. Traveling salesman problem. It is both NP hard and NP complete. We can find that whether the solution is correct or not in the given period of time. In this way, it is NP complete. But, to find the shortest path, i.e. optimization of Traveling Salesman problem is NP hard. If there will be changing costs, then every time when the salesperson returns to the source node, then he will be having different shortest path. In this way, it is hard to solve. It cannot be solved in the polynomial time. In this way, it is NP hard problem. 2. Halting problem. 3. Sum of subset problem.
Is -225.4 a rational number?
Yes
If the original price of a computer was reduced by 250 dollars and the new discounted price is 1499 dollars what was the original price of the computer?
$1749 RP-DA = NP where RP is regular price minus discount amount (DA) is equal to New price (NP) Change the formula to solve for RP you get NP + DA = RP 1,499 + 250 = RP 1,749 = RP The Regular price was one thousand seven hundred and forty nine
What is the mean variance and standard deviation for the number of heads when 20 coins are tossed?
mean = np = 20*0.5 = 10 Variance = npq = 20*0.5*0.5 = 5 Std dev = sqrt(npq) = sqrt(20*0.5*0.5) = 2.23
How can you approximate a binomial distribution to a poison distribution when the number of binomial trials became large enough?
The Poisson distribution with parameter np will be a good approximation for the binomial distribution with parameters n and p when n is large and p is small. For more details See related link below
