Entity-relationship Diagram! Database Trivia Quiz

40 Questions | Total Attempts: 510

SettingsSettingsSettings
Please wait...
Entity-relationship Diagram! Database Trivia Quiz

.


Questions and Answers
  • 1. 
    Which of the following gives a logical structure of the database graphically?
    • A. 

      Entity-relationship diagram

    • B. 

      Entity diagram

    • C. 

      Both A and B are correct.

    • D. 

      Neither A nor B

  • 2. 
    Every weak entity set can be converted into a strong entity set by:
    • A. 

      Using generalization

    • B. 

      Adding appropriate attributes

    • C. 

      Using aggregation

    • D. 

      None of the above

  • 3. 
    In a one-to-many relationship, the entity that is on the one side of the relationship is called a(n) ________ entity.
    • A. 

      Parent

    • B. 

      Child

    • C. 

      Subtype

    • D. 

      Instance

  • 4. 
    Weak entity relationship is represented as
    • A. 

      Underline

    • B. 

      Double line

    • C. 

      Double diamond

    • D. 

      Double rectangle

  • 5. 
    The ER model includes additional concepts like:
    • A. 

      Specialization

    • B. 

      Generalization

    • C. 

      Categorization

    • D. 

      All of the Above

  • 6. 
    E-R modelling techniques is a:
    • A. 

      Top-down approach

    • B. 

      Bottom-up approach

    • C. 

      Left-right approach

    • D. 

      None of the above

  • 7. 
    The total participation by entities is represented in the E-R diagram as
    • A. 

      Dashed line

    • B. 

      Double line

    • C. 

      Double rectangle

    • D. 

      Circle

  • 8. 
    Which relationship is used to represent a specialization entity?
    • A. 

      ISA

    • B. 

      AIS

    • C. 

      ONIS

    • D. 

      WHOIS

  • 9. 
    A _____________ constraint requires that an entity belong to no more than one lower-level entity set.
    • A. 

      Disjointness

    • B. 

      Uniqueness

    • C. 

      Special

    • D. 

      Relational

  • 10. 
    The completeness constraint may be one of the following: Total generalization or specialization, Partial generalization or specialization. Which is the default?
    • A. 

      Total

    • B. 

      Partial

    • C. 

      Should be specified

    • D. 

      Cannot be determined

  • 11. 
    Which normal form is considered adequate for normal relational database design?
    • A. 

      2NF

    • B. 

      5NF

    • C. 

      4NF

    • D. 

      3NF

  • 12. 
    Consider a schema R(A, B, C, D) and functional dependencies A -> B and C -> D. Then the decomposition of R into R1 (A, B) and R2(C, D) is
    • A. 

      Dependency preserving and lossless join

    • B. 

      Lossless join but not dependency preserving

    • C. 

      Dependency preserving but not lossless join

    • D. 

      (d) not dependency preserving and not lossless join

  • 13. 
    Relation R with an associated set of functional dependencies, F, is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is
    • A. 

      Zero

    • B. 

      More than zero but less than that of an equivalent 3NF decomposition 

    • C. 

      Proportional to the size of F+

    • D. 

      Indeterminate

  • 14. 
    A table has fields F1, F2, F3, F4, and F5, with the following functional dependencies: 1) F1->F3 2) F2->F4 3) (F1,F2)->F5 in terms of normalization, this table is in
    • A. 

      1NF

    • B. 

      2NF

    • C. 

      3NF

    • D. 

      NONE OF THE ABOVE

  • 15. 
    Consider the following functional dependencies in a database. 1) Date_of_Birth->Age 2) Age->Eligibility 3)Name->Roll_number 4)Roll_number->Name 5)Course_number->Course_name 6)Course_number->Instructor 7)(Roll_number, Course_number)->Grade The relation (Roll_number, Name, Date_of_birth, Age) is
    • A. 

      In second normal form but not in third normal form 

    • B. 

      In third normal form but not in BCNF 

    • C. 

      In BCNF   

    • D. 

      In none of the above

  • 16. 
    The relation schema Student_Performance (name, courseNo, rollNo, grade) has the following FDs: 1) name,courseNo->grade 2) rollNo,courseNo->grade 3)name->rollNo 4) rollNo->name The highest normal form of this relation scheme is
    • A. 

      2NF

    • B. 

      BCNF

    • C. 

      3NF

    • D. 

      4NF

  • 17. 
    The relation EMPDT1 is defined with attributes empcode(unique), name, street, city, state, and pincode. For any pincode,there is only one city and state. Also, for any given street, city and state, there is just one pincode. In normalization terms EMPDT1 is a relation in
    • A. 

      1NF only

    • B. 

      3NF and hence also in 2NF and 1NF 

    • C. 

      BCNF and hence also in 3NF, 2NF and 1NF

    • D. 

      2NF and hence also in 1NF

  • 18. 
    Which one of the following statements if FALSE?
    • A. 

      A prime attribute can be transitively dependent on a key in a BCNF relation.

    • B. 

      Any relation with two attributes is in BCNF

    • C. 

      A relation in which every key has only one attribute is in 2NF

    • D. 

      A prime attribute can be transitively dependent on a key in a 3 NF relation.

  • 19. 
    Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection (Title, Author, Catalog_no) With the following functional dependencies: I. Title Author -> Catalog_no II. Catalog_no -> Title Author Publisher Year III. Publisher Title Year -> Price Assume {Author, Title} is the key for both schemes. Which of the following statements is true?
    • A. 

      Both Book and Collection are in 3NF only

    • B. 

      Book is in 2NF and Collection is in 3NF

    • C. 

      Both Book and Collection are in BCNF

    • D. 

      Both Book and Collection are in 2NF only

  • 20. 
    Let R(A,B,C,D,E,P,G) be a relational schema in which the following FDs are known to hold: 1) AB->CD 2) DE->P 3) C->E 4) P->C 5) B->G The relation schema R is
    • A. 

      Not in 2NF

    • B. 

      In 3NF, but not in BCNF

    • C. 

      In 2NF, but not in 3NF      

    • D. 

      In BCNF  

  • 21. 
    Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F={CH→G, A→BC, B→CFH, E→A, F→EG} is a set of functional dependencies (FDs) so that F + is exactly the set of FDs that hold for R. How many candidate keys does the relation R have?
    • A. 

      3

    • B. 

      5

    • C. 

      4

    • D. 

      6

  • 22. 
    Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F={CH→G, A→BC, B→CFH, E→A, F→EG} is a set of functional dependencies (FDs) so that F + is exactly the set of FDs that hold for R. The relation R is
    • A. 

      In 2NF, but not in 3NF. 

    • B. 

      In 3NF, but not in BCNF. 

    • C. 

      In 1NF, but not in 2NF. 

    • D. 

      In BCNF.

  • 23. 
    Every time attribute A appears, it is matched with the same value of attribute B, but not the same value of attribute C. Therefore, it is true that:
    • A. 

      A → B.

    • B. 

      A → C.

    • C. 

      A → (B,C).

    • D. 

      (B,C) → A.

  • 24. 
    A functional dependency is a relationship between or among:
    • A. 

      Tables

    • B. 

      Rows

    • C. 

      Relations

    • D. 

      Attributes

  • 25. 
    If every functional dependency in set E is also in closure of F then this is classified as
    • A. 

      FD is covered by E

    • B. 

      E is covered by F

    • C. 

      F is covered by E

    • D. 

      F+ is covered by E

Related Topics
Back to Top Back to top