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?

(A) 2 and 1 respectively (B) 1 and 2 respectively

(C) 2 and 2 respectively (D) 1 and 1 respectively

Answer: B

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

**List – I List – II**

**(Database term) (Definition)**

I. Specialization A. Result of taking the union of two or more

disjoint (lower-level) entity sets to produce

a higher-level entity set.

II. Generalization B. Express the number of entities to which
another

entity can be associated via a relationship
set.

III. Aggregation C. Result of taking a subset of a
higher-level

entity set to form a lower-level entity set.

IV. Mapping cardinalities D. 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 :**

I
II III IV

(A) D A
B C

(B) D C
B A

(C) C D
A B

(D) C A
D B

Answer: D

13.
Consider a raster grid having XY-axes in
positive X-direction and positive upward Y-direction with X

_{max}= 10, X_{min}= –5, Y_{max}= 11, and Y_{min}= 6. What is the address of memory pixel with location (5, 4) in raster grid assuming base address 1 (one)?
(A) 150 (B)
151

(C) 160 (D)
161

Answer: D

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?

(A) 2

^{N}(B) 2^{W}
(C) 2

^{N+W}(D) 2^{N–1}
Answer: A

15.
Consider the Breshenham’s line generation
algorithm for a line with gradient greater than one, current point (x

_{i}, y_{i}) and decision parameter, d_{i}. The next point to be plotted (x_{i+1}, y_{i+1}) and updated decision parameter, d_{i+1}, for d_{i}< 0 are given as .................
(A) x

_{i+1}= x_{i}+1
y

_{i+1}= y_{i}
d

_{i+1}= d_{i}+ 2 dy
(B) x

_{i+1}= x_{i}
y

_{i+1}= y_{i}+ 1
d

_{i+1}= d_{i}+ 2 dx
(C) x

_{i+1}= x_{i}
y

_{i+1}= y_{i}+ 1
d

_{i+1}= d_{i}+ 2 (dx – dy)
(D) x

_{i+1}= x_{i}+ 1
y

_{i+1}= y_{i}+ 1
d

_{i+1}= d_{i}+ 2 (dy – dx)
Answer: B

16.
A point P(2, 5) is rotated about a pivot
point (1, 2) by 60°. What is the new transformed point P'?

(A) (1, 4) (B)
(–1, 4)

(C) (1, – 4) (D)
(– 4, 1)

Answer: B

17.
In perspective projection (from 3D to 2D),
objects behind the centre of projection are projected upside down and backward
onto the view-plane. This is known as ..............

(A) Topological distortion (B) Vanishing point

(C) View confusion (D) Perspective foreshortening

Answer: C

18.
The Liang-Barsky line clipping algorithm uses
the parametric equation of a line from (x

_{1},y_{1}) to (x_{2},y_{2}) along with its infinite extension which is given as :
x = x

_{1}+ Dx.u
y = y

_{1}+ Dy.u
Where Dx = x

_{2}– x_{1}, Dy = y_{2}– y_{1}, and u is the parameter with 0 ≤ u ≤ 1. A line AB with end points A(–1, 7) and B(11, 1) is to be clipped against a rectangular window with x_{min}=1, x_{max}=9, y_{min}=2, and y_{max}=8. The lower and upper bound values of the parameter u for the clipped line using Liang-Barsky algorithm is given as:
(A) (0, 2/3) (B)
(1/6, 5/6)

(C) (0, 1/3) (D)
(0, 1)

Answer: B

19.
Match the following with reference to
Functional programming history:

a. Lambda calculus i. Church, 1932

b. Lambda calculus as

programming language ii. Wordsworth, 1970

c. Lazy evaluation iii. Haskel, 1990

d. Type classes iv. Mecarthy, 1960

**Codes :**

a
b c d

(A) iv i iii
ii

(B) i iv ii
iii

(C) iii ii iv
i

(D) ii i iv
iii

Answer: B

20.
Aliasing in the context of programming
languages refers to:

(A) Multiple variables having the same
location

(B) Multiple variables having the same
identifier

(C) Multiple variables having the same value

(D) Multiple use of same variable

Answer: A

## 0 comments:

## Post a Comment