MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
A function that has no partial functional dependencies is in _______ form : |
| A. | 3NF |
| B. | 2NF |
| C. | 4NF |
| D. | BCNF |
| Answer» C. 4NF | |
| 2. |
4NF is designed to cope with : |
| A. | Transitive dependency |
| B. | Join dependency |
| C. | Multi valued dependency |
| D. | None of these |
| Answer» D. None of these | |
| 3. |
5NF is designed to cope with : |
| A. | Transitive dependency |
| B. | Join dependency |
| C. | Multi valued dependency |
| D. | All of the above |
| Answer» C. Multi valued dependency | |
| 4. |
A BCNF is : |
| A. | Loss less join and dependency preserving |
| B. | Loss less join but not dependency preserving |
| C. | Not loss less join but dependency preserving |
| D. | None of these |
| Answer» C. Not loss less join but dependency preserving | |
| 5. |
Every Boyee-Codd normal form is in |
| A. | First normal form |
| B. | Second normal form |
| C. | Third normal form |
| D. | All of the above |
| Answer» E. | |
| 6. |
Designers use which of the following to tune performance of systems to support time-critical operations? |
| A. | Denormalization |
| B. | Redundant optimization |
| C. | Optimization |
| D. | Realization |
| Answer» B. Redundant optimization | |
| 7. |
In the schema (dept name, size) we have relations total inst 2007, total inst 2008 . Which dependency have lead to this relation ? |
| A. | Dept name, year->size |
| B. | Year->size |
| C. | Dept name->size |
| D. | Size->year |
| Answer» B. Year->size | |
| 8. |
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 |
| A. | Fourth NF |
| B. | BCNF |
| C. | Third NF |
| D. | Second NF |
| Answer» C. Third NF | |
| 9. |
A table has fields F1, F2, F3, F4, and F5, with the following functional dependencies:F1->F3F2->F4(F1,F2)->F5in terms of normalization, this table is in |
| A. | 1NF |
| B. | 2NF |
| C. | 3NF |
| D. | None of the mentioned |
| Answer» B. 2NF | |
| 10. |
Consider the following functional dependencies in a database. Date_of_Birth->Age Age->Eligibility Name->Roll_number Roll_number->Name Course_number->Course_name Course_number->Instructor (Roll_number, Course_number)->GradeThe relation (Roll_number, Name, Date_of_birth, Age) is |
| A. | In second normal form but not in third normal form |
| B. | In third normal form but not in BCNF |
| C. | In BCNF |
| D. | None of the mentioned |
| Answer» E. | |
| 11. |
The relation schema Student_Performance (name, courseNo, rollNo, grade) has the following FDs:name,courseNo->graderollNo,courseNo->gradename->rollNorollNo->nameThe highest normal form of this relation scheme is |
| A. | 2NF |
| B. | 3NF |
| C. | BCNF |
| D. | 4NF |
| Answer» C. BCNF | |
| 12. |
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 |
| A. | 1NF only |
| B. | 2NF and hence also in 1NF |
| C. | 3NF and hence also in 2NF and 1NF |
| D. | BCNF and hence also in 3NF, 2NF and 1NF |
| Answer» C. 3NF and hence also in 2NF and 1NF | |
| 13. |
Suppose relation R(A,B,C,D,E) has the following functional dependencies:A -> BB -> CBC -> AA -> DE -> AD -> EWhich of the following is not a key? |
| A. | A |
| B. | E |
| C. | B,C |
| D. | D |
| Answer» D. D | |
| 14. |
Which one of the following statements if FALSE? |
| A. | Any relation with two attributes is in BCNF |
| B. | A relation in which every key has only one attribute is in 2NF |
| C. | A prime attribute can be transitively dependent on a key in a 3 NF relation |
| D. | A prime attribute can be transitively dependent on a key in a BCNF relation |
| Answer» E. | |
| 15. |
What are the desirable properties of a decomposition ? |
| A. | Partition constraint |
| B. | Dependency preservation |
| C. | Redundancy |
| D. | Security |
| Answer» C. Redundancy | |
| 16. |
Which of the following is a tuple-generating dependencies ? |
| A. | Functional dependency |
| B. | Equality-generating dependencies |
| C. | Multivalued dependencies |
| D. | Non-functional dependency |
| Answer» D. Non-functional dependency | |
| 17. |
Which of the normal form is based on multivalued dependencies ? |
| A. | First |
| B. | Second |
| C. | Third |
| D. | Fourth |
| Answer» E. | |
| 18. |
In which of the following , a separate schema is created consisting of that attribute and the primary key of the entity set. |
| A. | A many-to-many relationship set |
| B. | A multivalued attribute of an entity set |
| C. | A one-to-many relationship set |
| D. | None of the mentioned |
| Answer» C. A one-to-many relationship set | |
| 19. |
Fifth Normal form is concerned with |
| A. | Functional dependency |
| B. | Multivalued dependency |
| C. | Join dependency |
| D. | Domain-key |
| Answer» D. Domain-key | |
| 20. |
In 2NF |
| A. | No functional dependencies (FDs) exist |
| B. | No multivalued dependencies (MVDs) exist |
| C. | No partial FDs exist |
| D. | No partial MVDs exist |
| Answer» D. No partial MVDs exist | |
| 21. |
Suppose the user finds the usage of room number and phone number in a relational schema there is confusion.This is reduced by |
| A. | Unique-role assumption |
| B. | Unique-key assignment |
| C. | Role intergral assignment |
| D. | None of the mentioned |
| Answer» B. Unique-key assignment | |
| 22. |
R (A,B,C,D) is a relation. Which of the following does not have a lossless join dependency preserving BCNF decomposition. |
| A. | A->B, B->CD |
| B. | A->B, B->C, C->D |
| C. | AB->C, C->AD |
| D. | A->BCD |
| Answer» E. | |
| 23. |
Consider the below conditions. Which of the following relation holds ? |
| A. | Course id-> title, dept name, credits |
| B. | Title-> dept name, credits |
| C. | Dept name-> credits |
| D. | Cannot be determined |
| Answer» B. Title-> dept name, credits | |
| 24. |
If every functional dependency in set E is also in the closure of F then this is classified as |
| A. | FD is covered by E |
| B. | E is covered by F |
| C. | F is covered by E |
| D. | Fplus is covered by E |
| Answer» C. F is covered by E | |
| 25. |
If there is more than one key for relation schema in DBMS then each key in relation schema is classified as |
| A. | Prime key |
| B. | Super key |
| C. | Candidate key |
| D. | Primary key |
| Answer» D. Primary key | |
| 26. |
The form of dependency in which the set of attributes that are neither a subset of any of the keys nor the candidate key is classified as |
| A. | Transitive dependency |
| B. | Full functional dependency |
| C. | Partial dependency |
| D. | Prime functional dependency |
| Answer» B. Full functional dependency | |
| 27. |
The property of normalization of relations which guarantees that functional dependencies are represented in separate relations after decomposition is classified as |
| A. | Nonadditive join property |
| B. | Independency reservation property |
| C. | Dependency preservation property |
| D. | Additive join property |
| Answer» D. Additive join property | |
| 28. |
The rule which states that addition of same attributes to the right side and left side will results in other valid dependency is classified as |
| A. | Referential rule |
| B. | Inferential rule |
| C. | Augmentation rule |
| D. | Reflexive rule |
| Answer» D. Reflexive rule | |
| 29. |
The functional dependency of two sets E and F are considered as equivalent if |
| A. | E + F = E - F |
| B. | E * = F 2 |
| C. | E 2 = F 2 |
| D. | E * = F * |
| Answer» E. | |
| 30. |
Considering the functional dependency, the one in which removal of some attributes does not affect dependency is called |
| A. | Full functional dependency |
| B. | Partial dependency |
| C. | Prime functional dependency |
| D. | Transitive dependency |
| Answer» C. Prime functional dependency | |
| 31. |
In the functional dependency between two sets of attributes A and B then the set of attributes A of database is classified as |
| A. | Top right side |
| B. | Down left side |
| C. | Left hand side |
| D. | Right hand side |
| Answer» D. Right hand side | |
| 32. |
The constraint between two different attributes sets is classified as |
| A. | Modification anomaly |
| B. | Functional dependency |
| C. | Insertion anomaly |
| D. | Deletion anomaly |
| Answer» C. Insertion anomaly | |
| 33. |
The joining property which guarantees that spurious tuple generation problem is not created after decomposition is called |
| A. | Lossless join property |
| B. | Nonadditive join property |
| C. | Additive join property |
| D. | Both a and b |
| Answer» E. | |
| 34. |
The normalization form which is based on the transitive dependency is classified as |
| A. | First normal form |
| B. | Second normal form |
| C. | Fourth normal form |
| D. | Third normal form |
| Answer» E. | |
| 35. |
Considering the functional dependency, the one in which removal from some attributes must affect dependency is called |
| A. | Full functional dependency |
| B. | Partial dependency |
| C. | Prime functional dependency |
| D. | Transitive dependency |
| Answer» B. Partial dependency | |
| 36. |
The concept in normalization of relations which is based on the full functional dependency is classified as |
| A. | Fourth normal form |
| B. | Third normal form |
| C. | First normal form |
| D. | Second normal form |
| Answer» E. | |
| 37. |
The normal form which only includes indivisible values or single atomic values is classified as |
| A. | Third normal form |
| B. | First normal form |
| C. | Second normal form |
| D. | Fourth normal form |
| Answer» C. Second normal form | |
| 38. |
In the tuples, the interpretation of the values of the attribute is considered as |
| A. | Commands of relation |
| B. | Clauses of relation |
| C. | Schemas of relation |
| D. | Semantics of relation |
| Answer» E. | |
| 39. |
The rule which states that set of attributes determines any of its subset is classified as |
| A. | Closure rule |
| B. | Reflexive rule |
| C. | Referential rule |
| D. | Inferential rule |
| Answer» C. Referential rule | |
| 40. |
The rule that always generate true dependencies is called |
| A. | Referential rule |
| B. | Inferential rule |
| C. | Closure rule |
| D. | Reflexive rule |
| Answer» E. | |
| 41. |
The process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as |
| A. | Normalization of data |
| B. | Denomination of data |
| C. | Isolation of data |
| D. | De-normalization of data |
| Answer» B. Denomination of data | |
| 42. |
Considering the relational database, the functional dependency between two attributes A and B is denoted by |
| A. | A B |
| B. | B A |
| C. | AB R |
| D. | R AB |
| Answer» B. B A | |
| 43. |
If the attribute of relation schema R is member of some candidate key then this type of attributes are classified as |
| A. | Atomic attribute |
| B. | Candidate attribute |
| C. | Nonprime attribute |
| D. | Prime attribute |
| Answer» E. | |
| 44. |
The procedure of storing higher normal form relations which are in lower normal form as a base relation is classified as |
| A. | Isolation of data |
| B. | De-normalization of data |
| C. | Normalization of data |
| D. | Denomination of data |
| Answer» C. Normalization of data | |
| 45. |
If the attribute of relation schema R is not a member of some candidate key then this type of attribute is classified as |
| A. | Nonprime attribute |
| B. | Prime attribute |
| C. | Atomic attribute |
| D. | Candidate attribute |
| Answer» B. Prime attribute | |
| 46. |
In the reflexive rule (IR1), the true dependencies generated are classified as |
| A. | Trivial |
| B. | Nontrivial |
| C. | Inferential |
| D. | Functional |
| Answer» B. Nontrivial | |
| 47. |
The extensions of relation that satisfy the constraint of functional dependency are considered as |
| A. | Legal extensions |
| B. | Semantic extensions |
| C. | State extension |
| D. | Relation extensions |
| Answer» B. Semantic extensions | |
| 48. |
In normalization of relations, the property which is critical and must be achieved is classified as |
| A. | Nonadditive join property |
| B. | Additive join property |
| C. | Independency reservation property |
| D. | Dependency preservation property |
| Answer» B. Additive join property | |
| 49. |
If each tuple have relation R within it then this type of relation is classified as |
| A. | Primary relation |
| B. | Prime relation |
| C. | Nested relation |
| D. | Atomic relation |
| Answer» D. Atomic relation | |
| 50. |
Which of the following is not a Armstrong s Axiom ? |
| A. | Reflexivity rule |
| B. | Transitivity rule |
| C. | Pseudotransitivity rule |
| D. | Augmentation rule |
| Answer» D. Augmentation rule | |