What is a super key in a relational database? MCQ with Answer and Explanation

Question

Share Report Error

What is a super key in a relational database?

A. A key that has extra attributes beyond a candidate key

B. A key that includes the primary key

C. Both A and B

D. A set of attributes that uniquely identifies a row

Answer: Option C

Solution (By JKSSB Mock Tests)

A super key is a set of one or more attributes that uniquely identifies a row. A candidate key is a minimal super key.

This question belongs to: Computer Database Management System (DBMS)

Request complete Subject PDF

Discuss this Question (0)

No comments yet. Be the first to start the discussion!

Practice More Database Management System (DBMS) Questions

Question #1

What is the difference between a clustered and a non-clustered index?

A. Clustered index determines physical order; non-clustered is a logical order

B. There is no difference

C. Non-clustered determines physical order; clustered is logical

D. They both determine physical order

View Answer & Solution Discuss

Get Complete Subject PDF for Computer

Correct Answer: Option A

Explanation:
A clustered index sorts the data rows and stores them in that order; a non-clustered index is a separate structure with pointers to data rows.

This question belongs to: Computer Database Management System (DBMS)

Question #2

The intentional process of introducing redundant data into a normalized database structure to optimize read query performance is called what?

A. Fragmentation

B. Denormalization

C. Decomposition

D. Normalization

View Answer & Solution Discuss

Get Complete Subject PDF for Computer

Correct Answer: Option B

Explanation:
Denormalization is a strategy applied to normalized databases where redundant data is selectively added to speed up complex read queries by minimizing costly table joins.

This question belongs to: Computer Database Management System (DBMS)

Question #3

Which normal form requires that all attributes in a table contain only atomic, indivisible values, and prohibits multi-valued attributes?

A. Second Normal Form (2NF)

B. Third Normal Form (3NF)

C. First Normal Form (1NF)

D. Boyce-Codd Normal Form (BCNF)

View Answer & Solution Discuss

Get Complete Subject PDF for Computer

Correct Answer: Option C

Explanation:
A relation is in First Normal Form (1NF) if and only if the domain of every attribute contains only atomic (indivisible) values, and no repeating groups exist.

This question belongs to: Computer Database Management System (DBMS)

Explore All Database Management System (DBMS) MCQs