Question 89 Which of the following is an optimistic concurrency control method ? A Validation based B Timestamp ordering C Lock-based D None of these Database-Management-SystemTransactionsUGC […]

Question 86 Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R, it will A result in […]

Question 84 The basic variants of time-stamp based method of concurrency control are A Total timestamp-ordering B Partial timestamp ordering C Multiversion Timestamp ordering D All […]

Question 575 Leaves of which of the following trees are at the same level ? A Binary tree B B-tree C AVL-tree D Expression tree Database-Management-SystemB-and-B+-TreesUGC […]