Question
a.
Be in Second Normal Form (2NF)
b.
Be in Third Normal Form (3NF)
c.
Have a single attribute key
d.
Have a composite key
Posted under DBMS
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. A table on the many side of a one to many or many to many relationship must:
Similar Questions
Discover Related MCQs
Q. Tables in second normal form (2NF):
View solution
Q. Which-one ofthe following statements about normal forms is FALSE?
View solution
Q. Functional Dependencies are the types of constraints that are based on______
View solution
Q. Which is a bottom-up approach to database design that design by examining the relationship between attributes:
View solution
Q. Which forms simplifies and ensures that there is minimal data aggregates and repetitive groups:
View solution
Q. Which forms has a relation that possesses data about an individual entity:
View solution
Q. Which forms are based on the concept of functional dependency:
View solution
Q. Empdt1(empcode, name, street, city, state,pincode).
For any pincode, there is only one city and state. Also, for given street, city and state, there is just one pincode. In normalization terms, empdt1 is a relation in
View solution
Q. We can use the following three rules to find logically implied functional dependencies. This collection of rules is called
View solution
Q. Which of the following is not a Armstrong’s Axiom ?
View solution
Q. The relation employee(ID,name,street,Credit,street,city,salary) is decomposed into
employee1 (ID, name)
employee2 (name, street, city, salary)
This type of decomposition is called
View solution
Q. 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
View solution
Q. There are two functional dependencies with the same set of attributes on the left side of the arrow:
A->BC
A->B
This can be combined as
View solution
Q. Consider a relation R(A,B,C,D,E) with the following functional dependencies:
ABC -> DE and
D -> AB
The number of superkeys of R is:
View solution
Q. Suppose we wish to find the ID’s of the employees that are managed by people who are managed by the employee with ID 123. Here are two possible queries:
I.SELECT ee.empID
FROM Emps ee, Emps ff
WHERE ee.mgrID = ff.empID AND ff.mgrID = 123;
II.SELECT empID
FROM Emps
WHERE mgrID IN
(SELECT empID FROM Emps WHERE mgrID = 123);
Which, if any, of the two queries above will correctly (in SQL2) get the desired set of employee ID’s?
View solution
Q. Suppose relation R(A,B) currently has tuples {(1,2), (1,3), (3,4)} and relation S(B,C) currently has {(2,5), (4,6), (7,8)}. Then the number of tuples in the result of the SQL query:
SELECT *
FROM R NATURAL OUTER JOIN S;
View solution
Q. Suppose now that R(A,B) and S(A,B) are two relations with r and s tuples, respectively (again, not necessarily distinct). If m is the number of (not necessarily distinct) tuples in the result of the SQL query:
R intersect S;
Then which of the following is the most restrictive, correct condition on the value of m?
View solution
Q. Suppose relation R(A,B,C,D,E) has the following functional dependencies:
A -> B
B -> C
BC -> A
A -> D
E -> A
D -> E
Which of the following is not a key?
View solution
Q. The normal form which satisfies multivalued dependencies and which is in BCNF is
View solution
Q. Which of the following is a tuple-generating dependencies ?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond DBMS? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!