Register

Recent questions tagged ugcnetcse-june2007-paper2

1 votes
1 answer
1
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
2
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
3
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
4
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
5
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
6
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
7
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
8
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
9
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
10
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
0 votes
2 answers
11
UGC NET CSE | June 2007 | Part 2 | Question: 11
The following loop in $’C’$: int i=0; while (i++<0)i--; will terminate will go into an infinite loop will give compilation error will never be executed
The following loop in $’C’$:int i=0; while (i++<0)i ;will terminatewill go into an infinite loopwill give compilation errorwill never be executed
User Avatar
0 votes
2 answers
12
UGC NET CSE | June 2007 | Part 2 | Question: 12
In case of right shift bitwise operator in $’C’$ language, after shifting $n$ bits, the leftmost $n$ bits: are always filled with zeros are always filled with ones are filled with zeros or ones and is machine dependent none of the above
In case of right shift bitwise operator in $’C’$ language, after shifting $n$ bits, the leftmost $n$ bits:are always filled with zerosare always filled with onesare f...
User Avatar
0 votes
1 answer
13
UGC NET CSE | June 2007 | Part 2 | Question: 13
What keyboard in class specification helps to hide data: Public Private Static Void
What keyboard in class specification helps to hide data:PublicPrivateStaticVoid
User Avatar
3 votes
4 answers
14
UGC NET CSE | June 2007 | Part 2 | Question: 14
What is the output of the following $\text{’C’}$ program? main() { printf(“%x”,-1>>4); } $\text{ffff}$ $\text{0fff}$ $\text{0000}$ $\text{fff0}$
What is the output of the following $\text{’C’}$ program?main() { printf(“%x”,-1>>4); }$\text{ffff}$$\text{0fff}$$\text{0000}$$\text{fff0}$
User Avatar
0 votes
1 answer
15
UGC NET CSE | June 2007 | Part 2 | Question: 15
Runtime polymorphism can be achieved by: Accessing virtual function through the pointer of the base class Accessing virtual function through the object The derived class None of these
Runtime polymorphism can be achieved by:Accessing virtual function through the pointer of the base classAccessing virtual function through the objectThe derived classNone...
User Avatar
0 votes
2 answers
16
UGC NET CSE | June 2007 | Part 2 | Question: 16
Which of the following statements is wrong? $2-$ phase Locking Protocols suffer from dead locks. Time-Stamp Protocols suffer from more aborts. Time-Stamp Protocols suffer from cascading roll back where as $2-$phase locking Protocol donot. None of these
Which of the following statements is wrong?$2-$ phase Locking Protocols suffer from dead locks.Time-Stamp Protocols suffer from more aborts.Time-Stamp Protocols suffer fr...
User Avatar
0 votes
1 answer
17
UGC NET CSE | June 2007 | Part 2 | Question: 17
A recursive foreign key is a : references a relation references a table references its own relation references a foreign key
A recursive foreign key is a :references a relationreferences a tablereferences its own relationreferences a foreign key
User Avatar
0 votes
1 answer
18
UGC NET CSE | June 2007 | Part 2 | Question: 18
A subclass having more than one super class is called: Category Classification Combination Partial Participation
A subclass having more than one super class is called:CategoryClassificationCombinationPartial Participation
User Avatar
0 votes
1 answer
19
UGC NET CSE | June 2007 | Part 2 | Question: 19
A Relation $R=${$A,B,C,D,E,F$} is given with following set of functional dependencies: $F=${$A\rightarrow B, AD\rightarrow C,B\rightarrow F,A\rightarrow E$}. Which of the following is Candidate Key? $A$ $AC$ $AD$ None of these
A Relation $R=${$A,B,C,D,E,F$} is given with following set of functional dependencies:$F=${$A\rightarrow B, AD\rightarrow C,B\rightarrow F,A\rightarrow E$}. Which of the ...
User Avatar
0 votes
3 answers
21
UGC NET CSE | June 2007 | Part 2 | Question: 21
The time required to find the shortest path in a graph with $n$ vertices and $e$ edges is: $O(e)$ $O(n)$ $O(e^{2})$ $O(n^{2})$
The time required to find the shortest path in a graph with $n$ vertices and $e$ edges is:$O(e)$$O(n)$$O(e^{2})$$O(n^{2})$
User Avatar
0 votes
0 answers
22
UGC NET CSE | June 2007 | Part 2 | Question: 22
Pre order is also known as: Depth first order Breadth first order Topological order Linear order
Pre order is also known as:Depth first orderBreadth first orderTopological orderLinear order
User Avatar
0 votes
0 answers
23
UGC NET CSE | June 2007 | Part 2 | Question: 23
The equivalent postfix express for $d/(e+f)+b*c$ is : $defbc/++$ $def+/bc+*$ $def+/bc*+$ None of these
The equivalent postfix express for $d/(e+f)+b*c$ is :$defbc/++$$def+/bc+*$$def+/bc*+$None of these
User Avatar
0 votes
0 answers
24
UGC NET CSE | June 2007 | Part 2 | Question: 24
Which algorithm has some average, worst case and best case time: Binary search Maximum of $n$ numbers Quick sort Fibonacci search
Which algorithm has some average, worst case and best case time:Binary searchMaximum of $n$ numbersQuick sortFibonacci search
User Avatar
0 votes
1 answer
25
UGC NET CSE | June 2007 | Part 2 | Question: 25
Application of data structure is queue is: Level wise printing of tree. Implementation of priority queues. Function call implementation Depth first search in a graph.
Application of data structure is queue is:Level wise printing of tree.Implementation of priority queues.Function call implementationDepth first search in a graph.
User Avatar
0 votes
0 answers
26
UGC NET CSE | June 2007 | Part 2 | Question: 26
In case of Bus/Tree topology signal balancing issue is overcome by: Strong Transmitter Polling Segmentation Modulation
In case of Bus/Tree topology signal balancing issue is overcome by:Strong Transmitter PollingSegmentationModulation
User Avatar
0 votes
1 answer
27
UGC NET CSE | June 2007 | Part 2 | Question: 27
Which of the following techniques are used to control data flow? Windowing Routing $\text{RPCs}$ Buffering $1,4$ $2,3,4$ $1,3,4$ $1,2,3,4$
Which of the following techniques are used to control data flow?WindowingRouting$\text{RPCs}$Buffering $1,4$$2,3,4$$1,3,4$$1,2,3,4$
User Avatar
1 votes
0 answers
28
UGC NET CSE | June 2007 | Part 2 | Question: 28
$\text{TDM}$ is _____. A primary /secondary type protocol A peer/peer protocol A Non-priority peer/peer protocol A priority type protocol
$\text{TDM}$ is _____.A primary /secondary type protocolA peer/peer protocolA Non-priority peer/peer protocolA priority type protocol
User Avatar
0 votes
1 answer
29
UGC NET CSE | June 2007 | Part 2 | Question: 29
What services does the Internet Layer provide? Quality of service Routing Addressing Connection-oriented delivery Framming bits $1,2,3$ $2,3,4$ $1,3,4,5$ $2,3,4,5$
What services does the Internet Layer provide?Quality of serviceRoutingAddressingConnection-oriented deliveryFramming bits $1,2,3$$2,3,4$$1,3,4,5$$2,3,4,5$
User Avatar
0 votes
0 answers
30
UGC NET CSE | June 2007 | Part 2 | Question: 30
Which of the following protocols is used to prevent looping? $\text{OSPF}$ Spanning tree $\text{SRB}$ Fragment free switching
Which of the following protocols is used to prevent looping?$\text{OSPF}$Spanning tree$\text{SRB}$Fragment free switching
User Avatar
Page: