- 07/13/2019 at 9:45 pm #1440473EduGorillaKeymasterSelect 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 EnquiryAre You looking institutes / coaching center for
- IIT-JEE, NEET, CAT
- Bank PO, SSC, Railways
- Study Abroad