Gate Exam

Assuming P â‰ NP, which of the following is TRUE?

Option
(A) NP-complete = NP
(B) NP-complete © P = null
(C) NP-hard = NP
(D) P = NP-complete

Read Solution (Total 0)

Gate Other Question

Which of the following is TRUE?

Option
(A) Every relation in 3NF is also in BCNF
(B) A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R
(C) Every relation in BCNF is also in 3NF
(D) No relation can be in both BCNF and 3NF The decimal value 0.5 in IEEE single precision floating point representation has
(A) fraction bits of 000…000 and exponent value of 0
(B) fraction bits of 000…000 and exponent value of −1
(C) fraction bits of 100…000 and exponent value of 0
(D) no exact representation