Register
Filter

Answers by smsubham

0 votes
62
UGC NET CSE | December 2007 | Part 2 | Question: 6
A $WFF$ that is equivalent to the $WFF$ $x=> y$ is : $y=>x$ ~$y=>x$ ~$y=>$ ~$x$ $y=>$ ~$x$
A $WFF$ that is equivalent to the $WFF$ $x= y$ is :$y=>x$~$y=>x$~$y=>$ ~$x$$y=>$ ~$x$
2 votes
67
NIELIT 2017 DEC Scientific Assistant A - Section B: 4
Complement of a $DFA$ can be obtained by : making starting state as final state. make final as a starting state. making final states non-final and non-final as final. None of the options
Complement of a $DFA$ can be obtained by :making starting state as final state.make final as a starting state.making final states non-final and non-final as final.None of...
5 votes
70
NIELIT 2017 July Scientist B (IT) - Section B: 32
Output of following program #include<stdio.h> int main() { int i=5; printf("%d %d %d", i++,i++,i++); return 0; } $7\:6\:5$ $5\:6\:7$ $7\:7\:7$ Compiler Dependent
Output of following program#include<stdio.h int main() { int i=5; printf("%d %d %d", i++,i++,i++); return 0; }$7\:6\:5$$5\:6\:7$$7\:7\:7$Compiler Dependent
5 votes
71
NIELIT 2017 July Scientist B (IT) - Section B: 33
Output of following program? #include<stdio.h> void dynamic(int s,...) { printf("%d",s); } int main() { dynamic(2,4,6,8); dynamic(3,6,9); return 0; } $2\:3$ Compiler Error $4\:3$ $3\:2$
Output of following program? #include<stdio.h void dynamic(int s,...) { printf("%d",s); } int main() { dynamic(2,4,6,8); dynamic(3,6,9); return 0; }$2\:3$Compiler Error$4...
3 votes
83
NIELIT 2017 July Scientist B (IT) - Section B: 52
'AS' clause is used in SQL for Selection operation Rename operation Join Operation Projection Operation
'AS' clause is used in SQL forSelection operationRename operationJoin OperationProjection Operation
2 votes
87
NIELIT 2017 July Scientist B (IT) - Section B: 56
Consider the join of a relation $R$ with relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples, then the maximum size of join is $mn$ $m+n$ $(m+n)/2$ $2(m+n)$
Consider the join of a relation $R$ with relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples, then the maximum size of join is$mn$$m+n$$(m+n)/2$$2(m+n)$
Page: