Multiple choices.  Circle (or indicate) the correct (or the best) answer. You should choose only one answer. Multiple circles (or answers) will be considered as wrong answer. No explanation needed. No partial credit will be given.   (1) Consider a weak entity set e’ in an ERD. If the identifying strong entity set e has primary key p, the weak entity set e’ has three attributes b, c and d in its schema, and if b and c together form the partial key of e’, then the schema of the relational table reduced from this weak entity set e’ is p, b, c, e [underlined attributes indicate schema of the relation] p, b, c, e [underlined attributes indicate schema of the relation] p, b, c, e [underlined attributes indicate schema of the relation] p, b, c [underlined attributes indicate schema of the relation] None of the above.   (2) The following is the most fundamental concept in traditional database management. (a) 3NF and BCNF (b) Lossless join (c) ER diagram (d) Schema (e) Lossless join   (3) For relation R(ABCD) with F={AàB, BàC, ABà BCD, DàAC}, the following is a canonical cover: Fc={AàB, BàCD, DàA}. Fc={AàD, BàC, DàAC}. Fc={AàBD, BàC, DàA}. Fc={AàBC, BàD, DàA}. None of the above.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
  1. Multiple choices.  Circle (or indicate) the correct (or the best) answer. You should choose only one answer. Multiple circles (or answers) will be considered as wrong answer. No explanation needed. No partial credit will be given.

 

(1) Consider a weak entity set e’ in an ERD. If the identifying strong entity set e has primary key p, the weak entity set e’ has three attributes b, c and d in its schema, and if b and c together form the partial key of e’, then the schema of the relational table reduced from this weak entity set e’ is

  • p, b, c, e [underlined attributes indicate schema of the relation]
  • p, b, c, e [underlined attributes indicate schema of the relation]
  • p, b, c, e [underlined attributes indicate schema of the relation]
  • p, b, c [underlined attributes indicate schema of the relation]
  • None of the above.

 

(2) The following is the most fundamental concept in traditional database management.

(a) 3NF and BCNF

(b) Lossless join

(c) ER diagram

(d) Schema

(e) Lossless join

 

(3) For relation R(ABCD) with F={AàB, BàC, ABà BCD, DàAC}, the following is a canonical cover:

  • Fc={AàB, BàCD, DàA}.
  • Fc={AàD, BàC, DàAC}.
  • Fc={AàBD, BàC, DàA}.
  • Fc={AàBC, BàD, DàA}.
  • None of the above.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Enhanced ER Model
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education