D$.DB$ relationship

A scheme for processing concurrent transactions in which all transactions' result must be

logically consistent with the result that would have been achieved had the transactions been

processed in an arbitrary serial fashion is called?

A$)$ Transaction

B$)$ Serializable

C$)$ Non$-$serializable

D$)$ Non$-$transaction

A condition where two transactions may indefinitely wait on each another to release

resources is called?

A$)$ Junction

B$)$ Locking

C$)$ Deadlock

D$)$ Termination

locks are issued automatically by the DBMS based on an activity

A$)$ Implicit

B$)$ Explicit

C$)$ Induced

D$)$ Opposed

Section C: Write the meaning of the following Abbreviations $(10$pts$)$

$($i$)$ DBMS

$($ii$)$ DBA

$($iii$)DBMS$

$($iv$)$ ACID

Section D

Explain the difference between Rollforward and Rollback stating the IMAGES they applied

to achieve them. $(5$pts$)$