Recent questions tagged ugcnetcse-dec2014-paper2

Identify the minimal key for relational scheme $R(A, B, C, D, E)$ with functional dependencies $F = \left\{A \rightarrow B, B \rightarrow C, AC \rightarrow D\right\}$ $A$...

Which of the following is true ?I. Implementation of self-join is possible in SQL with table alias.II. Outer-join operation is basic operation in relational algebra.III. ...

When an array is passed as parameter to a function, which of the following statements is correct ?The function can change values in the original array. In $C$, parameters...

What will be the output of the following $'C'$ code ?main () { int x = 128; printf ("\n%d", 1+x++); }$128$$129$ $130$ $131$

The Excess-$3$ decimal code is a self-complementing code because The binary sum of a code and its $9's$ complement is equal to $9$. It is a weighted code. Complement can ...

The $\text{BCD}$ adder to add two decimal digits needs minimum of$6$ full adders and $2$ half adders$5$ full adders and $3$ half adders$4$ full adders and $3$ half adders...

A computer program selects an integer in the set $\left\{k:1\leq k \leq 10,00,000\right\}$ at random and prints out the result. This process is repeated 1 million times. ...

Consider the Graph shown below : This graph is a _________.Complete GraphBipartite GraphHamiltonian GraphAll of the above

A certain tree has two vertices of degree $4$, one vertex of degree $3$ and one vertex of degree $2$. If the other vertices have degree $1$, how many vertices are there i...