MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 14 Mcqs, each offering curated multiple-choice questions to sharpen your Rdbms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
State true or false: The aggregation functions can be implemented in the same way as that of duplicate elimination. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 2. |
Which of the following joins preserves the tuples of the relation on the left side of the operator? |
| A. | Left outer join |
| B. | Natural join |
| C. | Right outer join |
| D. | None of the mentioned |
| Answer» B. Natural join | |
| 3. |
Which of the following is not a set operation |
| A. | Union |
| B. | Intersection |
| C. | And operation |
| D. | Set difference |
| Answer» D. Set difference | |
| 4. |
Overflow resolution is performed when, |
| A. | A hash index overflow is detected |
| B. | Extra hash indices are to be added |
| C. | When the number of partitions are to be increased |
| D. | None of the mentioned |
| Answer» B. Extra hash indices are to be added | |
| 5. |
for each tuple tr in r do begin What type of join is this? |
| A. | Equi join |
| B. | Hash join |
| C. | Nested loop join |
| D. | Block nested loop joinView Answer |
| Answer» D. Block nested loop joinView Answer | |
| 6. |
A join of the form r ⨝r.A=s.B s is called as |
| A. | Equi join |
| B. | Left outer join |
| C. | Right outer join |
| D. | Full outer join |
| Answer» B. Left outer join | |
| 7. |
WHICH_OF_THE_FOLLOWING_JOINS_PRESERVES_THE_TUPLES_OF_THE_RELATION_ON_THE_LEFT_SIDE_OF_THE_OPERATOR??$ |
| A. | Left outer join |
| B. | Natural join |
| C. | Right outer join |
| D. | None of the mentioned |
| Answer» B. Natural join | |
| 8. |
Which of the following is not a set operatio? |
| A. | Union |
| B. | Intersection |
| C. | And operation |
| D. | Set difference |
| Answer» B. Intersection | |
| 9. |
Overflow resolution is performed when? |
| A. | A hash index overflow is detected |
| B. | Extra hash indices are to be added |
| C. | When the number of partitions are to be increased |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 10. |
The splitting of input until each partition of the build input fits the memory is called as ______ |
| A. | Temporary partitioning |
| B. | Block partitioning |
| C. | Recursive partitioning |
| D. | Byte partitioning |
| Answer» B. Block partitioning | |
| 11. |
The ___________ merges the sorted relation with leaf entries of the secondary B+ tree index. |
| A. | Merge join algorithm |
| B. | Hybrid merge join algorithm |
| C. | Hash join algorithm |
| D. | Hybrid Hash join algorithm |
| Answer» D. Hybrid Hash join algorithm | |
| 12. |
The merge join can be used to compute |
| A. | Natural joins |
| B. | Equi joins |
| C. | Both the mentioned |
| D. | None of the mentioned |
| Answer» C. Both the mentioned | |
| 13. |
If nested loop join is done on a per block basis rather than on a per tuple basis, it is called as |
| A. | Equi join |
| B. | Hash join |
| C. | Nested loop join |
| D. | Block nested loop join |
| Answer» D. Block nested loop join | |
| 14. |
A join of the form r ‚®ùr.A=s.B s is called as |
| A. | Equi join |
| B. | Left outer join |
| C. | Right outer join |
| D. | Full outer join |
| Answer» B. Left outer join | |