A) transaction
B) database
C) lock
D) schedule
Correct Answer
verified
Multiple Choice
A) older transaction rolls back the younger transaction and reschedules it.
B) younger, preempted transaction is rescheduled using the same time stamp.
C) older transaction waits for the younger one to complete and release its locks.
D) younger and older transactions both wait indefinitely to be released.
Correct Answer
verified
Short Answer
Correct Answer
verified
True/False
Correct Answer
verified
Short Answer
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) Inconsistent retrieval
B) The phenomena of uncommitted data
C) Lost update problems
D) Dirty read problems
Correct Answer
verified
Multiple Choice
A) Two transactions cannot have conflicting lock.
B) No unlock operation can precede a lock operation in a different transaction.
C) No data is affected until all locks are released.
D) No data is affected until the transaction is in its locked position.
Correct Answer
verified
Short Answer
Correct Answer
verified
View Answer
True/False
Correct Answer
verified
Multiple Choice
A) time
B) practical
C) logical
D) physical
Correct Answer
verified
Multiple Choice
A) Five SQL statements are executed.
B) The end of a program is successfully reached.
C) All changes are aborted and returned to a previous consistent state.
D) The database is shut down for maintenance.
Correct Answer
verified
True/False
Correct Answer
verified
Short Answer
Correct Answer
verified
Multiple Choice
A) Locks
B) Schedules
C) Stamps
D) Logs
Correct Answer
verified
Multiple Choice
A) shared
B) exclusive
C) binary
D) two-phase
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) granularity
B) shrinking
C) growing
D) serializability
Correct Answer
verified
Multiple Choice
A) scheduled
B) table-locking
C) unique
D) time stamping
Correct Answer
verified
Essay
Correct Answer
verified
View Answer
Showing 21 - 40 of 74
Related Exams