Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Transactions 2: Serializability

Total questions: 15

Worksheet time: 9mins

Name
Class
Date
1.

A (possibly concurrent) schedule is serializable if it is ....

a)

executed in a real time manner

b)

always gives the same result

c)

executed serially

d)

equivalent to a serial schedule

2.

We can identify a serializable schedule by checking the following notions ...

a)

Conflict serializability

b)

View serializability

c)

Recoverable serializability

d)

Concurrent serializability

3.

The following instructions are conflicts if executed consecutively, except..

a)

li = read(Q), lj = read(Q)

b)

li = read(Q), lj = write(Q)

c)

li = write(Q), lj = read(Q)

d)

li = write(Q), lj = write(Q)

4.

If a schedule S can be transformed into a schedule S’ by a series of swaps of non-conflicting instructions, we say that S and S’ are ..

a)

conflict serializable

b)

conflict equivalent

c)

conflict serializability

d)

conflict

5.

A schedule S that conflict equivalent to a serial schedule is called ..

a)

conflict serializable

b)

conflict equivalent

c)

conflict serializability

d)

conflict

6.

Examine the following schedules.

Schedule 3 is conflict serializable.

a)

True

b)

False

7.

Examine the following schedule.

The schedule is not conflict serializable.

a)

True

b)

False

8.

Let S and S’ be two schedules with the same set of transactions. S and S’ are view equivalent if the following three conditions are met, for each data item Q,

a)

The transaction (if any) that performs the final write(Q) operation in schedule S must also perform the final write(Q) operation in schedule S’.

b)

If in schedule S, transaction Ti reads the initial value of Q, then in schedule S’ also transaction Ti must read the initial value of Q

c)

If in schedule S transaction Ti executes read(Q), and that value was produced by transaction Tj (if any), then in schedule S’ also transaction Ti must read the value of Q that was produced by the same write(Q) operation of transaction Tj .

d)

If in schedule S, transaction Ti write the initial value of Q, then in schedule S’ also transaction Ti must write the initial value of Q

9.

Every view serializable schedule is also conflict serializable

a)

True

b)

False

10.

The following schedule is not a recoverable schedule.

a)

True

b)

False

11.

A single transaction failure leads to a series of transaction rollbacks. The incident is called ...

a)

Concurrent Rollback

b)

Serial Rollback

c)

Cascading Rollback

d)

Parallel Rollback

12.

Every cascade-less schedule is not recoverable.

a)

True

b)

False

13.

The weakest level of consistency is ...

a)

Serializable

b)

Read Committed

c)

Read Uncommitted

d)

Repeatable Read

14.

The strongest level of consistency is ...

a)

Serializable

b)

Read Committed

c)

Read Uncommitted

d)

Repeatable Read

15.

The following schedule is view serializable.

a)

True

b)

False