Home > Databases > Quizzes > Advance Data Management Technology: Transactions Management and Concurrency
Advance Data Management Technology: Transactions Management and Concurrency
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 0% • Most missed: “If a transaction may release locks but may not obtain any locks, it is said to b…”
Advance Data Management Technology: Transactions Management and Concurrency
Time left 00:00
25 Questions

1. If a transaction Ti may never make progress, then the transaction is said to be ____________
2. In ___________ isolation each transaction is given its own version of the database
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. Which of the following cannot be used to implement a timestamp
5. W-timestamp(Q) denotes?
6. State true or false: Partial rollback is not possible.
7. ________ 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.
8. Which of the following is not a transaction state?
9. The scheme that controls the interaction between executing transactions is called as _____
10. State true or false: If I = read(Q) and J = write(Q) then the order of I and J does not matter.
11. State true or false: The Thomas write rule has a greater potential concurrency than the timestamp ordering protocol
12. Collections of operations that form a single logical unit of work are called __________
13. State true or false: All the isolation levels disallow dirty writes
14. Which of the following is not a method in deadlock handling
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. Lock timeouts have which of the following advantages?
17. Which of the following systems is responsible for ensuring durability?
18. ________ allows only committed data to be read, but does not require repeatable reads
19. Which of the following is not a type of a schedule?
20. Which of the following is not a property of a transaction?
21. State true or false: Transactions can only run serially
22. If a transaction may obtain locks but may not release any locks then it is in _______ phase
23. The default timestamp ordering protocol generates schedules that are
24. If a transaction can be granted a lock on an item immediately in spite of the presence of another mode, then the two modes are said to be ________
25. State true or false: It is not necessarily desirable for a transaction to unlock a data item immediately after its final access

⚡ Recently practiced quizzes in this topic
Live quiz activity
DBMS Basics Practice Test: SQL - Queries, Constraints and Triggers Database Fundamentals Transact-SQL (T-SQL) Practice Test PostgreSQL Fundamentals Test SQL Server Vocab Redis Practice Test (NoSQL) DBMS Basics Practice Test: Indexing and Hashing Database Management System (DBMS) Practice Test: All Topics SQL Fundamentals Test SQL MCQs
 
❤ 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.