Computer Science · Database Management Systems
Consider the following statements regarding schedules in Database Management Systems: A. A non-serial schedule is said to be conflict serializable, if it is conflict-equivalent to some serial schedule. B. A non-serial schedule is said to be view serializable if it is view-equivalent to some serial schedule. C. A schedule is said to be serial, if instructions of participating transactions are chronologically interleaved with each other. D. A conflict-serializable schedule will be view-serializable also but vice-versa may not be true. Choose the correct answer from the options given below:
- 1B, C, D Only
- 2A, B, D Only✓
- 3A, B, C Only
- 4A, B, C, D
Correct answer
A, B, D Only
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Database Management Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Management Systems