Question 1

A lock guarantees the open use of a data item to multiple transactions.

Accepted Answer

A) True 
 B)False

Question 2

Although the DBMS is designed to recover a database to a previous consistent state when an interruption prevents the completion of a required set of transactions, the transactions themselves are defined by the end user or programmer and must be semantically correct.

Accepted Answer

A) True 
 B)False

Question 3

A consistent database state is .

Accepted Answer

A)  one in which all tables have foreign keys 
B)  one in which all data integrity constraints are satisfied 
C)  one in which all tables are normalized 
D)  one in which all SQL statements only update one table at a time 
A)  one in which all tables have foreign keys 
B)  one in which all data integrity constraints are satisfied 
C)  one in which all tables are normalized 
D)  one in which all SQL statements only update one table at a time

Question 4

As long as two transactions, T1 and T2, access data, there is no conflict, and the order of execution is irrelevant to the final outcome.

Accepted Answer

A)  shared 
B)  common 
C)  unrelated 
D)  locked 
A)  shared 
B)  common 
C)  unrelated 
D)  locked

Question 5

If a(n) is issued before the termination of a transaction, the DBMS will restore the database only for that particular transaction, rather than for all transactions, in order to maintain the durability of the previous transactions.

Accepted Answer

The answer of If a(n) is issued before the termination...

A lock guarantees the open use of a data item to multiple transactions.

Although the DBMS is designed to recover a database to a previous consistent state when an interruption prevents the completion of a required set of transactions, the transactions themselves are defined by the end user or programmer and must be semantically correct.

A consistent database state is .

As long as two transactions, T1 and T2, access data, there is no conflict, and the order of execution is irrelevant to the final outcome.

If a(n) is issued before the termination of a transaction, the DBMS will restore the database only for that particular transaction, rather than for all transactions, in order to maintain the durability of the previous transactions.

Database Systems

Data Models

The Relational Database Model

Entity Relationship Er Modeling

Advanced Data Modeling

Normalization of Database Tables

Introduction to Structured Query Language Sql

Advanced Sql

Database Design

Database Performance Tuning and Query Optimization

Distributed Database Management Systems

Business Intelligence and Data Warehouses

Database Connectivity and Web Technologies

Database Administration and Security

Filters

Exam 10: Transaction Management and Concurrency Control

A lock guarantees the open use of a data item to multiple transactions.

Although the DBMS is designed to recover a database to a previous consistent state when an interruption prevents the completion of a required set of transactions, the transactions themselves are defined by the end user or programmer and must be semantically correct.

A consistent database state is .

As long as two transactions, T1 and T2, access data, there is no conflict, and the order of execution is irrelevant to the final outcome.

If a(n) is issued before the termination of a transaction, the DBMS will restore the database only for that particular transaction, rather than for all transactions, in order to maintain the durability of the previous transactions.

Database Systems

Data Models

The Relational Database Model

Entity Relationship Er Modeling

Advanced Data Modeling

Normalization of Database Tables

Introduction to Structured Query Language Sql

Advanced Sql

Database Design

Database Performance Tuning and Query Optimization

Distributed Database Management Systems

Business Intelligence and Data Warehouses

Database Connectivity and Web Technologies

Database Administration and Security

Filters