Register

MADE EASY TEST SERIES
closed

• closed by
347 views
0 votes
0 votes
closed as a duplicate of: Made easy test series
Consider the following transactions:

T₁= w(A);w(B);r(C);Commit

T₂= w(B);r(B);Commit

The number of schedules of T1 and T2 that are recoverable are_________?
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Mrityudoot asked Jan 12
147 views
Made Easy Test Series
Isn’t F$^{+}$ minimal cover? If C $\rightarrow$ A is already there, then why does augmented CD $\rightarrow$ A needs to be?
Isn’t F$^{+}$ minimal cover? If C $\rightarrow$ A is already there, then why does augmented CD $\rightarrow$ A needs to be?
User Avatar
0 votes
0 votes
1 answer
2
tulsidas.bhu asked Jan 8
184 views
made easy test series
Can anyone explain how the answer is 10?
Can anyone explain how the answer is 10?
User Avatar
1 votes
1 votes
1 answer
3
Sajal Mallick asked Nov 5, 2023
360 views
MADE EASY TEST SERIES
Unique not null is equivalent to primary key. Relational Algebra and SQL has same expressive power. Which of the above statements are False?
Unique not null is equivalent to primary key.Relational Algebra and SQL has same expressive power.Which of the above statements are False?
User Avatar
2 votes
2 votes
1 answer
4
kaustubh7 asked Sep 20, 2023
447 views
made easy test series 2023
Consider a relation R having seven attributes ABCDEFG. Fields of R contain only atomic values. FDs = {CD → G, A → BC, B → CF, E → A, F → EG, G → D} is set of functional dependencies. So, how many candidates key does the relation R have?
Consider a relation R having seven attributes ABCDEFG. Fields of R contain only atomic values.FDs = {CD → G, A → BC, B → CF, E → A, F → EG, G → D} is set of f...
User Avatar
Link Copied!