Register

MadeEasy CBT2 q37

177 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Gate Fever asked Jan 28, 2019
567 views
made easy cbt2
consider the following relational schema R(A,B,C,D,E,F,G) AB->C,BC->A,AC->B,B->D,D->E how many minimum relations required to decompose R into BCNF which satisfy lossless and FDP decomposition? initially i got 4 relation as R1(A,B,C) R2(D,E) R3(B,D) R4(A,B,F,G) but in R1 and R2 there is no common attribute, hence it will not be lossless??am i correct
consider the following relational schema R(A,B,C,D,E,F,G)AB->C,BC->A,AC->B,B->D,D->Ehow many minimum relations required to decompose R into BCNF which satisfy lossless an...
User Avatar
0 votes
0 votes
0 answers
2
Chaitrasj asked Jan 26, 2019
282 views
Made easy CBT2
$R_2(A)$W_1(B)$W_1(C)$R_3(B)$R_2(B)$R_1(A)$C_1$R_2(C)$C_2$W_3(A)$C_3$ Is this schedule allowed under 2PL?
$R_2(A)$$W_1(B)$$W_1(C)$$R_3(B)$$R_2(B)$$R_1(A)$$C_1$$R_2(C)$$C_2$$W_3(A)$$C_3$Is this schedule allowed under 2PL?
User Avatar
0 votes
0 votes
0 answers
3
BOB asked Oct 13, 2018
208 views
Test-CD1-Q37
Consider the following grammar: S -> id = A! A -> id = A | E E -> id | (id!) | A While converting the LR(1) set of items to LALR(1) the number of merges required to be made for the grammar is: (A) 8 (B) 6 (C) 10 (D) 11
Consider the following grammar:S - id = A!A - id = A | EE - id | (id!) | AWhile converting the LR(1) set of items to LALR(1) the number of merges required to bemade for t...
User Avatar
Link Copied!