Home > Computer Engineering > Quizzes > Database Management Systems: Relational Database Design
Database Management Systems: Relational Database Design
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 33% Most missed: “Suppose we wish to find the ID's of the employees that are managed by people who…”
Database Management Systems: Relational Database Design
Time left 00:00
20 Questions

1. For any Pincode, there is only one city and state. Also, forgiven street, city and state, there is just one Pincode. In normalization terms, empdt1 is a relation in
2. 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: SELECT ee.empIDFROMEmps ee, Emps ffWHERE ee.mgrID = ff.empID AND ff.mgrID = 123;SELECT empIDFROM 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?
3. Which forms has a relation that possesses data about an individual entity:
4. 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: Intersect S;Then which of the following is the most restrictive, correct condition on the value of m?
5. 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: t;i>SELECT *FROM R NATURAL OUTER JOIN S; IS:
6. Which is a bottom-up approach to database design that design by examining the relationship between attributes:
7. Which-one ofthe following statements about normal forms is FALSE?
8. There are two functional dependencies with the same set of attributes on the left side of the arrow: >BC - >B. This can be combined as
9. We can use the following three rules to find logically implied functional dependencies. This collection of rules is called
10. Consider a relation R(A,B,C,D,E) with the following functional dependencies: C -> DE and > AB. The number of superkeys of R is:
11. In the __________ normal form, a composite attribute is converted to individual attributes.
12. Suppose relation R(A,B,C,D,E) has the following functional dependencies: > B> C -> A> D> A> EWhich of the following is not a key?
13. Functional Dependencies are the types of constraints that are based on______
14. Which of the following is not Armstrong'
15. Which forms are based on the concept of functional dependency:
16. Tables in second normal form (2NF):
17. 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
18. A table on the many side of a one to many or many to many relationship must:
19. 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
20. Which forms simplifies and ensures that there are minimal data aggregates and repetitive groups: