Scribd Logo
Upload

Welcome to Scribd!

  • Q7

    Uploaded by

    bmashrequi
    33 views2 pages
    The document contains 10 multiple choice questions about database concepts like attributes, keys, relationships, normalization, Codd's rules, and entity-relationship modeling. The questions cover topics such as the definition of prime and candidate attributes, the degree of relationships, Codd's 12 rules, attribute domains, first normal form, composite keys, hierarchical data models, primary keys, and weak entity sets in ER diagrams.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains 10 multiple choice questions about database concepts like attributes, keys, relationships, normalization, Codd's rules, and entity-relationship modeling. The questions cover topics such as the definition of prime and candidate attributes, the degree of relationships, Codd's 12 rules, attribute domains, first normal form, composite keys, hierarchical data models, primary keys, and weak entity sets in ER diagrams.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    33 views2 pages

    Q7

    Uploaded by

    bmashrequi
    The document contains 10 multiple choice questions about database concepts like attributes, keys, relationships, normalization, Codd's rules, and entity-relationship modeling. The questions cover topics such as the definition of prime and candidate attributes, the degree of relationships, Codd's 12 rules, attribute domains, first normal form, composite keys, hierarchical data models, primary keys, and weak entity sets in ER diagrams.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 2

    An attribute that is not part of any candidate key is known as

    B. sub-prime attribute
    A. non-prime attribute
    D. sub-candidate key
    C. non-candidate key
    ANSWER: B

    Which of the follow is not the degree of relationship?


    A. Single
    B. Binary
    C. Ternary
    D. n-ary
    ANSWER: A

    The degree of the relationship is


    A. number of Tables in a relationship
    B. number of entities in a relationship
    C. number of Row & Columns in a relationship
    D. number of participating entities in a relationship
    ANSWER: D

    How many rules in “CODD’S RULES” of Relational Model of database systems?


    A. 11
    B. 12
    C. 13
    D. 14
    ANSWER: B

    Every attribute has some predefined value scope that is called


    A. Tuple
    B. Tables
    C. Attribute domain
    D. Relation schema
    ANSWER: C

    An attribute of a table cannot hold multiple values is the property of


    A. First normal form (1NF)
    B. Second normal form (2NF)
    C. Third normal form (3NF)
    D. Fourth normal form (4NF)
    ANSWER: A

    A key that consists of more than one attribute to uniquely identify rows in a table
    is called
    A. Composite key
    B. Candidate key
    C. Primary key
    D. Foreign key
    ANSWER: A

    In hierarchical model, data is organized into


    A. logical structure
    B. physical structure
    C. tree like structure
    D. none of them
    ANSWER: C

    The key selected from the sets of candidate keys by database designer is called
    A. Primary key
    B. Secondary Key
    C. Foreign key
    D. Super key
    ANSWER: A

    In an Entity-Relationship diagram “Double Rectangles” represents


    A. Relationship Set
    B. Weak Entity Sets
    C. Derived Attributes
    D. Multi-valued Attributes
    ANSWER: B

    You might also like