Question:
Which of the following statements about a relation \( R \) in first normal form (1NF) is/are TRUE?
Which of the following statements about a relation \( R \) in first normal form (1NF) is/are TRUE?
Show Hint
In 1NF, atomicity of attributes is essential. Composite attributes are not allowed, but multi-attribute keys and foreign keys are permitted.
Updated On: Jan 22, 2025
- \( R \) can have a multi-attribute key
- \( R \) cannot have a foreign key
- \( R \) cannot have a composite attribute
- \( R \) cannot have more than one candidate key
Hide Solution
Verified By Collegedunia
The Correct Option is A
Solution and Explanation
Step 1: Analyze the statements.
1. \( R \) can have a multi-attribute key: Multi-attribute keys are allowed in 1NF as long as the attributes are atomic. This statement is true.
2. \( R \) cannot have a foreign key: This statement is false. Foreign keys are allowed in 1NF as they maintain referential integrity.
3. \( R \) cannot have a composite attribute: In 1NF, attributes must store atomic values, so composite attributes are not allowed. This statement is true.
4. \( R \) cannot have more than one candidate key: A relation in 1NF can have multiple candidate keys. This statement is false. Final Answer: \[ \boxed{\text{(1) and (3)}} \]
1. \( R \) can have a multi-attribute key: Multi-attribute keys are allowed in 1NF as long as the attributes are atomic. This statement is true.
2. \( R \) cannot have a foreign key: This statement is false. Foreign keys are allowed in 1NF as they maintain referential integrity.
3. \( R \) cannot have a composite attribute: In 1NF, attributes must store atomic values, so composite attributes are not allowed. This statement is true.
4. \( R \) cannot have more than one candidate key: A relation in 1NF can have multiple candidate keys. This statement is false. Final Answer: \[ \boxed{\text{(1) and (3)}} \]
Was this answer helpful?
0
0
Top Questions on Time and Work
- A and B can complete a task in the ratio 3:2. If together they complete the task in 20 days, how long will A alone take?
- CUET (UG) - 2025
- General Aptitude
- Time and Work
- A can complete a job in 12 days and B in 15 days. They work together for 5 days, and then A leaves. How many more days will B take to finish the remaining work?
- CUET (UG) - 2025
- General Aptitude
- Time and Work
- A can draw 10 illustrations in 5 days. B is three times as productive in twice the amount of time (in comparison to A). How many illustrations can B draw in a day?
- NPAT - 2025
- Quantitative Aptitude
- Time and Work
- If Sally can paint a house in 4 hours, and John can paint the same house in 6 hour, how long will it take for both of them to paint the house together?
- GMAT - 2025
- Quantitative Aptitude
- Time and Work
- A house is built by 20 workers in 30 days. How many workers will be needed to complete the work in 15 days?
- GMAT - 2025
- Quantitative Aptitude
- Time and Work
View More Questions
Questions Asked in GATE CS exam
Consider the following hierarchical cache system with the following access times:
\[ \begin{array}{|c|c|c|} \hline \textbf{Cache Level} & \textbf{Hit Rate} & \textbf{Access Time} \\ \hline L1 & 90\% & 1 \text{ ns} \\ L2 & 80\% & 10 \text{ ns} \\ L3 & 100\% & 100 \text{ ns} \\ \hline \end{array} \]Find \( T_{avg} \) for hierarchical or simultaneous access.
In the diagram, the lines QR and ST are parallel to each other. The shortest distance between these two lines is half the shortest distance between the point P and the line QR. What is the ratio of the area of the triangle PST to the area of the trapezium SQRT?
Note: The figure shown is representative
- GATE CS - 2025
- Geometry
- In a double hashing scheme, \( h_1(k) = k \mod 11 \) and \( h_2(k) = 1 + (k \mod 7) \) are the auxiliary hash functions. The size \( m \) of the hash table is 11. The hash function for the \( i \)-th probe in the open address table is \( [h_1(k) + i \cdot h_2(k)] \mod m \). The following keys are inserted in the given order: 63, 50, 25, 79, 67, 24. The slot at which key 24 gets stored is:
- GATE CS - 2025
- Programming and Data Structures
- A fair six-faced dice, with the faces labelled ‘1’, ‘2’, ‘3’, ‘4’, ‘5’, and ‘6’, is rolled thrice. What is the probability of rolling ‘6’ exactly once?
- GATE CS - 2025
- Probability
- A shop has 4 distinct flavors of ice-cream. One can purchase any number of scoops of any flavor. The order in which the scoops are purchased is inconsequential. If one wants to purchase 3 scoops of ice-cream, in how many ways can one make that purchase?
- GATE CS - 2025
- Permutations and Combinations
View More Questions