The technical terms for the statement "The repeatedly working capacity of computer" is known to be "diligence.
<h3>Why is the working capacity of computer" known to be "diligence."?</h3>
The capacity of a computer is known to be one that carry out or performs a lot of task in a repetitive manner without getting tired and as such, one can say the computer is diligent.
Note therefore that The technical terms for the statement "The repeatedly working capacity of computer" is known to be "diligence.
Learn more about computer from
brainly.com/question/24540334
#SPJ1
Go on your school computer, and find a copy of the form. Then print it from the school printer.
Answer:
B. R is NP Hard
Explanation:
Given:
S is an NP complete problem
Q is not known to be in NP
R is not known to be in NP
Q is polynomial times reducible to S
S is polynomial times reducible to R
Solution:
NP complete problem has to be in both NP and NP-hard. A problem is NP hard if all problems in NP are polynomial time reducible to it.
Option B is correct because as given in the question S is an NP complete problem and S is polynomial times reducible to R.
Option A is not correct because R is not known to be in NP
Option C is not correct because Q is also not known to be in NP
Option D is not correct because Q because no NP-complete problem is polynomial time reducible to Q.
I’m not doing too hot
Stressing over school and I doesn’t help that I don’t understand somethings
