Register
Filter

Recent questions in Others

0 votes
1 answer
1591
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$
User Avatar
0 votes
1 answer
1592
UGC NET CSE | December 2007 | Part 2 | Question: 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))}$
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))}$
User Avatar
0 votes
1 answer
1593
UGC NET CSE | December 2007 | Part 2 | Question: 10
Amongst the logic families $DTL, TTL, ECL$ and $CMOS$, the family with the least power dissipation is : $CMOS$ $DTL$ $TTL$ $ECL$
Amongst the logic families $DTL, TTL, ECL$ and $CMOS$, the family with the least power dissipation is :$CMOS$$DTL$$TTL$$ECL$
User Avatar
0 votes
0 answers
1595
UGC NET CSE | December 2007 | Part 2 | Question: 24
An example of a file extension is : text pict mp$3$ web
An example of a file extension is :textpictmp$3$web
User Avatar
0 votes
1 answer
1596
UGC NET CSE | December 2007 | Part 2 | Question: 39
An example of a directory found in most $\text{UNIX}$ system is : $\text{usr}$ $\text{waitpid}$ $\text{brk}$ $\text{unmap}$
An example of a directory found in most $\text{UNIX}$ system is :$\text{usr}$$\text{waitpid}$$\text{brk}$$\text{unmap}$
User Avatar
0 votes
0 answers
1597
UGC NET CSE | December 2007 | Part 2 | Question: 43
An error message produced by an interactive system should have : always the error code the list of mistakes done by the user displayed a non-judgmental approach the past records of the occurrence of the same mistake
An error message produced by an interactive system should have :always the error codethe list of mistakes done by the user displayeda non-judgmental approachthe past reco...
User Avatar
0 votes
0 answers
1598
UGC NET CSE | December 2007 | Part 2 | Question: 46
Given a parallel algorithm $A$ with computation time $t$, if parallel algorithm $A$ performs $m$ computational operation, then $p$ processors can execute algorithm $A$ in time given by : $t/p$ $mt/p$ $t+(m-t)/p$ $(m-t)/p$
Given a parallel algorithm $A$ with computation time $t$, if parallel algorithm $A$ performs $m$ computational operation, then $p$ processors can execute algorithm $A$ in...
User Avatar
0 votes
0 answers
1600
UGC NET CSE | December 2007 | Part 2 | Question: 48
Consider a typical mobile communication system. If $840$ frequencies are available, how many can be used in a given cell ? $140$ $120$ $84$ $60$
Consider a typical mobile communication system. If $840$ frequencies are available, how many can be used in a given cell ?$140$$120$$84$$60$
User Avatar
1 votes
1 answer
1601
UGC NET CSE | June 2007 | Part 2 | Question: 1
The following determiniotic finite automata recognizes: Set of all strings containing $’ab’$ Set of all strings containing $’aab’$ Set of all strings ending in $’abab’$ None of the above
The following determiniotic finite automata recognizes:Set of all strings containing $’ab’$Set of all strings containing $’aab’$Set of all strings ending in $’a...
User Avatar
0 votes
0 answers
1602
UGC NET CSE | June 2007 | Part 2 | Question: 2
Depth ion travels of the following directed graph is: $\text{A B C D E F}$ $\text{A B D E F C}$ $\text{A C E B D F}$ None of the above
Depth ion travels of the following directed graph is:$\text{A B C D E F}$$\text{A B D E F C}$$\text{A C E B D F}$None of the above
User Avatar
0 votes
0 answers
1603
UGC NET CSE | June 2007 | Part 2 | Question: 3
The maximum number of nodes in a binary tree of depth $10$: $1024$ $2^{10}-1$ $1000$ None of the above
The maximum number of nodes in a binary tree of depth $10$:$1024$ $2^{10}-1$ $1000$None of the above
User Avatar
1 votes
1 answer
1604
UGC NET CSE | June 2007 | Part 2 | Question: 4
The regular expression given below describes: $r=(1+01)$*$(0+\lambda)$ Set of all string not containing $’11’$ Set of all string not containing $’00’$ Set of all string containing $’01’$ Set of all string ending in $’0’$
The regular expression given below describes:$r=(1+01)$*$(0+\lambda)$Set of all string not containing $’11’$Set of all string not containing $’00’$Set of all stri...
User Avatar
0 votes
1 answer
1605
UGC NET CSE | June 2007 | Part 2 | Question: 5
Which of the following language is regular: $L=${${a^{n}b^{n}|n\geq 1}$} $L=${${a^{n}b^{m}c^{n}d^{m}|n,m\geq 1}$} $L=${${a^{n}b^{m}|n,m\geq 1}$} $L=${${a^{n}b^{m}c^{n}|n,m\geq 1}$}
Which of the following language is regular:$L=${${a^{n}b^{n}|n\geq 1}$}$L=${${a^{n}b^{m}c^{n}d^{m}|n,m\geq 1}$}$L=${${a^{n}b^{m}|n,m\geq 1}$}$L=${${a^{n}b^{m}c^{n}|n,m\ge...
User Avatar
0 votes
1 answer
1606
UGC NET CSE | June 2007 | Part 2 | Question: 6
$2$’s complement of $-100$ is: $00011100$ $10011101$ $10011100$ $11100100$
$2$’s complement of $-100$ is:$00011100$$10011101$$10011100$$11100100$
User Avatar
0 votes
0 answers
1607
UGC NET CSE | June 2007 | Part 2 | Question: 7
Which of the following expression remove hazard form : $xy+z \bar{x}$? $xy+z \bar{x}$ $xy+z \bar{x}$ $xy+z \bar{x}+yz$ $xy+z \bar{x}+wz$
Which of the following expression remove hazard form : $xy+z \bar{x}$?$xy+z \bar{x}$$xy+z \bar{x}$$xy+z \bar{x}+yz$$xy+z \bar{x}+wz$
User Avatar
0 votes
1 answer
1608
UGC NET CSE | June 2007 | Part 2 | Question: 8
How many $1$’s are present in the binary representation of $15\times 256+5\times 16+3$: $8$ $9$ $10$ $11$
How many $1$’s are present in the binary representation of $15\times 256+5\times 16+3$:$8$$9$$10$$11$
User Avatar
0 votes
2 answers
1609
UGC NET CSE | June 2007 | Part 2 | Question: 9
If $A\oplus B=C,$ then: $A\oplus C=B$ $B\oplus C=A$ $A\oplus B\oplus C=1$ $A\oplus B\oplus C=0$
If $A\oplus B=C,$ then:$A\oplus C=B$$B\oplus C=A$$A\oplus B\oplus C=1$$A\oplus B\oplus C=0$
User Avatar
0 votes
2 answers
1610
UGC NET CSE | June 2007 | Part 2 | Question: 10
What is the maximum counting speed of a $4$-bit binary counter which is composed of Flip-Flop with a propagation delay of $25\:ns$? $1 \text{MHz}$ $10 \text{MHz}$ $100 \text{MHz}$ $4 \text{MHz}$
What is the maximum counting speed of a $4$-bit binary counter which is composed of Flip-Flop with a propagation delay of $25\:ns$?$1 \text{MHz}$$10 \text{MHz}$$100 \text...
User Avatar
Page: