3-SAT ≤p TSP
If P ¹ NP, then no NP-complete problem can be solved in polynomial time.
both the statements are true.
<u>Explanation:</u>
- 3-SAT ≤p TSP due to any complete problem of NP to other problem by exits of reductions.
- If P ¹ NP, then 3-SAT ≤p 2-SAT are the polynomial time algorithm are not for 3-SAT. In P, 2-SAT is found, 3- SAT polynomial time algorithm implies the exit of reductions. 3 SAT does not have polynomial time algorithm when P≠NP.
- If P ¹ NP, then no NP-complete problem can be solved in polynomial time. because for the NP complete problem individually gets the polynomial time algorithm for the others. It may be in P for all the problems, the implication of latter is P≠NP.
Answer: A maximum of 1 hour
Explanation:
Read your lesson buddy!!
Answer:
Q=36444.11 Btu
Explanation:
Given that
Initial temperature = 60° F
Final temperature = 110° F
Specific heat of water = 0.999 Btu/lbm.R
Volume of water = 90 gallon
Mass = Volume x density
Mass ,m= 90 x 0.13 x 62.36 lbm
m=729.62 lbm
We know that sensible heat given as
Q= m Cp ΔT
Now by putting the values
Q= 729.62 x 0.999 x (110-60) Btu
Q=36444.11 Btu
