Computer Science · Transaction Processing
Consider the following statements regarding the classification and properties of database schedules: A. Serial schedules require that all operations of one transaction complete before the next begins, guaranteeing consistency but resulting in poor performance. B. Serializable schedules are concurrent schedules that are equivalent to some serial schedule, serving as the benchmark for both correctness and efficiency. C. All Non-Serial (Concurrent) schedules cannot be reproduced by any serial execution and inherently produce inconsistent data. D. Non-Serializable schedules cannot be reproduced by any serial execution and must be prevented as they may produce inconsistent data. Choose the correct statements from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A, B, and C only
- 2B, C, and D only
- 3A, C, and D only
- 4A, B, and D only✓
Correct answer
A, B, and 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!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Transaction Processing MCQs →Want more practice questions on Transaction Processing?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Transaction Processing