# Recent questions tagged ugcnetaug2016iii 1 vote
1
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$ ... $x_{ i+1} = x_{ i + 1} y_{i+1} = y_{i + 1} d_{i+1} = d_{i} + 2 (dy - dx)$
2
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 ? $2^{N}$ $2^{W}$ $2^{N+W}$ $2^{N-1}$
1 vote
3
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) ? $150$ $151$ $160$ $161$
4
Consider the following ORACLE relations : One $(x, y) = {, , , , , }$ Two $(x, y) = {, , , , , , , }$ Consider the following two $SQL$ queries $SQ1$ and $SQ2$ : SQ1 : SELECT * FROM One) EXCEPT (SELECT * FROM Two); SQ2 : SELECT ... (number of rows) of the result obtained when applied to the instances above ? 2 and 1 respectively 1 and 2 respectively 2 and 2 respectively 1 and 1 respectively
1 vote
5
Consider the table $R$ with attributes $A, B$ and $C$. The functional dependencies that hold on $R$ are : $A \rightarrow B, C \rightarrow AB$. Which of the following statements is/are True ? I. The decomposition of $R$ into $R1(C, A)$ and $R2(A, B)$ is lossless. II. The decomposition of $R$ into $R1(A, B)$ and $R2(B, C)$ is lossy. Only $I$ Only $II$ Both $I$ and $II$ Neither $I$ nor $II$
1 vote
6
Suppose database table $T1(P, R)$ currently has tuples ${(10, 5), (15, 8), (25, 6)}$ and table $T2 (A, C)$ currently has ${(10, 6), (25, 3), (10, 5)}$. Consider the following three relational algebra queries $RA1, RA2$ and $RA3$: $RA1$ ... resulting table of RA1, RA2 and RA3 are given by : $2, 4, 2$ respectively $2, 3, 2$ respectively $3, 3, 1$ respectively $3, 4, 1$ respectively
7
The Global conceptual Schema in a distributed database contains information about global relations. The condition that all the data of the global relation must be mapped into the fragments, that is, it must not happen that a data item ... a global relation does not belong to any fragment, is called : Disjointness condition Completeness condition Reconstruction condition Aggregation condition
1 vote
8
Which of the following statements is/are True regarding some advantages that an objectoriented DBMS (OODBMS) offers over a relational database ? I. An OODBMS avoids the impedance mismatch problem. II. An OODBMS avoids the phantom problem. III. An OODBMS provides higher performance concurrency control than ... $III$ only $I$ and $IV$ only $I, II,$ and $III$ only $I, III$ and $IV$ only
9
The output of the following combinational circuit is : $X . Y$ $X + Y$ $X \bigoplus Y$ $X \bigoplus Y$
1 vote
10
In _____ addressing mode, the operands are stored in the memory. The address of the corresponding memory location is given in a register which is specified in the instruction. Register direct Register indirect Base indexed Displacement
1 vote
11
Which of the following in 8085 microprocessor performs $HL = HL + HL$ ? DAD D DAD H DAD B DAD SP
1 vote
12
The register that stores the bits required to mask the interrupts is ______. Status register Interrupt service register Interrupt mask register Interrupt request register
1 vote
$8085$ microprocessor has ____ bit ALU. $32$ $16$ $8$ $4$
A ripple counter is a $(n)$ : Synchronous Counter Asynchronous counter Parallel counter None of the above
What is printed by the print statements in the program $P1$ assuming call by reference parameter passing? Program P1() { x = 10; y = 3; func1(y,x,x); print x; print y; } func1(x,y,z) { y = y + 4; z = x + y + z } $\text{10, 3}$ $\text{31, 3}$ $\text{27, 7}$ None of the above