Answer:
it will be on the bottom right of a answer :)
Explanation:
Answer:
Answer is B, see explanations.
Explanation:
Answer is (B) NP−complete∩P=ϕ
Since, P≠NP, there is at least one problem in NP, which is harder than all P problems. Lets take the hardest such problem, say X. Since, P≠NP,X∉P .
Now, by definition, NP−complete problems are the hardest problems in NP and so X problem is in NP−complete. And being in NP, X can be reduced to all problems in NP−complete, making any other NP−complete problem as hard as X. So, since X∉P, none of the other NP−complete problems also cannot be in P.
Check out this link.
https://sites.google.com/site/computerinternethelp/types-of-computer-notes
Answer:
7. There are different tools needed in repairing computer, which of the following categories does parts retriever, screw driver, wire cutter and long nose plier belongs?
D. Hand tools
8. Which of the following hand tools also known as nut driver?
B. hex driver
9. Which of the following tools does NOT belong to cleaning tools?
A. anti-static wrist strap
10. When cleaning computer system unit, which of the following tools is best used to blow
away dust in electronic components?
A. compressed air
Explanation:
Explanation:
For your kind information the answer of the question is MARK I.
