Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

PBL

Total questions: 20

Worksheet time: 10mins

Name
Class
Date
1.

A system is in a ______ state if there exists a set of transactions such that every transaction in the set is waiting for another transaction in the set.

a)

A. Idle

b)

B. Waiting

c)

C. Deadlock

d)

D. Ready

2.

The deadlock state can be changed back to stable state by using _____________ statement.

a)

A. Commit

b)

B. Rollback

c)

C. Savepoint

d)

D. Deadlock

3.

What are the ways of dealing with deadlock?

a)

A. Deadlock prevention

b)

B. Deadlock recovery

c)

C. Deadlock detection

d)

D. All of the mentioned

4.

When a transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp smaller than that of Tj (that is, Ti is older than Tj). Otherwise, Ti is rolled back (dies). This is

a)

A. Wait-die

b)

B. Wait-wound

c)

C. Wound-wait

d)

D. Wait

5.

When a transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is rolled back (Tj is wounded by Ti ). This is

a)

A. Wait-die

b)

B. Wait-wound

c)

C. Wound-wait

d)

D. Wait

6.

The deadlock in a set of the transaction can be determined by

a)

A. Read-only graph

b)

B. Wait graph

c)

C. Wait-for graph

d)

D. All of the mentioned

7.

A deadlock exists in the system if and only if the wait-for graph contains a ___________

a)

A. Cycle

b)

B. Direction

c)

C. Bi-direction

d)

D. Rotation

8.

Selecting the victim to be rollbacked to the previous state is determined by the minimum cost. The factors determining cost of rollback is:

a)

A. How long the transaction has computed, and how much longer the transaction will compute before it completes its designated task.

b)

B. How many more data items the transaction needs for it to complete.

c)

C. How many transactions will be involved in the rollback.

d)

D. All of the mentioned

9.

__________ rollback requires the system to maintain additional information about the state of all the running transactions.

a)

A. Total

b)

B. Partial

c)

C. Time

d)

D. Commit

10.

Which of the following is not a recovery technique?

a)

A. Deferred update

b)

B. Immediate update

c)

C. Two-phase commit

d)

D. Recovery management

11.

Checkpoints are a part of

a)

A. Recovery measures

b)

B. Security measures

c)

C. Concurrency measures

d)

D. Authorization measures

12.

....... deals with soft errors, such as power failures

a)

A. system recovery

b)

B. media recovery

c)

C. database recovery

d)

D. failure recovery

13.

Rollback of transactions is normally used to:

a)

A. recover from transaction failure

b)

B. update the transaction

c)

C. retrieve old records

d)

D. repeat a transaction

14.

A transaction performs on the isolation level of the Read Uncommitted if:

a)

A. A dirty read occurs

b)

B. Non-repeatable read occurs

c)

C. Phantom reads occurs

d)

D. All of the above

15.

Which commands are used to control which users have which privilege over which objects?

a)

A. QUE and QUIST

b)

B. GRANT and REVOKE

c)

C. CASECADE and MVD

d)

D. None of the above

16.

When a deadlock is detected the recovery is normally accomplished by:

a)

A. rollback of the transaction

b)

B. locking of data

c)

C. consistency checking

d)

D. none of these

17.

Which is not a desirable property of a transaction?

a)

A. Isolation

b)

B. Atomicity

c)

C. Durability

d)

D. All are desirable

18.

A directed graph that represents the deadlock is called:

a)

A. cycle graph

b)

B. deadlock graph

c)

C. wait-for graph

d)

D. none of the above

19.

Transaction Throughput is:

a)

A. Elapsed Time between submitting a transaction and receiving a transaction.

b)

B. Average no. of transaction processed per second.

c)

C. No. of resources used by a transaction.

d)

D. None of the above.

20.

The most widely used structure for recording database modification is called as _______

a)

A. Log

b)

B. List

c)

C. Queue

d)

D. Stack