Computer Sciences > GATE 2014 SET-2 > Transaction Management

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Consider the following schedule S of transactions T1, T2, T3, T4:

Which one of the following statements is CORRECT?

A

S is conflict-serializable but not recoverable

B

S is not conflict-serializable but is recoverable

C

S is both conflict-serializable and recoverable

D

S is neither conflict-serializable nor is it recoverable

Check Answer

Explanation

Correct : c

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science