Answer:
B. GRID COMPUTING , ON - DEMAND COMPUTING AND REAL TIME COMPUTING
Explanation:
Grid computing, on-demand computing and real time computing are currently the most impactful information technology processes. The Grid computing from example entails distributed computing whereby computing resources are distributed across different systems for a computing task. This is seen in server systems where a super virtual computer composed of a network of computers are connected to share resources and perform large tasks. This form of computing has majorly affected and improved complex computing tasks today.
On demand and real time computing are also other notable trends in IT with real time computing bringing the power of live and direct coverage of information to our screens and on demand making it possible for the average user to access computing resources as needed such as in the services of cloud computing providers
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.
Answer:
link the chart, itll immediately update