Home / Engineering / Theory of Computation / Question
M
Q.) Let S be an NP-complete problem, Q and R be two other problems not known to be in NP. Q is polynomial-time reducible to S and S is polynomial-time reducible to R. Which one of the following statements is true?
Related MCQs on Theory of Computation
Q. Which protocol gives a full route table update every 30 seconds?
Q. Which of the following is not a main phase in Configuration Management (CM) Process?
Q. The 16 bit register is separated into groups of 4 bit where each groups is called:
Q. Following IC chip integrates 100 thousands electronic components per chip
Q. The type of control signal is generated based on
Q. With an IP address of 201.142.23.12, what is your default subnetmask?
Discusssion
Login to discuss.