Register

NIELIT STA 2021

391 views
0 0 votes

Consider a relation R with attributes {A,B,C} and functional dependency set S ={A → B, A → C}. Then relation R can be decomposed into two relations: 

 

  1. R1{A,B} AND R2{A,C}
  2. R1{A,B} AND R2{B,C]
  3. R1{A,B,C} AND R2{A,C}
  4. None of the above

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · NIELIT STA 2021Next → · NIELIT STA 2021
← Previous in category · NIELIT STA 2021Next in category → · AKTU university
Position:
Show:

Related questions

0 0 votes
1 1 answer
588
588 views
rsansiya111 asked Dec 6, 2021
588 views
NIELIT STA 2021
Consider the relations:$R_{1}${Roll_No, Name, Grades} and $R_{2}${Roll_No, Subject_ID, Grades}Which of the following operations cannot be performed using the above relati...
0 0 votes
1 1 answer
712
712 views
rapidxy asked Dec 14, 2021
712 views
NIELIT STQC STA 2021
Let $C(n,r)= \binom{n}{r}$.The value of $\sum_{k=0}^{20}(2k+1)C(41,2k+1)$ is :A)40(2)^40 B)40(2)^39C)41(2)^40D)41(2)^39
1 1 vote
0 0 answers
643
643 views
rsansiya111 asked Dec 6, 2021
643 views
NIELIT STA 2021
If a hash table is implemented asa search tree, the expected time required to enter n names and make m searches is proportional to: (n + m) $log_{2} n$(n + m) $log_{2} m$...
0 0 votes
1 1 answer
1.1k
1.1k views
rsansiya111 asked Dec 6, 2021
1,051 views
NIELIT STA 2021
Total number of nodes at the nth level of a full binary tree can be given as___________. 2n + 1$2n^{2}$2^n2n – 1