Tutorials
PPTs
Lecture Notes
Objective Questions
Lab ProgramsObjective Type Questions & Answers
Database Management System Objective Type Question Bank-Unit-4
1. A _________ consists of a sequence of query and/or update statements.
A . Transaction
B . Commit
C . Rollback
D . Flashback
2. Which of the following makes the transaction permanent in the database?
A . View
B . Commit
C . Rollback
D . Flashback
3. In order to undo the work of transaction after last commit which one should be used?
A . View
B . Commit
C . Rollback
D . Flashback
4. What is ACID properties of Transactions?
A . Atomicity, Consistency, Isolation, Database
B . Atomicity, Consistency, Isolation, Durability
C . Atomicity, Consistency, Inconsistent, Durability
D . Automatically, Concurrency, Isolation, Durability
5. In order to maintain the consistency during transactions, database provides
A . Commit
B . Atomic
C . Flashback
D . Retain
6. Database locking concept is used to solve the problem of
A . Lost Update
B . Uncommitted Dependency
C . Inconsistent Data
D . All of the above
7. Execution of translation in isolation preserves the _________ of a database
A . Atomicity
B . Consistency
C . Durability
D . All of the mentioned
8. A lock that allows concurrent transactions to access different rows of the same table is known as a
A . Field-level lock
B . Row-level lock
C . Table-level lock
D . Database-level lock
9. A system is in a ______ state if there exists a set of transactions such that every transaction in the set is waiting for another transaction in the set.
A . Idle
B . Waiting
C . Deadlock
D . Ready
10. Which of the following occurs when a transaction rereads data and finds new rows that were inserted by a command transaction since the prior read?
A . Nonrepeatable read
B . Phantom read
C . Dirty read
D . Consistent read
11. Which of the following systems is responsible for ensuring durability?
A . Recovery system
B . Atomic system
C . Concurrency control system
D . Compiler system
12. Which of the following systems is responsible for ensuring isolation?
A . Recovery system
B . Atomic system
C . Concurrency control system
D . Compiler system
13. A transaction for which all committed changes are permanent is called:
A . atomic
B . consistent
C . isolated
D . durable
14. Transaction management ensures ____________ and __________ properties.
A . Atomicity and Intigrity
B . Atomicity and Durability
C . Atomicity and Abstraction
D . None of these
15. Concurrency control is important for which of the following reasons?
A . To ensure data integrity when updates occur to the database in a multiuser environment
B . To ensure data integrity when updates occur to the database in a single-user environment
C . To ensure data integrity while reading data occurs to the database in a multiuser environment
D . To ensure data integrity while reading data occurs to the database in a single-user environment
16. Locking may cause which of the following problems?
A . Erroneous updates
B . Deadlock
C . Versioning
D . All of the above.
17. Execution of translation in isolation preserves the _________ of a database
A . Atomicity
B . Consistency
C . Durability
D . All of the mentioned
18. State true or false: If I = read(Q) and J = write(Q) then the order of I and J does not matter.
A . True
B . False
C . May be
D . Can`t say
19. If a schedule is equivalent to a serial schedule, it is called as a _________
A . Serializable schedule
B . Equivalent schedule
C . Committed schedule
D . None of the mentioned
20. ________ allows only committed data to be read and further requires that no other transaction is allowed to update it between two reads of a data item by a transaction.
A . Read uncommitted
B . Serializable
C . Repeatable read
D . Read committed
21. When is a timestamp allotted
A . When execution begins
B . When execution is taking place
C . When execution is completed
D . None of the mentioned
22. I and J are _________ if they are operations by different transactions on the same data item, and at least one of them is a write operation.
A . Conflicting
B . Overwriting
C . Isolated
D . Durable
23. If a schedule S can be transformed into a schedule S’ by a series of swaps of non-conflicting instructions, then S and S’ are
A . Non conflict equivalent
B . Equal
C . Conflict equivalent
D . Isolation equivalent
24. The set of ________ in a precedence graph consists of all the transactions participating in the schedule
A . Vertices
B . Edges
C . Directions
D . None of the mentioned
Fill in the Blanks
25. Database ............................ are the units in which programs read or write information.
26. Once the DBMS informs the user that a transaction has been successfully completed, its effects should persist even if the system crashes before all its changes are reflected on disk known as .................................
27. ................................... is the initial state of a transaction.
28. .................................. state occurs after the discovery that normal execution can no longer proceed.
29. Transaction-processing systems usually allow multiple transactions to run concurrently (at the same time) known as ....................................
30. Users are responsible for ensuring transaction ...................................
31. The .......................... locking protocol ensures serializability.
32. .............................. protocols ensure that the system will never enter into a deadlock state.
33. When a deadlock is detected, some transaction will have to be rolled back to break the ........................................
34. A transaction is an execution of a user program and is seen by the DBMS as a ................................. or list of actions.
Relevant Materials :
☞ Database Management System Objective Type Question Bank-Unit-1 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-2 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-3 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-4 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-5 - [ DBMS ]
Similar Materials :
☞ R - Programming MCQs - Unit-1 - [ R-Programming ]
☞ R - Programming MCQs - Unit-2 - [ R-Programming ]
☞ R - Programming MCQs - Unit-3 - [ R-Programming ]
☞ R - Programming MCQs - Unit-4 - [ R-Programming ]
☞ R - Programming MCQs - Unit-5 - [ R-Programming ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-1 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-2 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-3 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-4 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-5 - [ FLAT ]
☞ PPS MCQs - Unit-1 - [ PPS ]
☞ PPS MCQs - Unit-2 - [ PPS ]
☞ PPS MCQs - Unit-3 - [ PPS ]
☞ PPS MCQs - Unit-4 - [ PPS ]
☞ PPS MCQs - Unit-5 - [ PPS ]
☞ Object Oriented Programming through Java MCQs - Unit-1 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-2 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-3 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-4 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-5 - [ OOP_JAVA ]
☞ Design and Analysis of Algorithms MCQs - Unit-1 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-2 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-3 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-4 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-5 - [ DAA ]
☞ Software Engineering MCQs - Unit-1 - [ SE ]
☞ Software Engineering MCQs - Unit-2 - [ SE ]
☞ Software Engineering MCQs - Unit-3 - [ SE ]
☞ Software Engineering MCQs - Unit-4 - [ SE ]
☞ Software Engineering MCQs - Unit-5 - [ SE ]
☞ Data Mining MCQs - Unit-1 - [ DM ]
☞ Data Mining MCQs - Unit-2 - [ DM ]
☞ Data Mining MCQs - Unit-3 - [ DM ]
☞ Data Mining MCQs - Unit-4 - [ DM ]
☞ Data Mining MCQs - Unit-5 - [ DM ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-1 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-2 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-3 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-4 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-5 - [ COA ]
☞ Data Structures Objective Type Question Bank-Unit-1 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-2 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-3 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-4 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-5 - [ DS ]
☞ Cyber Forensics Objective Type Question Bank-Part-2 - [ Cyber Forensics ]
☞ Cyber Forensics Objective Type Question Bank-Part-1 - [ Cyber Forensics ]
☞ Java Programming Objective Type Question Bank - [ Java Programming ]
☞ Java Programming Objective Type Questions-Part-1 - [ Java Programming ]
☞ Java Programming Objective Type Questions-Part-2 - [ Java Programming ]