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

Home

Technology

Blog

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

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 : Why is view serializability harder to test than conflict serializability?

It requires locking mechanisms

It depends on hardware concurrency

It involves checking multiple equivalence conditions and is computationally complex

It only works for serial schedules

Question : Which of the following is NOT required for checking view serializability?

Initial read consistency

Final write consistency

Precedence graph acyclicity

Read-from relation consistency

Question : A schedule that is not conflict serializable but is view serializable must contain:

Cycles in precedence graph only

Only read operations

Blind writes

No write operations

Question : Which statement is TRUE regarding view serializability?

Every view serializable schedule is conflict serializable

Every conflict serializable schedule is view serializable

View serializability is stricter than conflict serializability

View serializability ignores final writes

Question : Which of the following conditions must hold for two schedules to be view equivalent?

Same conflict operations order

Same initial reads, same final writes, same read-from relations

No blind writes present

Same precedence graph

Question : Which statement is true regarding redo operations in deferred update?

Redo is optional

Redo may produce incorrect results if repeated

Redo is idempotent (safe to repeat)

Redo is only applied to uncommitted transactions

Question : What is the role of a checkpoint in log-based recovery?

It deletes all logs permanently

It marks the beginning of transactions

It reduces recovery time by limiting log scanning

It prevents system crashes

Question : In immediate update with undo/redo, which transactions are undone during recovery?

All transactions

Only committed transactions

Transactions without a commit record

Transactions before checkpoint

Question : Which of the following correctly describes deferred database modification?

Database is updated immediately after each write

Updates are written only after transaction commits

Both undo and redo are required

Old values must always be stored

Question : In log-based recovery, why must log records be written to stable storage before the actual database modification?

To improve query performance

To ensure atomicity and durability using Write-Ahead Logging

To reduce storage requirements

To simplify indexing

Question : Which of the following correctly describes redo and undo lists in checkpoint-based recovery?

Redo list contains uncommitted transactions

Undo list contains committed transactions

Redo list contains committed transactions, undo list contains incomplete ones

Both lists contain only active transactions

Question : After a system crash, from where does recovery typically start when checkpoints are used?

Beginning of the log file

Last committed transaction

Last checkpoint

Last aborted transaction

Question : Which type of checkpoint allows transactions to continue execution during checkpointing?

Static checkpoint

Consistent checkpoint

Fuzzy checkpoint

Manual checkpoint

Question : During checkpoint execution, which of the following operations is performed?

Only transaction logs are deleted

Dirty buffers are written to disk and checkpoint record is logged

Only active transactions are aborted

Database schema is updated

Question : Which of the following is the primary purpose of a checkpoint in DBMS?

To increase transaction concurrency

To reduce recovery time after system failure

To improve query execution speed

To enforce data normalization

Question : Which of the following is a key disadvantage of deadlock prevention techniques like Wait-Die and Wound-Wait?

They increase concurrency

They never abort transactions

They may unnecessarily abort transactions

They eliminate rollback completely

Question : Which statement is correct regarding Wound-Wait scheme?

Older transaction always waits

Younger transaction preempts older

Older transaction can force younger to abort

Both transactions are aborted

Question : In the Wait-Die scheme, what happens when a younger transaction requests a resource held by an older transaction?

Younger transaction waits

Older transaction aborts

Younger transaction aborts

Both transactions wait

Question : In a wait-for graph, deadlock exists if:

There is no edge in the graph

There is a cycle in the graph

Graph is disconnected

There are multiple nodes

Question : Which of the following is NOT a necessary condition for deadlock in DBMS?

Mutual exclusion

Hold and wait

Preemption allowed

Circular wait

About us

Term & conditions

Privacy & Policy

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

Cookies & Disclaimer