Test
C192 - Transaction Management Matching
Preguntas del test (5)
1What transaction problem is depicted ?
- AThe lost update problem.
- BThe uncommitted dependency (or dirty read) problem.
- CThe inconsistent analysis problem.
- DConflict serializability
2What type of transaction is depicted ?
- AThe lost update problem.
- BThe uncommitted dependency (or dirty read) problem
- CThe inconsistent analysis problem
- DNonserial schedule
3What type of transaction is depicted ?
- AThe lost update problem.
- BThe uncommitted dependency (or dirty read) problem
- CThe inconsistent analysis problem.
- DThe transaction will execute without error.
4Which is a schedule where the operations from a set of concurrent transactions are interleaved.
- ASerial Schedule
- BNonserial Schedule
- CA Locking Transaction
- DAn Exclusive Lock
5Which is a schedule where the operations of each transaction are executed consecutively without any interleaved operations from other transactions.
- ANonserial Schedule
- BSerial Schedule
- CA Locking Transaction
- DAn Exclusive Lock
Información
- Descripción
- Computer Science
- Autor
- Craig Willey
- Idioma
- English
- Visitas
- 12
- Etiquetas
- Valoración
- Aún sin valoraciones Valora este test