Skip to main content

10 Normal form identifying MCQ

10 multiple-choice questions related to identifying the normal form of a table based on given functional dependencies, useful for UGC NET, SET, GATE, ISRO, and other competitive exams. 

Question 1: 1NF Identification

Q1: A table with the following structure is given:

  • Attributes: {A, B, C}

  • Functional Dependencies: A → B, A → C

Does this table meet the requirements of 1NF?

  • A) Yes, because all attributes are atomic

  • B) No, because there are partial dependencies

  • C) Yes, because there are no repeating groups

  • D) No, because it violates 3NF

Answer: A) Yes, because all attributes are atomic

Explanation: A table is in 1NF if all its attributes contain atomic values and there are no repeating groups. The given table does not have any repeating groups or multi-valued attributes, so it satisfies the criteria of 1NF.

Question 2: 2NF Identification

Q2: A table with the following structure is given:

  • Attributes: {A, B, C}

  • Functional Dependencies: A → B, A → C

Is this table in 2NF?

  • A) Yes, because there are no partial dependencies

  • B) No, because it violates 1NF

  • C) Yes, because it is in 1NF and has no partial dependencies

  • D) No, because there are transitive dependencies

Answer: C) Yes, because it is in 1NF and has no partial dependencies

Explanation: A table is in 2NF if it is in 1NF and has no partial dependencies. Since A is the only key in this table, there cannot be any partial dependencies (which occur when a non-key attribute depends on part of a composite key). Thus, this table is in 2NF.

Question 3: 3NF Identification

Q3: A table with the following structure is given:

  • Attributes: {A, B, C}

  • Functional Dependencies: A → B, B → C

Is this table in 3NF?

  • A) Yes, because there are no partial dependencies

  • B) No, because there are transitive dependencies

  • C) Yes, because it is in 2NF

  • D) No, because it violates 1NF

Answer: B) No, because there are transitive dependencies

Explanation: A table is in 3NF if it is in 2NF and does not have transitive dependencies. Here, A → B and B → C imply that A → C indirectly through B. Since C is not fully dependent on A directly, this is a transitive dependency, violating 3NF.

Question 4: BCNF Identification

Q4: A table with the following structure is given:

  • Attributes: {A, B, C, D}

  • Functional Dependencies: AB → C, C → D

Is this table in BCNF?

  • A) Yes, because every determinant is a candidate key

  • B) No, because there are partial dependencies

  • C) No, because C is not a candidate key

  • D) Yes, because it is in 3NF

Answer: C) No, because C is not a candidate key

Explanation: A table is in BCNF if it is in 3NF and every determinant (an attribute that functionally determines other attributes) is a candidate key. Since C → D and C is not a candidate key, this table is not in BCNF.

Question 5: 4NF Identification

Q5: A table with the following structure is given:

  • Attributes: {A, B, C}

  • Functional Dependencies: A → B, A → C, B ↔ C

Is this table in 4NF?

  • A) Yes, because there are no multi-valued dependencies

  • B) No, because it is not in BCNF

  • C) No, because B ↔ C is a multi-valued dependency

  • D) Yes, because it is in BCNF

Answer: C) No, because B ↔ C is a multi-valued dependency

Explanation: A table is in 4NF if it is in BCNF and has no multi-valued dependencies (MVDs). Since B ↔ C indicates a multi-valued dependency, the table is not in 4NF.

Question 6: Partial Dependency Identification

Q6: A table with the following structure is given:

  • Attributes: {A, B, C, D}

  • Functional Dependencies: AB → C, A → D

Is there a partial dependency in this table?

  • A) Yes, because A → D

  • B) No, because AB → C

  • C) Yes, because AB is a composite key

  • D) No, because A is a candidate key

Answer: A) Yes, because A → D

Explanation: A partial dependency occurs when a non-key attribute depends on only a part of a composite primary key. Here, A → D means D depends only on A (not AB), which is a partial dependency.

Question 7: Transitive Dependency Identification

Q7: A table with the following structure is given:

  • Attributes: {A, B, C}

  • Functional Dependencies: A → B, B → C

Is there a transitive dependency in this table?

  • A) Yes, because A → B and B → C

  • B) No, because A → B

  • C) Yes, because A is the primary key

  • D) No, because there are no partial dependencies

Answer: A) Yes, because A → B and B → C

Explanation: A transitive dependency occurs when A → B and B → C implies A → C indirectly. This is a violation of 3NF.

Question 8: Candidate Key Identification

Q8: A table with the following structure is given:

  • Attributes: {A, B, C, D}

  • Functional Dependencies: AB → C, AB → D

Which of the following is a candidate key?

  • A) A

  • B) B

  • C) AB

  • D) CD

Answer: C) AB

Explanation: A candidate key is a minimal key that determines all attributes. Here, AB determines C and D, so AB is the candidate key.

Question 9: 2NF Violation Identification

Q9: A table with the following structure is given:

  • Attributes: {A, B, C}

  • Functional Dependencies: AB → C, A → B

Why is this table not in 2NF?

  • A) It is in 2NF

  • B) Because of partial dependency A → B

  • C) Because of transitive dependency AB → C

  • D) Because it is in 3NF

Answer: B) Because of partial dependency A → B

Explanation: Since A → B exists and AB is the primary key, this is a partial dependency (B depends on part of a composite key), violating 2NF.

Question 10: Normal Form Classification

Q10: A table with the following structure is given:

  • Attributes: {A, B, C, D}

  • Functional Dependencies: A → B, C → D, A → C, B → D

In which normal form is this table?

  • A) 1NF

  • B) 2NF

  • C) 3NF

  • D) BCNF

Answer: D) BCNF

Explanation: Since all determinants (A, C, B) are candidate keys, this table satisfies BCNF.


Labels:

Comments

Post a Comment

Popular posts from this blog

Top 5 Safe Chat Apps for Kids with Parental Controls

Now a days kids are growing up with technology at their fingertips. While communication apps help children stay connected with family and friends, safety remains a top concern for parents. Unregulated platforms can expose children to inappropriate content, online predators, and cyberbullying. That’s why choosing a kid-friendly chat app with parental controls is essential. To help parents find the best options, we’ve compiled a list of the top five safest chat apps for kids that offer safe and controlled environment. 1. Messenger Kids (By Meta) Best for: Safe video calls and text messaging with parental supervision Features: Parents approve all contacts No ads or in-app purchases Fun filters, stickers, and games Monitored messaging and activity reports Why It’s Safe: Messenger Kids is designed for children under 13 and requires parental approval for every contact. Parents can monitor chats and control screen time through the Parent Dashboard. Download Messenger Kids 2...
Post a Comment
Read more

10 Distance Vector and Link-State Routing MCQ

  10 multiple-choice questions  on  Distance Vector and Link-State Routing with explanations, useful for  UGC NET, SET, GATE, ISRO, and other competitive exams . Question 1: Basic Concept of Distance Vector Routing Q1: In a distance vector routing protocol, how do routers share routing information? A) By flooding the entire network with routing updates B) By periodically exchanging routing tables with their immediate neighbors C) By using a link-state database to determine the shortest path D) By dynamically updating paths based on link failure reports Answer: B) By periodically exchanging routing tables with their immediate neighbors Explanation: In Distance Vector Routing, routers share their routing tables with neighbors at regular intervals, leading to a simple but slow convergence mechanism. Question 2: Example of Distance Vector Routing Protocol Q2: Which of the following is an example of a Distance Vector routing protocol? A) OSPF ...
Post a Comment
Read more

10 Routing Protocol MCQ

10 multiple-choice questions on Routing protocol s  with explanations, useful for UGC NET, SET, GATE, ISRO, and other competitive exams . Question 1: Purpose of Routing Protocols Q1: What is the primary purpose of a routing protocol? A) To assign IP addresses to devices B) To determine the best path for data packets to reach their destination C) To encrypt data during transmission D) To physically connect different networks Answer: B) To determine the best path for data packets to reach their destination Explanation: Routing protocols help routers determine the most efficient path for data transmission across a network, ensuring fast and reliable communication. Question 2: Classification of Routing Protocols Q2: Routing protocols can be broadly classified into which two main categories? A) TCP and UDP B) Distance Vector and Link-State C) IPv4 and IPv6 D) Static and Dynamic Answer: B) Distance Vector and Link-State Explanation: Routing prot...
Post a Comment
Read more