BSC CSIT Semester 4 – Database Management System () Questions & Answers | Past TU Exam Papers

Schedule and Serializability in DBMS 1️⃣ Schedule A schedule is the sequence of operations (read/write/commit/abort) from multiple transactions as they are executed by the DBMS. - Represents the or

1. Schedule - A schedule is a sequence of operations (Read, Write, Commit, Rollback) from two or more transactions in a DBMS. - It shows how operations of transactions are interleaved while maintain

1. Definition A conflict schedule is a schedule of database operations in which the order of conflicting operations matters. Conflicting operations occur when two operations from different transacti

1. Definition A transaction is a unit of work in a database that is executed as a whole. - It may consist of one or more operations like read, write, update. - A transaction is atomic, meaning eit

1. Definition of Transaction A transaction is a logical unit of work in a database that is executed as a single, indivisible operation. - It may consist of one or more database operations such as re

Schedule Based on Recoverability and Serializability (5 Marks) 1. Recoverable Schedule - A schedule is recoverable if a transaction commits after all transactions whose data it has read have committe

a. Transaction Processing Definition: Transaction processing is the execution of database operations as a single logical unit of work, called a transaction, which must satisfy ACID properties: - Ato

Desirable Properties of Transactions (ACID Properties) A transaction should have the following properties, commonly known as ACID: 1. Atomicity - Ensures that a transaction is treated as a single u

Specialization and Disjoint Constraint in DBMS 1. Specialization Definition: Specialization is a top-down approach in Entity-Relationship (ER) modeling where a higher-level (superclass) entity is d