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. |
In unary relational operations, SELECT operation is partition of relation usually classified as |
| A. | Horizontal partition |
| B. | Vertical partition |
| C. | Insert partition |
| D. | Delete partition |
| Answer» B. Vertical partition | |
| 2. |
If in JOIN operation, conditions of JOIN operation are not satisfied then results of operation is |
| A. | Zero tuples and empty relation |
| B. | One tuple from one relation |
| C. | Zero tuples from two relation |
| D. | Two tuples from empty relations |
| Answer» B. One tuple from one relation | |
| 3. |
Because of calculus expression, relational calculus is considered as |
| A. | Procedural language |
| B. | Non procedural language |
| C. | Structural language |
| D. | Functional language |
| Answer» C. Structural language | |
| 4. |
DIVISION operation can be applied to two relations A and B such as R(A) R(B) where as |
| A. | A does not belong to B |
| B. | A must be added to B |
| C. | A belongs or equal to B |
| D. | A must be subtracted from B |
| Answer» D. A must be subtracted from B | |
| 5. |
In EQUIJOIN condition, operation which is used to avoid superfluous attribute is classified as |
| A. | ALPHA JOIN |
| B. | NATURAL JOIN |
| C. | UNNATURAL JOIN |
| D. | THETA JOIN |
| Answer» C. UNNATURAL JOIN | |
| 6. |
Boolean expression used in SELECT operation consists of clauses such as |
| A. | Attribute name |
| B. | Constant value |
| C. | Comparison operators |
| D. | All of above |
| Answer» E. | |
| 7. |
Types of binary operations includes |
| A. | Union |
| B. | Intersection |
| C. | Set difference |
| D. | All of above |
| Answer» E. | |
| 8. |
In unary relational operations, PROJECT operation is partition of relation usually classified as |
| A. | Horizontal partition |
| B. | Vertical partition |
| C. | Insert partition |
| D. | Delete partition |
| Answer» C. Insert partition | |
| 9. |
JOIN operation in which two attributes joined have same name in both relations is classified as |
| A. | UNNATURAL JOIN |
| B. | THETA JOIN |
| C. | ALPHA JOIN |
| D. | NATURAL JOIN |
| Answer» E. | |
| 10. |
Consider two tuples A and B, operation whose result includes tuples that are included in both relations is classified as |
| A. | Intersection of relation A and B |
| B. | Difference of relation A and B |
| C. | Square of relation A and B |
| D. | Union of relation A and B |
| Answer» B. Difference of relation A and B | |
| 11. |
Operation which is used to select subset of tuples by satisfying selection constraint and selection is made from relation is classified as |
| A. | CHOOSE operation |
| B. | SELECT operation |
| C. | NON-SELECT operation |
| D. | SUBSET operation |
| Answer» C. NON-SELECT operation | |
| 12. |
Value of atom which evaluates either condition is TRUE or FALSE for particular combination of tuples is classified as |
| A. | Intersection value |
| B. | Union value |
| C. | Truth value |
| D. | Deny value |
| Answer» D. Deny value | |
| 13. |
Representation of relational calculus internal queries is classified as |
| A. | Structural graph |
| B. | Nodes graph |
| C. | Query graph |
| D. | Functional graph |
| Answer» D. Functional graph | |
| 14. |
If matching tuples are not found, kind of OUTER JOIN operation which keeps all tuples of second relation out of two relations is classified as |
| A. | UPWARD JOIN |
| B. | DOWNWARD JOIN |
| C. | LEFT OUTER JOIN |
| D. | RIGHT OUTER JOIN |
| Answer» E. | |
| 15. |
If matching tuples are not found, kind of OUTER JOIN operation which keeps all tuples of first relation out of two relations is classified as |
| A. | LEFT OUTER JOIN |
| B. | RIGHT OUTER JOIN |
| C. | UPWARD JOIN |
| D. | DOWNWARD JOIN |
| Answer» B. RIGHT OUTER JOIN | |
| 16. |
Operation which only selects some of columns from table and neglect remaining columns is classified as |
| A. | OR operation |
| B. | AND operation |
| C. | TABLE operation |
| D. | PROJECT operation |
| Answer» E. | |
| 17. |
Operator which is useful for a single relation is classified as |
| A. | Comparative operator |
| B. | Unary operator |
| C. | Ternary operator |
| D. | Functional clause operator |
| Answer» C. Ternary operator | |
| 18. |
Types of quantifiers are |
| A. | Universal quantifier |
| B. | Existential quantifier |
| C. | Local quantifier |
| D. | Both a and b |
| Answer» E. | |
| 19. |
Single relational algebra expression can be used in sequence of operations by |
| A. | Nesting entities |
| B. | Nesting the attribute |
| C. | Nesting the operations |
| D. | Nesting the elements |
| Answer» D. Nesting the elements | |
| 20. |
In relational calculus, expression which guarantees finite number of tuples is classified as |
| A. | Declarative expression |
| B. | Stable expression |
| C. | Unsafe expression |
| D. | Safe expression |
| Answer» E. | |
| 21. |
Data structure in form of tree to correspond to relational algebra expression is classified as |
| A. | Relation tree |
| B. | Attribute tree |
| C. | Entity tree |
| D. | Query tree |
| Answer» E. | |
| 22. |
In unary relational operations, symbols such as equal to, less than and greater than are classified as |
| A. | Tuple operators |
| B. | Column operators |
| C. | Comparison operators |
| D. | Row operators |
| Answer» D. Row operators | |
| 23. |
JOIN operation which uses any of comparison operators is classified as |
| A. | THETA JOIN |
| B. | CHI-JOIN |
| C. | PI-JOIN |
| D. | SIGMA-JOIN |
| Answer» B. CHI-JOIN | |
| 24. |
Kind of operation by which one tuple can be created with help of combining tuples from two relations is classified as |
| A. | Square operation |
| B. | Join operation |
| C. | Division operation |
| D. | Relation operation |
| Answer» C. Division operation | |
| 25. |
Consider two tuples X and Y, operation whose result includes tuples that are only in X but not in Y is classified as |
| A. | Square of relation X and Y |
| B. | Union of relation X and Y |
| C. | Intersection of relation X and Y |
| D. | Difference of relation X and Y |
| Answer» E. | |
| 26. |
As compared to Cartesian product, tuples which appears in result by applying JOIN are ones |
| A. | That fulfills the condition |
| B. | That does not fulfill the condition |
| C. | That are nested |
| D. | That are subtracted |
| Answer» B. That does not fulfill the condition | |
| 27. |
Consider two tuples R and S, maximum size of R and S relations is divided to expected size of join is classified as |
| A. | Equi join selectivity |
| B. | Natural selectivity |
| C. | Join selectivity |
| D. | Theta selectivity |
| Answer» D. Theta selectivity | |
| 28. |
In notation for query trees, node which is used to terminate execution is classified as |
| A. | Attribute nodes |
| B. | Leaf nodes |
| C. | Stem nodes |
| D. | Root nodes |
| Answer» E. | |
| 29. |
Expression used in relational calculus to specify request of retrieval is classified as |
| A. | Declarative expression |
| B. | Procedural expression |
| C. | Structural expression |
| D. | Functional expression |
| Answer» B. Procedural expression | |
| 30. |
Compatibility condition which states that relations for union and intersection operations must consist of same type of tuples is classified as |
| A. | Union compatibility |
| B. | Intersect compatibility |
| C. | Row compatibility |
| D. | Column compatibility |
| Answer» B. Intersect compatibility | |
| 31. |
If common attributes of two relations are classified as join attributes then OUTER UNION must be equal to |
| A. | LEFT OUTER JOIN |
| B. | FULL OUTER JOIN |
| C. | HALF OUTER JOIN |
| D. | DOWNWARD JOIN |
| Answer» C. HALF OUTER JOIN | |
| 32. |
Degree of PROJECT operation is equal to |
| A. | Number of entities |
| B. | Number of attributes |
| C. | Number of columns |
| D. | Number of rows |
| Answer» C. Number of columns | |
| 33. |
Operations used to combine multiple relations to present information in single table are classified as |
| A. | Outer relations |
| B. | Inner joins |
| C. | Outer joins |
| D. | Inner relations |
| Answer» C. Outer joins | |
| 34. |
In notation for query graphs, single circles are used to represent |
| A. | Relation nodes |
| B. | Query nodes |
| C. | Truth nodes |
| D. | Local nodes |
| Answer» B. Query nodes | |
| 35. |
JOIN operation in which only equality operator is used is classified as |
| A. | CHI-JOIN |
| B. | PI-JOIN |
| C. | SIGMA-JOIN |
| D. | EQUI JOIN |
| Answer» E. | |
| 36. |
In relational calculus, expression which does not guarantees finite number of tuples is classified as |
| A. | Unsafe expression |
| B. | Safe expression |
| C. | Declarative expression |
| D. | Stable expression |
| Answer» B. Safe expression | |
| 37. |
Types of relational calculi includes |
| A. | Domain calculus |
| B. | Nodes calculus |
| C. | Tuple calculus |
| D. | Both a and c |
| Answer» E. | |
| 38. |
In notation for query graphs, double ovals or circles are used to represent |
| A. | Non-declarative nodes |
| B. | Constant nodes |
| C. | Stable nodes |
| D. | Declarative nodes |
| Answer» C. Stable nodes | |
| 39. |
Operation which allows to process relationships from multiple relations rather than single relation is classified as |
| A. | Division operation |
| B. | Relation operation |
| C. | Square operation |
| D. | Join operation |
| Answer» E. | |
| 40. |
Branch of calculus which is based on mathematical logic is classified as |
| A. | Universal calculus |
| B. | Predicate calculus |
| C. | Indicate calculus |
| D. | Local calculus |
| Answer» C. Indicate calculus | |
| 41. |
In a query tree, operations of relational algebra are classified as |
| A. | Internal nodes |
| B. | External nodes |
| C. | Theta nodes |
| D. | Entity nodes |
| Answer» E. | |
| 42. |
Operation which is used to take union of tuples from relations that are not union compatible is classified as |
| A. | FULL UNION operation |
| B. | JOIN UNION operation |
| C. | OUTER UNION operation |
| D. | INNER UNION operation |
| Answer» D. INNER UNION operation | |
| 43. |
If matching tuples are not found, kind of OUTER JOIN operation which keeps all tuples of first and second relation is classified as |
| A. | LEFT OUTER JOIN |
| B. | FULL OUTER JOIN |
| C. | HALF OUTER JOIN |
| D. | DOWNWARD JOIN |
| Answer» C. HALF OUTER JOIN | |
| 44. |
Operations which are used to enhance power of expression of relational algebra includes |
| A. | Generalized projection |
| B. | Recursive closure operations |
| C. | Outer JOIN operations |
| D. | All of above |
| Answer» E. | |
| 45. |
In relational calculus, variables are bounded with help of |
| A. | Non-identifiers |
| B. | Non-quantifiers |
| C. | Quantifiers |
| D. | Identifiers |
| Answer» D. Identifiers | |
| 46. |
If duplicate relations will not be eliminated, resultant tuples will be multiset of tuples rather than |
| A. | Set of tuples |
| B. | Set of entities |
| C. | Set of attributes |
| D. | Set of string characters |
| Answer» B. Set of entities | |
| 47. |
SELECT operation is performed on |
| A. | Tuples of relation |
| B. | Attribute of table |
| C. | Entity of DBMS |
| D. | Columns of table |
| Answer» B. Attribute of table | |
| 48. |
Selection condition of SELECT operator is considered as |
| A. | Column expression |
| B. | Row expression |
| C. | String expression |
| D. | Boolean expression |
| Answer» E. | |
| 49. |
Type of JOIN operation through which one can keep all tuples in relations without considering corresponding tuples in any other relation is classified as |
| A. | Stem join |
| B. | Leaf join |
| C. | Outer join |
| D. | Inner join |
| Answer» D. Inner join | |
| 50. |
Process in which tuple is created by having combined attributes from two relations is classified as |
| A. | Cartesian compatibility |
| B. | Cartesian multiples |
| C. | Cartesian product |
| D. | Cartesian ordinate |
| Answer» D. Cartesian ordinate | |