Register

Recent questions tagged ugcnetcse-dec2006-paper2

0 votes
1 answer
1
UGC NET CSE | December 2006 | Part 2 | Question: 1
Which of the regular expressions corresponds to this grammar ? $S → AB/AS, A → a/aA, B → b$ $aa^*b^+$ $aa^*b$ $(ab)^*$ $a(ab)^*$
Which of the regular expressions corresponds to this grammar ?$S → AB/AS, A → a/aA, B → b$$aa^*b^+$$aa^*b$$(ab)^*$$a(ab)^*$
User Avatar
1 votes
2 answers
3
UGC NET CSE | December 2006 | Part 2 | Question: 3
The number of edges in a complete graph with $N$ vertices is equal to : $N (N−1)$ $2N−1$ $N−1$ $N(N−1)/2$
The number of edges in a complete graph with $N$ vertices is equal to :$N (N−1)$$2N−1$$N−1$$N(N−1)/2$
User Avatar
0 votes
0 answers
4
UGC NET CSE | December 2006 | Part 2 | Question: 4
Which of the following is not true ? A−B=A ∩ ~ B
Which of the following is not true ? A−B=A ∩ ~ B
User Avatar
0 votes
0 answers
5
UGC NET CSE | December 2006 | Part 2 | Question: 5
If $(a^2−b^2)$ is a prime number where a and b $\in$ N, then : $a^2−b^2=3$ $a^2−b^2=a−b$ $a^2−b^2=a+b$ $a^2−b^2=5$
If $(a^2−b^2)$ is a prime number where a and b $\in$ N, then :$a^2−b^2=3$$a^2−b^2=a−b$$a^2−b^2=a+b$$a^2−b^2=5$
User Avatar
0 votes
1 answer
6
UGC NET CSE | December 2006 | Part 2 | Question: 6
The hexadecimal equivalent of $(10111)_2\times(1110)_2$ is : $150$ $241$ $142$ $101011110$
The hexadecimal equivalent of $(10111)_2\times(1110)_2$ is :$150$$241$$142$$101011110$
User Avatar
1 votes
0 answers
7
UGC NET CSE | December 2006 | Part 2 | Question: 7
An example of a self complementing code is : $8421$ code Gray code Excess-$3$ code $7421$ code
An example of a self complementing code is :$8421$ codeGray codeExcess-$3$ code$7421$ code
User Avatar
0 votes
1 answer
8
UGC NET CSE | December 2006 | Part 2 | Question: 8
A sum of products expression can be implemented with __________ logic gates. AND−OR NAND−OR AND−NOT OR−AND
A sum of products expression can be implemented with __________ logic gates.AND−ORNAND−ORAND−NOTOR−AND
User Avatar
0 votes
1 answer
9
UGC NET CSE | December 2006 | Part 2 | Question: 9
The characteristic equation of the $\text{D}$ flip-flop is : $\text{Q=D}$ $\text{Q=1}$ $\text{Q=0}$
The characteristic equation of the $\text{D}$ flip-flop is : $\text{Q=D}$$\text{Q=1}$$\text{Q=0}$
User Avatar
0 votes
0 answers
10
UGC NET CSE | December 2006 | Part 2 | Question: 10
Which of the following logic is the fastest ? $\text{RTL}$ $\text{ECL}$ $\text{HTL}$ $\text{HCL}$
Which of the following logic is the fastest ?$\text{RTL}$$\text{ECL}$$\text{HTL}$$\text{HCL}$
User Avatar
0 votes
1 answer
11
UGC NET CSE | December 2006 | Part 2 | Question: 11
When a function is recursively called, all automatic variables : are initialized during each execution of the function are retained from the last execution are maintained in a stack are ignored
When a function is recursively called, all automatic variables :are initialized during each execution of the functionare retained from the last executionare maintained in...
User Avatar
0 votes
0 answers
12
UGC NET CSE | December 2006 | Part 2 | Question: 12
Enumeration variables can be used in : search statement like an integer variable break statement preprocessor commands function statement
Enumeration variables can be used in :search statement like an integer variablebreak statementpreprocessor commandsfunction statement
User Avatar
1 votes
0 answers
13
UGC NET CSE | December 2006 | Part 2 | Question: 13
int arr[ ]={1, 2, 3, 4} int count; incr( ) {return ++count;} main( ) { arr[count++]=incr( ); printf(“arr[count]=%d\n”, arr[count]); } The value printed by the above program is : $1$ $2$ $3$ $4$
int arr[ ]={1, 2, 3, 4} int count; incr( ) {return ++count;} main( ) { arr[count++]=incr( ); printf(“arr[count]=%d\n”, arr[count]); }The value printed by the above pr...
User Avatar
1 votes
1 answer
15
UGC NET CSE | December 2006 | Part 2 | Question: 15
The declaration “unsigned u” indicates : u is an unsigned character u is an unsigned integer u is a character u is a string
The declaration “unsigned u” indicates :u is an unsigned characteru is an unsigned integeru is a characteru is a string
User Avatar
0 votes
1 answer
19
UGC NET CSE | December 2006 | Part 2 | Question: 19
Which of the following tools is not required during system analysis phase of system development life cycle ? Case tool RAD tool Reverse engineering None of these
Which of the following tools is not required during system analysis phase of system development life cycle ?Case toolRAD toolReverse engineeringNone of these
User Avatar
1 votes
1 answer
20
UGC NET CSE | December 2006 | Part 2 | Question: 20
Two phase protocol in a database management system is : a concurrency mechanism that is not deadlock free a recovery protocol used for restoring a database after a crash Any update to the system log done in 2-phases not effective in Database
Two phase protocol in a database management system is :a concurrency mechanism that is not deadlock freea recovery protocol used for restoring a database after a crashAny...
User Avatar
0 votes
1 answer
21
UGC NET CSE | December 2006 | Part 2 | Question: 21
Which algorithm has same average, worst case and best case time ? Binary search Maximum of n number Quick sort Fibonacci search
Which algorithm has same average, worst case and best case time ?Binary searchMaximum of n numberQuick sortFibonacci search
User Avatar
0 votes
1 answer
22
UGC NET CSE | December 2006 | Part 2 | Question: 22
Binary search tree is an example of : Divide and conquer technique Greedy algorithm Back tracking Dynamic Programming
Binary search tree is an example of :Divide and conquer techniqueGreedy algorithmBack trackingDynamic Programming
User Avatar
1 votes
2 answers
23
UGC NET CSE | December 2006 | Part 2 | Question: 23
What is the time required to insert an element in a stack with linked implementation ? $O (\log_2 n)$ $O (n)$ $O (n\log_2 n)$ $O (1)$
What is the time required to insert an element in a stack with linked implementation ?$O (\log_2 n)$$O (n)$$O (n\log_2 n)$$O (1)$
User Avatar
0 votes
2 answers
24
UGC NET CSE | December 2006 | Part 2 | Question: 24
The equivalent postfix expression for $d{\large /}(e+f)+b*c$ : $defbc/++*$ $def+/bc+*$ $def+/bc*+$ None of these
The equivalent postfix expression for $d{\large /}(e+f)+b*c$ :$defbc/++*$$def+/bc+*$$def+/bc*+$None of these
User Avatar
0 votes
1 answer
25
UGC NET CSE | December 2006 | Part 2 | Question: 25
Which one of the following is a physical data structure ? Array Linked lists Stacks Tables
Which one of the following is a physical data structure ?ArrayLinked listsStacksTables
User Avatar
0 votes
1 answer
26
UGC NET CSE | December 2006 | Part 2 | Question: 26
How many $DS1$ signals are transported on a $DS3$ signal ? $24$ $672$ $14$ $28$
How many $DS1$ signals are transported on a $DS3$ signal ?$24$$672$$14$$28$
User Avatar
0 votes
1 answer
27
UGC NET CSE | December 2006 | Part 2 | Question: 27
A $10\:\text{BASE-}2$ network is limited to : $20$ bytes per data field $30$ stations per segment $40$ segments $50$ feet of cable
A $10\:\text{BASE-}2$ network is limited to :$20$ bytes per data field$30$ stations per segment$40$ segments$50$ feet of cable
User Avatar
0 votes
2 answers
29
UGC NET CSE | December 2006 | Part 2 | Question: 29
The subnet mask $255.255.255.192$ Extends the network portion to 16 bits Extends the network portion to 26 bits Extends the network portion to 36 bits Has no effect on the network portion of an IP address
The subnet mask $255.255.255.192$Extends the network portion to 16 bitsExtends the network portion to 26 bitsExtends the network portion to 36 bitsHas no effect on the ne...
User Avatar
0 votes
0 answers
30
UGC NET CSE | December 2006 | Part 2 | Question: 30
The $\text{LAPB}$ frame structure and the frame structure of $\text{SDLC}$ are : Opposite Identical Reversed Non-identical
The $\text{LAPB}$ frame structure and the frame structure of $\text{SDLC}$ are :OppositeIdenticalReversedNon-identical
User Avatar
Page: