Given the following relation it is not 3 NF because Student (roll no, name, course no, course max. marks, year of study, address)

Related MCQs

• Given the following relation Student (roll no, name, course no, course max. marks, year of study, address) The corresponding 3 NF relations are
• Given the relation Supplier(s_id, p_order, s_name, qty) Given that there is a unique s_name for each s_id and that s_id, p_order is a composite key, find the correct statement among the following: i. this relation is a BCNF ii. this is 3 NF relation iii. this is a 2 NF relation iv. this is a 1 NF relation
• A relation project guidance Project Guidance(professor, project, student no. st-name, dept) A professor can give many projects to many students A project will have many students A project may be guided by many professors The 4 NF relation corresponding to this are
• Relation dept year(dept name, total inst 2007, total inst 2008, total inst 2009). Here the only functional dependencies are from dept name to the other attributes. This relation is in
• Relation dept year(dept name, total inst 2007, total inst 2008, total inst 2009). Here the only functional dependencies are from dept name to the other attributes. This relation is in
• The relation EMPDT1 is defined with attributes empcode(unique), name, street, city, state, and pincode. For any pincode, there is only one city and state. Also, for any given street, city and state, there is just one pincode. In normalization terms EMPDT1 is a relation in
• Inst_dept (ID, name, salary, dept name, building, budget) is decomposed into instructor (ID, name, dept name, salary) department (dept name, building, budget) This comes under
• An attribute in a relation is a foreign key if the                key from one relation is used as an attribute in that relation.
• 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                  on an attribute of a relation is a data structure that allows the database system to find those tuples in the relation that have a specified value for that attribute efficiently, without scanning through all the tuples of the relation.