The subset of a super key is a candidate key under what condition?(a) No proper subset is a super key(b) All subsets are super keys(c) Subset is a super key(d) Each subset is a super keyThis question was posed to me in an internship interview.My doubt is from Keys topic in portion The Relational Model of Database Management

The subset of a super key is a candidate key under what condition?(a)

1.	The subset of a super key is a candidate key under what condition?(a) No proper subset is a super key(b) All subsets are super keys(c) Subset is a super key(d) Each subset is a super keyThis question was posed to me in an internship interview.My doubt is from Keys topic in portion The Relational Model of Database Management
Answer» The CORRECT answer is (a) No PROPER subset is a SUPER key Explanation: The subset of a SET cannot be the same set. Candidate key is a set from a super key which cannot be the whole of the super set.

Discussion

No Comment Found

Related InterviewSolutions

A relational database consists of a collection of(a) Tables(b) Fields(c) Records(d) KeysThis question was posed to me in a job interview.Question is from Relational Database and Database Schema topic in division The Relational Model of Database Management
The most commonly used operation in relational algebra for projecting a set of tuple from a relation is(a) Join(b) Projection(c) Select(d) UnionThe question was asked in an interview for internship.My query is from Relational Query Operations and Relational Operators topic in section The Relational Model of Database Management
A ________ in a table represents a relationship among a set of values.(a) Column(b) Key(c) Row(d) EntryI have been asked this question in an online quiz.Question is taken from Relational Database and Database Schema topic in division The Relational Model of Database Management
The relation with the attribute which is the primary key is referenced in another relation. The relation which has the attribute as a primary key is called ______________(a) Referential relation(b) Referencing relation(c) Referenced relation(d) Referred relationThe question was posed to me in class test.Asked question is from Keys in division The Relational Model of Database Management
The result which operation contains all pairs of tuples from the two relations, regardless of whether their attribute values match.(a) Join(b) Cartesian product(c) Intersection(d) Set differenceThis question was posed to me in final exam.I'd like to ask this question from Relational Query Operations and Relational Operators in chapter The Relational Model of Database Management
Using which language can a user request information from a database?(a) Query(b) Relational(c) Structural(d) CompilerI have been asked this question during an interview.Asked question is from Relational Query Operations and Relational Operators topic in division The Relational Model of Database Management
The term _______ is used to refer to a row.(a) Attribute(b) Tuple(c) Field(d) InstanceI got this question during an online interview.The above asked question is from Relational Database and Database Schema in chapter The Relational Model of Database Management
Which one of the following attribute can be taken as a primary key?(a) Name(b) Street(c) Id(d) DepartmentI have been asked this question during an interview.I would like to ask this question from Keys in chapter The Relational Model of Database Management
The term attribute refers to a ___________ of a table.(a) Record(b) Column(c) Tuple(d) KeyI had been asked this question at a job interview.Question is taken from Relational Database and Database Schema in division The Relational Model of Database Management
The _______operation performs a set union of two “similarly structured” tables(a) Union(b) Join(c) Product(d) IntersectI got this question in an interview.Asked question is from Relational Query Operations and Relational Operators topic in division The Relational Model of Database Management

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment