New Enroll in RBI Gr B 2025 Exclusive New Batch on March 18

    Question

    Which of the following statements is true regarding the

    class NP?
    A Problems in NP can be solved in polynomial time on deterministic Turing machines. Correct Answer Incorrect Answer
    B Problems in NP are typically harder to solve than problems in P. Correct Answer Incorrect Answer
    C Problems in NP can be verified in polynomial time on non-deterministic Turing machines. Correct Answer Incorrect Answer
    D Problems in NP can be solved using brute-force algorithms. Correct Answer Incorrect Answer
    E None of these Correct Answer Incorrect Answer

    Solution

    Problems in NP can be verified in polynomial time on non-deterministic Turing machines.

    Practice Next

    Relevant for Exams: