MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 73 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which transaction contains statements that access more than one node? |
| A. | A Remote Transaction |
| B. | A Distributed transaction |
| C. | Both A & B |
| D. | None of the above |
| Answer» C. Both A & B | |
| 2. |
What is the mechanism which guarantees that all database servers participating in a distributed transaction either all commit or all roll back the statements in the transaction? |
| A. | Commit |
| B. | Commit transaction |
| C. | Two-phase commit |
| D. | Three-phase commit |
| Answer» D. Three-phase commit | |
| 3. |
A distributed transaction can be ............. if queries are issued at one or more nodes. |
| A. | fully read-only |
| B. | partially read-only |
| C. | fully read-write |
| D. | partially read-write |
| Answer» C. fully read-write | |
| 4. |
Depending on the situation each node in the Distributed Database system can act as, _________ . |
| A. | A client |
| B. | A server |
| C. | Both A & B |
| D. | None of the above |
| Answer» D. None of the above | |
| 5. |
In relational database schemas, the state constraints are also known as |
| A. | static constraints |
| B. | dynamic constraints |
| C. | implicit constraints |
| D. | explicit constraints |
| Answer» B. dynamic constraints | |
| 6. |
The basic operations that can be performed on relations are |
| A. | deletion |
| B. | insertion |
| C. | modification |
| D. | all of above |
| Answer» E. | |
| 7. |
The definition of relation in which values and attributes are ordered in tuple is classified as |
| A. | fourth definition of relation |
| B. | third definition of relation |
| C. | first definition of relation |
| D. | second definition of relation |
| Answer» D. second definition of relation | |
| 8. |
A homogeneous distributed database is which of the following? |
| A. | The same DBMS is used at each location and data are not distributed across all nodes. |
| B. | The same DBMS is used at each location and data are distributed across all nodes. |
| C. | A different DBMS is used at each location and data are not distributed across all nodes. |
| D. | A different DBMS is used at each location and data are distributed across all nodes. |
| Answer» C. A different DBMS is used at each location and data are not distributed across all nodes. | |
| 9. |
The ______ is the one in which the primary key of one relation is used as a normal attribute in another relation . |
| A. | Referential relation |
| B. | Referencing relation |
| C. | Referenced relation |
| D. | Referred relation |
| Answer» D. Referred relation | |
| 10. |
Domain constraints, functional dependency and referential integrity are special forms of _________. |
| A. | Foreign key |
| B. | Primary key |
| C. | Assertion |
| D. | Referential constraint |
| Answer» D. Referential constraint | |
| 11. |
Key to represent relationship between tables is called |
| A. | Primary key |
| B. | Secondary Key |
| C. | Foreign Key |
| D. | None of these |
| Answer» D. None of these | |
| 12. |
The RDBMS terminology for a row is |
| A. | tuple |
| B. | relation |
| C. | attribute |
| D. | degree |
| Answer» B. relation | |
| 13. |
In a relational model, relations are termed as |
| A. | Tuples |
| B. | Attributes |
| C. | Rows |
| D. | Tables |
| Answer» E. | |
| 14. |
The multivalued dependencies used to develop relational design theory of database is classified as |
| A. | amortization |
| B. | normalization |
| C. | conceptualization |
| D. | depreciation |
| Answer» C. conceptualization | |
| 15. |
In the data model, the inherent constraints are classified as |
| A. | flat constraints |
| B. | parallel constraints |
| C. | explicit constraints |
| D. | implicit constraints |
| Answer» E. | |
| 16. |
In the relational models, cardinality is termed as: |
| A. | Number of tuples |
| B. | Number of attributes |
| C. | Number of table |
| D. | Number of constraints |
| Answer» B. Number of attributes | |
| 17. |
The relation with the attribute which is the primary key is referenced in another relation. The relation which has the attribute as primary key is called |
| A. | Referential relation |
| B. | Referencing relation |
| C. | Referenced relation |
| D. | Referred relation |
| Answer» C. Referenced relation | |
| 18. |
The type of constraint in which value of each attribute (X) must be an indivisible value from domain (X) is classified as |
| A. | explicit constraint |
| B. | implicit constraint |
| C. | domain constraint |
| D. | range constraint |
| Answer» D. range constraint | |
| 19. |
Which of the operations constitute a basic set of operations for manipulating relational data? |
| A. | Predicate calculus |
| B. | Relational calculus |
| C. | Relational algebra |
| D. | None of the above |
| Answer» D. None of the above | |
| 20. |
In relational model terminology, the table is considered as |
| A. | range |
| B. | domain |
| C. | relation |
| D. | tuple |
| Answer» D. tuple | |
| 21. |
The key which specifies that two different tuples cannot have the same value is classified as |
| A. | super key |
| B. | simple key |
| C. | parallel key |
| D. | conceptual key |
| Answer» B. simple key | |
| 22. |
The inclusion dependencies that are preceding are used to represent |
| A. | algorithmic constraint |
| B. | trivial constraint |
| C. | referential integrity constraint |
| D. | decomposition constraint |
| Answer» D. decomposition constraint | |
| 23. |
The normal form which consider all the types of constraints and dependencies is classified as |
| A. | domain-key normal form |
| B. | foreign-key normal form |
| C. | candidate-key normal form |
| D. | primary-key normal form |
| Answer» B. foreign-key normal form | |
| 24. |
The decomposition of one relation say R into two relations is classified as |
| A. | functional decomposition |
| B. | ternary decomposition |
| C. | binary decomposition |
| D. | ordinary decomposition |
| Answer» D. ordinary decomposition | |
| 25. |
The format or data type must be specified for |
| A. | table ender |
| B. | entity domain |
| C. | range |
| D. | domain |
| Answer» E. | |
| 26. |
In a relation schema, each key of schema having more than one key is classified as |
| A. | candidate key |
| B. | super key |
| C. | simple key |
| D. | parallel key |
| Answer» B. super key | |
| 27. |
The types of template dependencies are |
| A. | constraint generating templates |
| B. | tuple generating templates |
| C. | schema generating templates |
| D. | both a and b |
| Answer» E. | |
| 28. |
The constraints which deals with the changes in the database are classified as |
| A. | assertion constraints |
| B. | trigger constraints |
| C. | specified constraints |
| D. | transition constraints |
| Answer» E. | |
| 29. |
The model in which the multi-valued and composite attributes is considered as |
| A. | reverse relational model |
| B. | flat relational model |
| C. | parallel relational model |
| D. | circular relational model |
| Answer» C. parallel relational model | |
| 30. |
The conclusion of the template is a condition which must be held on tuples hypothesis in the template dependency called |
| A. | schema generating templates |
| B. | relation filtering template |
| C. | constraint generating templates |
| D. | tuple generating templates |
| Answer» D. tuple generating templates | |
| 31. |
In the data model schemas, the constraints that are can not be expressed directly are classified as |
| A. | application based constraints |
| B. | semantic constraints |
| C. | business rules |
| D. | all of above |
| Answer» E. | |
| 32. |
A _________ integrity constraint requires that the values appearing in specified attributes of any tuple in the referencing relation also appear in specified attributes of at least one tuple in the referenced relation. |
| A. | Referential |
| B. | Referencing |
| C. | Specific |
| D. | Primary |
| Answer» B. Referencing | |
| 33. |
A attribute in a relation is a foreign key if the _______ key from one relation is used as an attribute in that relation . |
| A. | Candidate |
| B. | Primary |
| C. | Super |
| D. | Sub |
| Answer» C. Super | |
| 34. |
The type of algorithm in which decomposition of relation schema is constructed from other specific set of functional dependencies is classified as |
| A. | relational synthesis algorithm |
| B. | decomposition algorithm |
| C. | schema synthesis algorithm |
| D. | none of above |
| Answer» B. decomposition algorithm | |
| 35. |
The cardinality in relational data model is considered as |
| A. | total number of values |
| B. | limited number of values |
| C. | two numbers from set |
| D. | three numbers from set |
| Answer» B. limited number of values | |
| 36. |
The other name of project-join normal form is |
| A. | join normal form |
| B. | trivial normal form |
| C. | sixth normal form |
| D. | fifth normal form |
| Answer» E. | |
| 37. |
The tuples in relation are sensitive to |
| A. | order |
| B. | format |
| C. | entity type |
| D. | concept type |
| Answer» B. format | |
| 38. |
The type of constraint which states that not even a single value with primary key can be a null value is classified as |
| A. | null integrity constraint |
| B. | primary integrity constraint |
| C. | secondary integrity constraint |
| D. | entity integrity constraint |
| Answer» E. | |
| 39. |
The tuples that are represented in one of two relations and are lost if the JOIN operation is performed are called |
| A. | functional tuples |
| B. | dangling tuples |
| C. | algorithm tuples |
| D. | decomposition tuples |
| Answer» C. algorithm tuples | |
| 40. |
In formal relational model, the set of indivisible values is called |
| A. | range |
| B. | domain |
| C. | relation |
| D. | tuple |
| Answer» C. relation | |
| 41. |
Which one of the following attribute can be taken as a primary key ? |
| A. | Name |
| B. | Street |
| C. | Id |
| D. | Department |
| Answer» D. Department | |
| 42. |
The template conclusion is a set of tuples that must be included in the relations in the template dependency called |
| A. | constraint generating templates |
| B. | tuple generating templates |
| C. | schema generating templates |
| D. | relation filtering template |
| Answer» C. schema generating templates | |
| 43. |
If two or more constraints are violated by using insert operation then by default the |
| A. | insert is accepted |
| B. | insert is rejected |
| C. | insertion permanently blocked |
| D. | none of above |
| Answer» C. insertion permanently blocked | |
| 44. |
The distribution in which each row denote some related values collection is classified as |
| A. | record |
| B. | entity |
| C. | concept |
| D. | table |
| Answer» E. | |
| 45. |
When the foreign key refers to a tuple which does not exists in subjected relation then the constraint violated is |
| A. | modify integrity |
| B. | referential integrity |
| C. | inferential integrity |
| D. | insert integrity |
| Answer» C. inferential integrity | |
| 46. |
The operation which violates only one constraint called referential integrity when it is performed is called |
| A. | New operation |
| B. | Modify operation |
| C. | Delete operation |
| D. | Insert operation |
| Answer» D. Insert operation | |
| 47. |
In the data model schemas, the constraints that are expressed directly are classified as |
| A. | explicit constraints |
| B. | implicit constraints |
| C. | flat constraints |
| D. | parallel constraints |
| Answer» B. implicit constraints | |
| 48. |
In relational database schemas, the transition constraints are also known as |
| A. | static constraints |
| B. | dynamic constraints |
| C. | implicit constraints |
| D. | explicit constraints |
| Answer» C. implicit constraints | |
| 49. |
The constraint violated when key value in tuple already exists in some other relation's tuple is called |
| A. | domain constraint |
| B. | attribute constraint |
| C. | key constraint |
| D. | lock constraint |
| Answer» D. lock constraint | |
| 50. |
The ordered list of all the n-values is classified as |
| A. | n-tuple |
| B. | l-tuple |
| C. | v-tuple |
| D. | all of above |
| Answer» E. | |