Recent questions tagged ugcnetcse-dec2007-paper2

1 votes
2 answers
2
The number of edges in a complete graph with $‘n’$ vertices is equal to :$n(n-1)$$\large\frac{n(n-1)}{2}$$n^2$$2n-1$
0 votes
1 answer
3
0 votes
1 answer
4
Let e : B^m → B^n is a group code. The minimum distance of ‘e’ is equal to :the maximum weight of a non zero code wordthe minimum weight of a non zero code wordmn
1 votes
1 answer
5
0 votes
1 answer
6
A $WFF$ that is equivalent to the $WFF$ $x= y$ is :$y=>x$~$y=>x$~$y=>$ ~$x$$y=>$ ~$x$
0 votes
1 answer
7
Simplified form of Boolean expression $\text{xy+(~x)z+yz}$ is :$\text{xy+(~x)z}$$\text{(~x)y+(~x)z}$$\text{(~x)y+xz}$$\text{xy+xz}$
0 votes
1 answer
8
0 votes
1 answer
9
The dual of the switching function $F=x+yz$ is given by :$\text{x+yz}$$\text{x(y+z)}$$\text{(~x)+(~y)(~z)}$$\text{(~x)((~y)+(~z))}$
0 votes
1 answer
10
Amongst the logic families $DTL, TTL, ECL$ and $CMOS$, the family with the least power dissipation is :$CMOS$$DTL$$TTL$$ECL$
1 votes
1 answer
11
What cannot replace ‘?’ in the following C-code to print all odd numbers less than $100$ ?for (i=1; ? ; i=i+2) printf("%d\n", i);$i\leq100$$i\leq101$$i<100$$i<101$
1 votes
1 answer
16
0 votes
1 answer
17
Aggregate functions in SQL are :GREATEST, LEAST and ABSSUM, COUNT and AVGUPPER, LOWER and LENGTHSQRT, POWER and MOD
0 votes
1 answer
19
The end of an SQL command is denoted by :an end-of-line characteran ‘enter-key’ markerentering F4 keya semicolon (;)
1 votes
1 answer
21
Consider a rooted tree in which every node has at least three children. What is the minimum number of nodes at level i (i $0$) of the tree ? Assume that the root is at l...
0 votes
1 answer
22
Which of the following data structure is used to implement recursion ?ArraysStacksQueuesLinked lists
1 votes
1 answer
23
The height of a binary tree with $n$ nodes, in the worst case is :$O(log n)$$O(n)$$\Omega(n\log n)$$\Omega(n^2)$
0 votes
0 answers
24
0 votes
3 answers
26
0 votes
1 answer
27
In a broadcast network, a layer that is often thin or non-existent is :network layertransport layerpresentation layerapplication layer
0 votes
1 answer
28
The maximum data rate of binary signals on a noiseless $3\:KHz$ channel is :$3000$ bps.$6000$ bps.$9000$ bps.$12,000$ bps.
0 votes
1 answer
29
0 votes
1 answer
30