Home > Computer Engineering > Quizzes > Database Management Systems: Transactions Management and Concurrency
Database Management Systems: Transactions Management and Concurrency
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 17% • Most missed: “The protocol that indicates when a transaction may lock and unlock each of the d…”
Database Management Systems: Transactions Management and Concurrency
Time left 00:00
25 Questions

1. Selecting the victim to be rollbacked to the previous state is determined by the minimum cost. The factors determining cost of rollback is
2. In order to undo the work of transaction after last commit which one should be used?
3. 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
4. State true or false: Partial rollback is not possible.
5. A lock that allows concurrent transactions to access different rows of the same table is known as a
6. The ____ lock allows concurrent transactions to access the same row as long as they require the use of different fields within that row.
7. The situation where no transaction can proceed with normal execution is known as ________
8. A transaction is made to wait until all ________ locks held on the item are released
9. The two phase locking protocol consists which of the following phases?
10. If a transaction has obtained a __________ lock, it can read but cannot write on the item
11. The situation where the lock waits only for a specified amount of time for another lock to be released is
12. Which of the following are introduced to reduce the overheads caused by the log-based recovery?
13. Which of the following is a procedure for acquiring the necessary locks for a transaction where all necessary locks are acquired before any are released?
14. A transaction can proceed only after the concurrency control manager ________ the lock to the transaction
15. 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.
16. State true or false: Wait die scheme is a non-preemptive technique
17. A _________ consists of a sequence of query and/or update statements.
18. If a transaction Ti may never make progress, then the transaction is said to be ____________
19. A ___________of the transactions can be obtained by finding a linear order consistent with the partial order of the precedence graph.
20. When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is rolled back (Tj is wounded by Ti). This is
21. Which of the following is used to get back all the transactions back after rollback?
22. If a transaction may release locks but may not obtain any locks, it is said to be in ______ phase
23. The protocol that indicates when a transaction may lock and unlock each of the data items is called as __________
24. What are the ways of dealing with deadlock?
25. In case of any shut down during transaction before commit which of the following statement is done automatically?

⚡ Recently practiced quizzes in this topic
Live quiz activity
Information Technology Knowledge Test Computer Network MCQs General CS (Computer Science) Knowledge Test Big Data: NoSQL Green Computing Practice Test Natural Language Processing: Word Level Analysis Computational Thinking Concepts Computer Fundamentals Practice Test Operating Systems Practice Test: Introduction to OS Computer Fundamentals Practice Test: Generations of Computers
 
❤ If you liked Fatskills, consider supporting us by checking out The Life Manuals You Never Got.

🌈  Our mission is to help improve your scores in any subject and exam withonline quizzes, practice tests, study guides, & advice for students. Since 2018.
About | Explore | User Guide | Topics | Subjects | Doubt Solver | Career Aptitude Test | Answers | Free Tools | OSHA Basics Quiz | What Should We Know?
Privacy | Terms |
Without work one finishes nothing. - Ralph Waldo Emerson
© 2026 Fatskills.com

All trademarks, logos and brand names are the property of their respective owners. All company, product and service names used in this website are for identification purposes only. Use of these names, trademarks and brands does not imply endorsement.