A schedule is said to be non-conflict serializable if it has one or more of the following.
A. Blind writes
B. Blind reads
C. Conflicting instructions
D. Non-conflicting instructions
Answer:A
A schedule is said to be non-conflict serializable if it has one or more of the following.
A. Blind writes B. Blind reads C. Conflicting instructions D. Non-conflicting instructions