This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 1 year, 11 months ago.

  • Author
    Posts
  • #1440497 Reply
     EduGorilla 
    Keymaster
    Select Question Language :


    Consider a relation R with n attributes. Super key for a relation R is set of attributes which can be used to determine all the attributes of a relation, whether minimal or not. Suppose every (n-2) attribute set of relation R acts as candidate key. For Example, let n=4, R (A, B, C, D). Then, candidate keys are {AB, BC, CD, AD, BD, AC}.
    Which relation describes the no. of super keys possible for Relation R with n attributes?

    Options :-

    1. C( n, n-2)
    2. C(n, n-2)+ C(n, n-1)+ C(n, n)
    3. n(n-1)/2
    4. n(n-1)/2 +1
    Post your Training /Course Enquiry
    Are You looking institutes / coaching center for
    • IIT-JEE, NEET, CAT
    • Bank PO, SSC, Railways
    • Study Abroad
    Select your Training / Study category
Reply To: Consider a relation R with n attributes. Super key for a relation R is set of attributes which can b….
Your information:




Verify Yourself




Log in with your credentials

or    

Forgot your details?

Create Account