Free Mock Test : DBMS (Database Management System) : Transaction (Test 1)

Home

Technology

Blog

Free Mock Test - DBMS (Database Management System) : Transaction (Test 1)

In the evolving landscape of computer science education and recruitment, Database Management System (DBMS) topics—especially transactions—are becoming increasingly crucial for students preparing for technical and competitive examinations such as GATE, UGC NET, SSC, Banking IT Officer, and campus placements. A transaction in DBMS is defined as a sequence of operations performed as a single logical unit of work. These operations must either be completed fully or not executed at all, ensuring data consistency and integrity in a database system. As organizations rely heavily on data-driven systems, understanding transaction processing has become a fundamental requirement for aspiring engineers and IT professionals.

Total Questions : 20

Timer : sec

Question : Which of the following best describes a transaction in DBMS?

A single SQL query executed on a database

A set of logically related operations executed as a unit

A backup operation of database

A data structure used to store records

Question : Consider the operations: R(X), X = X – 500, W(X). If failure occurs after step 2, what ensures database correctness?

Write operation

Buffer memory

Rollback

Commit

Question : Which state occurs after successful execution but before permanent storage of results?

Active state

Failed state

Partially committed state

Aborted state

Question : Which ACID property ensures that concurrent transactions do not interfere with each other?

Atomicity

Consistency

Isolation

Durability

Question : What is the correct sequence of basic transaction operations?

Write → Read → Commit

Read → Write → Commit

Commit → Read → Write

Read → Commit → Write

Question : Which component is mainly responsible for ensuring Durability?

Query optimizer

Concurrency control subsystem

Recovery manager/log system

Buffer manager

Question : Which statement best describes Consistency in DBMS transactions?

Transactions execute independently

Database must satisfy integrity constraints before and after execution

Data is permanently stored after commit

Transactions cannot run concurrently

Question : A transaction transfers ₹100 from Account A to B. After debit from A, system crashes before credit to B. Which property ensures recovery?

Consistency

Isolation

Durability

Atomicity

Question : Which ACID property ensures that uncommitted changes are not visible to other transactions?

Atomicity

Consistency

Isolation

Durability

Question : Which of the following situations violates Atomicity in a DBMS transaction?

Two transactions execute concurrently without affecting each other

A transaction partially completes due to system failure

Database moves from one consistent state to another

Changes are permanently stored after commit

Question : After a transaction is aborted, what are the possible next actions by the system?

Only restart the transaction

Only terminate the transaction

Restart or kill the transaction

Commit the transaction

Question : What is the primary purpose of the aborted state in a transaction?

To permanently store data

To restart execution without rollback

To restore database consistency by undoing changes

To mark successful completion

Question : Which of the following transitions is NOT possible in DBMS transaction states?

Active → Failed

Partially Committed → Failed

Failed → Committed

Failed → Aborted

Question : A transaction has completed all operations but changes are not yet permanently saved. In which state is it?

Active

Failed

Partially Committed

Aborted

Question : Which of the following sequences correctly represents the normal lifecycle of a transaction in DBMS?

Active → Committed → Partially Committed → Terminated

Active → Partially Committed → Committed → Terminated

Active → Failed → Partially Committed → Committed

Active → Aborted → Committed → Terminated

Question : Two schedules are view equivalent if they satisfy which condition?

Same number of read operations

Same order of all operations

Same initial reads, final writes, and update reads

Same number of transactions only

Question : Which of the following is NOT a type of serializability?

Conflict serializability

View serializability

Result serializability

Strict serializability

Question : In a precedence (serialization) graph, a schedule is conflict serializable iff:

Graph has at least one cycle

Graph is disconnected

Graph has no cycles

Graph has equal nodes and edges

Question : A schedule is said to be serializable if:

Transactions are executed concurrently

It produces the same result as some serial schedule

All transactions are read-only

There are no write operations

Question : Which of the following conditions is necessary for conflict serializability?

Operations must belong to the same transaction

Transactions must not access the same data item

Conflicting operations must preserve order

There must be no read operations

About us

Term & conditions

Privacy & Policy

Free Mock Test - DBMS (Database Management System) : Transaction (Test 1)

Cookies & Disclaimer