This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 1 year, 11 months ago.

  • Author
    Posts
  • #1440473 Reply
     EduGorilla 
    Keymaster
    Select Question Language :


    How many of the below statements are True ?

    1) Checking Conflict Serializability is a polynomial time problem.

    2) Checking View Serializability is a NP-Complete Problem.

    3) Every conflict serializable schedule is also view serializable but reverse is not true.

    4) View Serializability is necessary but not sufficient condition for Serializability.

    5) Conflict Serializability is necessary and sufficient condition for Serializability.

    Options :-

      Post your Training /Course Enquiry
      Are You looking institutes / coaching center for
      • IIT-JEE, NEET, CAT
      • Bank PO, SSC, Railways
      • Study Abroad
      Select your Training / Study category
    Reply To: How many of the below statements are True ? 1) Checking Conflict Serializability is a polynomial tim….
    Your information:




    Verify Yourself




    Log in with your credentials

    or    

    Forgot your details?

    Create Account