Register

Relation R(A1, A2, A3 ..... An) n attributes. On this relation m simple candidate key (m ≤ n). How many super keys possible in this relation? A. 2m – 1 B. (2n – 1) ⋅ 2n-m C. 2n – 1 D. (2m – 1) 2n-m

173 views

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

447
views
1 answers
0 votes
Mukesh_Kumar asked Dec 30, 2023
447 views
Let a relation in DBMS is given as R(A, B, C, D, E) and candidate keys are {A} and {BC}. Total number of possible super keys are:
User Avatar
746
views
1 answers
0 votes
radha gogia asked Aug 15, 2015
746 views
Consider a relational table r with sufficient number of records, having attributes A1, A2,…, An and let 1 <= p <= n.
The database can be configured to do ordered indexing on Ap or hashing on Ap. Which of the following statements is TRUE?(A) Ordered indexing will always outperform ... on Q2(D) Hashing will outperform ordered indexing on Q2, but not on Q1.
User Avatar
1.3k
views
2 answers
0 votes
dhruba asked Jun 5, 2023
1,286 views
Binary search is performed on a sorted array of n elements. The search key is not in the array and falls between the elements at positions m and m+1 (where 1 ≤ m < n). How many comparisons are needed in the worst case scenario to determine that the key is not in the array?
Binary search is performed on a sorted array of n elements. The search key is not in the array and falls between the elements at positions m and m+1 (where 1 ≤ m < n). How ... . ceil(log(n))b. floor(log(n))c. ceil(log(m))d. floor(log(m))
User Avatar
4.1k
views
2 answers
0 votes
Rohit Gupta 8 asked Nov 18, 2017
4,132 views
The number of superkeys possible for the relation R(A B C D E) with {A, BC, CDE} as three candidate keys are _________.
The number of superkeys possible for the relation R(A B C D E) with {A, BC, CDE} as three candidate keys are _________.Please EXPLAIN the solution.
User Avatar
Link Copied!