C192 - Transaction Management Matching

Description

Computer Science
Craig Willey
Quiz by Craig Willey, updated more than 1 year ago
Craig Willey
Created by Craig Willey about 4 years ago
4
0

Resource summary

Question 1

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

Question 2

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

Question 3

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

Question 4

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

Question 5

Question
Which is a schedule where the operations of each transaction are executed consecutively without any interleaved operations from other transactions.
Answer
  • Nonserial Schedule
  • Serial Schedule
  • A Locking Transaction
  • An Exclusive Lock
Show full summary Hide full summary

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