Suppose a relation R has attributes A, B and C that satisfies the functional dependency A-B and suppose relation S has attributes A, B and C with only trivial FDs on S. Which of the following statements is correct?
Suppose a relation R has attributes A, B and C that satisfies the functional dependency A-B and suppose relation S has attributes A, B and C with only trivial FDs on S. Which of the following statements is correct?
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Transcribed Image Text:Suppose a relation R has attributes A, B and C that satisfies the functional
dependency A→B and suppose relation S has attributes A, B and C with only trivial
FDs on S.
Which of the following statements is correct?
O The relation S-R does not satisfy the functional dependency A B.
O The relation TABC (R) does not satisfy the functional dependency A B.
The relation R n S does not satisfy the functional dependency A-B
O The relation OC=55(R) does not satisfy the functional dependency A- B.
O None of the provided answers about the functional dependency A -B is correct.
O All the provided answers about the functional dependency A- Bare correct.
4)
Let R(A, B, C, D, E) be a relation with FD's: {A -B, B-C, CDA, DE B).
Consider an instance of this relation that only contains the tuple (3, 4, 2, 1, 0). Which of
the following tuples can be inserted into this relation without violating the FD's?
O All of the provided answers.
O None of the provided answers.
O (3, 4, 2,0, 0)
O (0, 0, 2, 1, 1)
O (0, 1, 0, 1, 0)
O (4, 4, 2,1, 1)
Suppose R(A, B, C) with m tuples and S(D, E) withn tuples.
The following SQL query will result in how many tuples?
Select From R NATURAL JOIN S;
O (m + n)
O None of the provided answers.
O (m x n)
O min (m, n)
max (m, n)
Transcribed Image Text:1)
Consider the following relation instance of R1(A, B, C) contains the tuples
{(a1,b1.c1). (a2,b1,c1), (a3,b3,c3), (a4,b3,c3), (a5,b5.c5). (a6,b6,c6)}
and S1(B, C, D, E) contains the tuples ((b1.c1,d1,e1), (b1.c1.d2.e2),.(b1.c1,d3,e3),
(b2.c2,d2.e2), (b3,c3,d4,e4).(b6.c7.d8,e9))
The following SQL query will result in how many tuples?
Select From R1 r LEFT OUTER JOIN S1 s (ON r.B= s.B AND r.C=s.C):
(The answer will simply be an integer, like 25).
Answer:
2)
Consider a relation schema R = (A, B, C, D, E, F, G} with the following set of functional
dependencies:
F = (BG A, CGA, A BC, BC A, BD E, EF, CF B)
The decomposition of R into
R1 = (A, B, C, G), R2 = {B, D, E), R3 = (B, C, F) and R4 = (E, F) is
O In BCNF but Not in 3NF.
In 3NF but Not in BCNF.
In 3NF and in BCNF.
Not in 3NF and Not in BCNF
3)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 4 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY