C192 - Transaction Management Matching

Descripción

Computer Science
Craig Willey
Test por Craig Willey, actualizado hace más de 1 año
Craig Willey
Creado por Craig Willey hace alrededor de 4 años
4
0

Resumen del Recurso

Pregunta 1

Pregunta
What transaction problem is depicted ?
Respuesta
  • The lost update problem.
  • The uncommitted dependency (or dirty read) problem.
  • The inconsistent analysis problem.
  • Conflict serializability

Pregunta 2

Pregunta
What type of transaction is depicted ?
Respuesta
  • The lost update problem.
  • The uncommitted dependency (or dirty read) problem
  • The inconsistent analysis problem
  • Nonserial schedule

Pregunta 3

Pregunta
What type of transaction is depicted ?
Respuesta
  • The lost update problem.
  • The uncommitted dependency (or dirty read) problem
  • The inconsistent analysis problem.
  • The transaction will execute without error.

Pregunta 4

Pregunta
Which is a schedule where the operations from a set of concurrent transactions are interleaved.
Respuesta
  • Serial Schedule
  • Nonserial Schedule
  • A Locking Transaction
  • An Exclusive Lock

Pregunta 5

Pregunta
Which is a schedule where the operations of each transaction are executed consecutively without any interleaved operations from other transactions.
Respuesta
  • Nonserial Schedule
  • Serial Schedule
  • A Locking Transaction
  • An Exclusive Lock
Mostrar resumen completo Ocultar resumen completo

Similar

Computing Hardware - CPU and Memory
ollietablet123
SFDC App Builder 2
Parker Webb-Mitchell
Data Types
Jacob Sedore
Intake7 BIM L1
Stanley Chia
Software Processes
Nurul Aiman Abdu
Design Patterns
Erica Solum
CCNA Answers – CCNA Exam
Abdul Demir
Abstraction
Shannon Anderson-Rush
Spyware
Sam2
HTTPS explained with Carrier Pigeons
Shannon Anderson-Rush
Data Analytics
anelvr