The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged superkeys
+1
vote
1
answer
1
Made Easy Test Series:DatabaseSuperKeys
Consider the relation $R\left ( A,B,C,D,E \right )$ $A\rightarrow BC$ $C\rightarrow E$ $B\rightarrow D$ $E\rightarrow A$ Total number of superkeys present in relation will be ____________________
asked
May 9, 2019
in
Databases
by
srestha
Veteran
(
119k
points)

176
views
databases
superkeys
madeeasytestseries
+1
vote
1
answer
2
Made easy mock test 1 DBMS super keys
Consider the following relation R(A1, A2,...A15) with (A1,A2, ... A6) of relation R are simple candidate key. The number of possible superkey in relation R is_
asked
Jan 30, 2019
in
Databases
by
Ram Swaroop
Loyal
(
5.3k
points)

201
views
databases
superkeys
candidatekeys
0
votes
1
answer
3
Self Doubt
Consider the following relation: R (A1, A2, ….An) and every (n2) attributes of R forms a candidate key. How many super keys are there in R?
asked
Jan 22, 2019
in
Databases
by
kumar.dilip
Active
(
5.2k
points)

115
views
databases
superkeys
+3
votes
1
answer
4
MadeEasy Test Series: Databases  Functional Dependencies
Consider the relation R(A,B,C,D,E) with the functional dependencies : A → B, B → C, C → A, D → E, and E → D The Maximum possible superkeys of R is ______________?
asked
Dec 7, 2018
in
Databases
by
naveen bhatt
Junior
(
751
points)

197
views
madeeasytestseries
databases
databasenormalization
superkeys
0
votes
1
answer
5
Super Keys
How many Super keys Possible for R(A,B,C,D,E) with 1. {A,BC,DE} as the keys ? 2. {A,BC,CDE} as the keys ?
asked
Oct 13, 2018
in
Databases
by
Na462
Loyal
(
7k
points)

99
views
databases
superkeys
candidatekeys
0
votes
1
answer
6
MadeEasy Test Series: Databases  Candidate Keys
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) ⋅ 2nm C. 2n – 1 D. (2m – 1) 2nm One way is by taking instances and solve it, but plz without it what's the logic behind the answer?
asked
May 17, 2018
in
Databases
by
Na462
Loyal
(
7k
points)

292
views
databases
superkeys
candidatekeys
madeeasytestseries
0
votes
2
answers
7
Super Key 1
Consider the following relational schema R(ABCDE). The number of super keys in relation R if every two attributes of relation R is candidate keys are __________. Please explain a general method to solve
asked
May 12, 2018
in
Databases
by
Na462
Loyal
(
7k
points)

97
views
superkeys
databases
0
votes
0
answers
8
Databases  Superkeys
How to calculate super key of any relation? Pls explain with example.
asked
Apr 8, 2018
in
Databases
by
Dhoomketu
(
139
points)

94
views
databases
superkeys
+1
vote
1
answer
9
No of Super Key
R (A1, A2, ….An) and every (n2) attributes of R forms a candidate key. How many super keys are there in R? a) $_{n2}^{n}\textrm{C}$ b) $_{n2}^{n}\textrm{C}$ * 4 c) $_{n2}^{n}\textrm{C}$ * n d) $_{n2}^{n}\textrm{C}$ + n +1
asked
Jan 18, 2018
in
Databases
by
hacker16
Active
(
2.7k
points)

260
views
superkeys
databases
candidatekeys
+2
votes
0
answers
10
No. of Super keys
a relation R(A,B,C,D,E,F,G,H) and set of functional dependencies are {CH>G,A>BC,B>CFH,E>A,F>EG } then how many possible super keys are present ? https://gateoverflow.in/42238/tocalculatehowmanynoofsuperkeys Is my approach right? ... BDE,BDF, EDF,AED,ADEF,ABDE,AFBE,AFBD,ABDEF}= 15 ways total = 15* 8 = 120 ways ....Can someone plz confirm it.... thank u
asked
Jan 12, 2018
in
Databases
by
Pawan Kumar 2
Active
(
4.2k
points)

214
views
superkeys
+2
votes
3
answers
11
functional dependency
Let the relation R(X, Y, Z, A, B) with given functional dependencies X > YZ Z > A A > B AZ > X The number of super keys possible__________ ? Please answer with an explanation.
asked
Aug 29, 2017
in
Databases
by
Warlock lord
Active
(
3.3k
points)

147
views
databasenormalization
databases
superkeys
+5
votes
2
answers
12
MadeEasy Test Series: Databases  Super Keys
Consider a relation $R$ with $2n$ attributes. Assume any $2n/2$ of the attributes constitutes key. Total number of super keys possible are: $^{2n}C_{2^{n1}}\times \left(2\right)^{2^{n1}}$ $^{2n}C_{2^{n1}} + \left(2\right)^{2^{n1}}$ $^{2n}C_{2^{n1}}  \left(2\right)^{2^{n1}}$ $^{2n}C_{2^{n1}} \div \left(2\right)^{2^{n1}}$
asked
Jan 18, 2016
in
Databases
by
Tushar Shinde
Active
(
2.2k
points)

366
views
madeeasytestseries
databases
superkeys
+2
votes
1
answer
13
TestBook Test Series: Databases  Super Keys
I think here even with Ph is removed from table we still get 12 Super keys. Because Salary & One of CK must be there.
asked
Jan 15, 2016
in
Databases
by
Akash Kanase
Boss
(
41.9k
points)

152
views
testbooktestseries
databases
databasenormalization
superkeys
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
Follow @csegate
Recent questions tagged superkeys
Recent Blog Comments
Very slim chances..FML
100 percent
I am getting 151 marks excluding question not...
everyone will be surprised seeing the cutoff this...
There is no point of any debate/discourse here....
50,737
questions
57,293
answers
198,233
comments
104,916
users