PREVIOUS YEAR SOLVED PAPERS - August 2016 Paper 3

11. Consider the following ORACLE relations :
One (x, y) = {<2, 5>, <1, 6>, <1, 6>, <1, 6>, <4, 8>, <4, 8>}
Two (x, y) = {<2, 55>, <1, 1>, <4, 4>, <1, 6>, <4, 8>, <4, 8>, <9, 9>, <1, 6>}
Consider the following two SQL queries SQ1 and SQ2 :
SQ1 : SELECT * FROM One)
EXCEPT
(SELECT * FROM Two);
SQ2 : SELECT * FROM One)
EXCEPT ALL
(SELECT * FROM Two);
For each of the SQL queries, what is the cardinality (number of rows) of the result obtained when applied to the instances above ?

  • Option : B
  • Explanation :
    SQ1 : SELECT * FROM One) EXCEPT (SELECT * FROM Two); It will result into single tuple (2, 5) because all duplicate tuples will be removed.
    SQ2 : SELECT * FROM One) EXCEPT ALL (SELECT * FROM Two); It will result into 2 tuples because it will not remove duplicate.
    So, option (B) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


12. Which one of the following pairs is correctly matched in the context of database design?

List – IList – II
(Database term)(Definition)
I. SpecializationA. Result of taking the union of two or more disjoint (lower-level) entity sets to produce a higher-level entity set.
II. GeneralizationB. Express the number of entities to which another entity can be associated via a relationship set.
III. AggregationC. Result of taking a subset of a higher-level entity set to form a lower-level entity set.
IV. Mapping cardinalitiesD. An abstraction in which relationship sets (along with their associated entity sets) are treated as higher-level entity sets, and can participate in relationships.

Codes:

 IIIIIIIV
(1)DABC
(2)DCBA
(3)CDAB
(4)CADB

  • Option : D
  • Explanation :
  • Result of taking a subset of a higher-level entity set to form a lower-level entity set is Specialization
  • Result of taking the union of two or more disjoint(lower-level) entity sets to produce a higher-level entity set is Generalization
  • An abstraction in which relationship sets (along with their associated entity sets) are treated as higher-level entity sets, and can participate in relationships.Aggregation
  • Express the number of entities to which another entity can be associated via a relationship set Mapping cardinalities
  • So, option (D) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


13. Consider a raster grid having XY-axes in positive X-direction and positive upward Y-direction with Xmax = 10, Xmin = –5, Ymax = 11, and Ymin = 6. What is the address of memory pixel with location (5, 4) in raster grid assuming base address 1 (one) ?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


14. Consider a N-bit plane frame buffer with W-bit wide lookup table with W > N. How many intensity levels are available at a time ?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


15. Consider the Breshenham’s line generation algorithm for a line with gradient greater than one, current point (xi, yi) and decision parameter, di. The next point to be plotted (xi+1, yi+1) and updated decision parameter, di+1, for di < 0 are given as _______.

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


Related Quiz.
August 2016 Paper 3