Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetcse-dec2007-paper2
2
votes
1
answer
1
UGC NET CSE | December 2007 | Part 2 | Question: 1
A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the probability that two of the selected balls are red and two are green ? $\large\frac{3}{7}$ $\large\frac{4}{7}$ $\large\frac{5}{7}$ $\large\frac{6}{7}$
A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the probability that two of the selected balls are red and two ...
go_editor
1.1k
views
go_editor
asked
Mar 28, 2020
Probability
ugcnetcse-dec2007-paper2
+
–
1
votes
2
answers
2
UGC NET CSE | December 2007 | Part 2 | Question: 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$
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$
go_editor
1.2k
views
go_editor
asked
Mar 28, 2020
Graph Theory
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
3
UGC NET CSE | December 2007 | Part 2 | Question: 3
A context free grammar is : type $0$ type $1$ type $2$ type $3$
A context free grammar is :type $0$type $1$type $2$type $3$
go_editor
526
views
go_editor
asked
Mar 28, 2020
Theory of Computation
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
4
UGC NET CSE | December 2007 | Part 2 | Question: 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 word the minimum weight of a non zero code word m n
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
go_editor
552
views
go_editor
asked
Mar 28, 2020
Computer Networks
ugcnetcse-dec2007-paper2
+
–
1
votes
1
answer
5
UGC NET CSE | December 2007 | Part 2 | Question: 5
Consider a Moore machine $M$ whose digraph is : Then $L(M)$, the language accepted by the machine M, is the set of all strings having : two or more b’s three or more b’s two or more a’s three or more a’s
Consider a Moore machine $M$ whose digraph is :Then $L(M)$, the language accepted by the machine M, is the set of all strings having :two or more b’sthree or more b’s...
go_editor
1.4k
views
go_editor
asked
Mar 28, 2020
Theory of Computation
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
6
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$
go_editor
255
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
7
UGC NET CSE | December 2007 | Part 2 | Question: 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}$
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}$
go_editor
643
views
go_editor
asked
Mar 28, 2020
Digital Logic
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
8
UGC NET CSE | December 2007 | Part 2 | Question: 8
In order to build a $\text{MOD - 18}$ counter, the minimum number of flip flops needed is equal to : $18$ $9$ $5$ $4$
In order to build a $\text{MOD - 18}$ counter, the minimum number of flip flops needed is equal to :$18$$9$$5$$4$
go_editor
2.0k
views
go_editor
asked
Mar 28, 2020
Digital Logic
ugcnetcse-dec2007-paper2
digital-logic
digital-counter
+
–
0
votes
1
answer
9
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))}$
go_editor
601
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
10
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$
go_editor
272
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
1
votes
1
answer
11
UGC NET CSE | December 2007 | Part 2 | Question: 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$
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$
go_editor
606
views
go_editor
asked
Mar 28, 2020
Programming in C
ugcnetcse-dec2007-paper2
+
–
1
votes
2
answers
12
UGC NET CSE | December 2007 | Part 2 | Question: 12
Consider the following linked list : Which of the following piece of code will insert the node pointed to by $q$ at the end of the list ? $\text{for (p=list; p !=NULL; p=p → next);}\\ p=q;$ ... $\text{for (p=list; p→next !=NULL; p=p → next);}\\ p→next=q;$
Consider the following linked list :Which of the following piece of code will insert the node pointed to by $q$ at the end of the list ?$\text{for (p=list; p !=NULL; p=p ...
go_editor
816
views
go_editor
asked
Mar 28, 2020
DS
ugcnetcse-dec2007-paper2
+
–
1
votes
1
answer
13
UGC NET CSE | December 2007 | Part 2 | Question: 13
Which of the following is a valid C code to print character A' to C' ? x='A' ; switch(x) {case 'A'= printf ( "%d\n" , x); .... case 'C'= printf ( "%d\n" , x); } x='A'; ... , x); case 'B' =printf ( "%d\n" , x); case 'C' =printf ( "%d\n" , x); }
Which of the following is a valid C code to print character ‘A’ to ‘C’ ?x='A' ; switch(x) {case 'A'= printf ( "%d\n" , x); .... case 'C'= printf ( "%d\n" , x); }x...
go_editor
636
views
go_editor
asked
Mar 28, 2020
Programming in C
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
14
UGC NET CSE | December 2007 | Part 2 | Question: 14
Which of the following is not true in C++ ? Private elements of a base class are not accessible by members of its derived class. Protected elements of base class are not accessible by members of its derived class. ... When base class access specified is Public , protected elements of a base class become protected members of its derived class.
Which of the following is not true in C++ ?“Private” elements of a base class are not accessible by members of its derived class.“Protected” elements of base clas...
go_editor
896
views
go_editor
asked
Mar 28, 2020
Object Oriented Programming
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
15
UGC NET CSE | December 2007 | Part 2 | Question: 15
Which of the following is true of constructor function in C++ ? A class must have at least one constructor. A constructor is a unique function which cannot be overloaded. A constructor function must be invoked with the object name. A constructor function is automatically invoked when an object is created.
Which of the following is true of constructor function in C++ ?A class must have at least one constructor.A constructor is a unique function which cannot be overloaded.A ...
go_editor
2.7k
views
go_editor
asked
Mar 28, 2020
Object Oriented Programming
ugcnetcse-dec2007-paper2
+
–
1
votes
1
answer
16
UGC NET CSE | December 2007 | Part 2 | Question: 16
A primary key for an entity is : a candidate key any attribute a unique attribute a superkey
A primary key for an entity is :a candidate keyany attributea unique attributea superkey
go_editor
779
views
go_editor
asked
Mar 28, 2020
Databases
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
17
UGC NET CSE | December 2007 | Part 2 | Question: 17
Aggregate functions in SQL are : GREATEST, LEAST and ABS SUM, COUNT and AVG UPPER, LOWER and LENGTH SQRT, POWER and MOD
Aggregate functions in SQL are :GREATEST, LEAST and ABSSUM, COUNT and AVGUPPER, LOWER and LENGTHSQRT, POWER and MOD
go_editor
451
views
go_editor
asked
Mar 28, 2020
Databases
ugcnetcse-dec2007-paper2
+
–
0
votes
0
answers
18
UGC NET CSE | December 2007 | Part 2 | Question: 18
If a relation is in 2NF and 3NF forms then : no non-prime attribute is functionally dependent on other non-prime attributes no non-prime attribute is functionally dependent on prime attributes all attributes are functionally independent prime attribute is functionally independent of all non-prime attributes
If a relation is in 2NF and 3NF forms then :no non-prime attribute is functionally dependent on other non-prime attributesno non-prime attribute is functionally dependent...
go_editor
280
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
19
UGC NET CSE | December 2007 | Part 2 | Question: 19
The end of an SQL command is denoted by : an end-of-line character an ‘enter-key’ marker entering F4 key a semicolon (;)
The end of an SQL command is denoted by :an end-of-line characteran ‘enter-key’ markerentering F4 keya semicolon (;)
go_editor
616
views
go_editor
asked
Mar 28, 2020
Databases
ugcnetcse-dec2007-paper2
+
–
0
votes
2
answers
20
UGC NET CSE | December 2007 | Part 2 | Question: 20
Consider the query : SELECT student_name FROM students WHERE class_name=(SELECT class_name FROM students WHERE math_marks=100); what will be the output ? the list of names of students with $100$ marks in mathematics the names of all ... having $100$ marks in mathematics the names and class of all students whose marks in mathematics is $100$
Consider the query :SELECT student_name FROM students WHERE class_name=(SELECT class_name FROM students WHERE math_marks=100);what will be the output ?the list of names o...
go_editor
1.0k
views
go_editor
asked
Mar 28, 2020
Databases
ugcnetcse-dec2007-paper2
+
–
1
votes
1
answer
21
UGC NET CSE | December 2007 | Part 2 | Question: 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 level $0$: $3^i$ $3i$ $3$ $3i+1$
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...
go_editor
862
views
go_editor
asked
Mar 28, 2020
DS
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
22
UGC NET CSE | December 2007 | Part 2 | Question: 22
Which of the following data structure is used to implement recursion ? Arrays Stacks Queues Linked lists
Which of the following data structure is used to implement recursion ?ArraysStacksQueuesLinked lists
go_editor
1.7k
views
go_editor
asked
Mar 28, 2020
DS
ugcnetcse-dec2007-paper2
+
–
1
votes
1
answer
23
UGC NET CSE | December 2007 | Part 2 | Question: 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)$
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)$
go_editor
1.1k
views
go_editor
asked
Mar 28, 2020
DS
ugcnetcse-dec2007-paper2
+
–
0
votes
0
answers
24
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
go_editor
372
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
25
UGC NET CSE | December 2007 | Part 2 | Question: 25
The performance of a file system depends upon the cache hit rate. If it takes $1$ msec to satisfy a request from the cache but $10$ msec to satisfy a request if a disk read is needed, then the mean time (ms) required for a hit rate $’h’$ is given by : $1$ $h+10(1-h)$ $(1-h)+10h$ $10$
The performance of a file system depends upon the cache hit rate. If it takes $1$ msec to satisfy a request from the cache but $10$ msec to satisfy a request if a disk re...
go_editor
820
views
go_editor
asked
Mar 28, 2020
Operating System
ugcnetcse-dec2007-paper2
+
–
0
votes
3
answers
26
UGC NET CSE | December 2007 | Part 2 | Question: 26
The best known example of a MAN is : Ethernet Cable Television FDDI IEEE $802.3$
The best known example of a MAN is :EthernetCable TelevisionFDDIIEEE $802.3$
go_editor
1.2k
views
go_editor
asked
Mar 28, 2020
Computer Networks
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
27
UGC NET CSE | December 2007 | Part 2 | Question: 27
In a broadcast network, a layer that is often thin or non-existent is : network layer transport layer presentation layer application layer
In a broadcast network, a layer that is often thin or non-existent is :network layertransport layerpresentation layerapplication layer
go_editor
602
views
go_editor
asked
Mar 28, 2020
Computer Networks
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
28
UGC NET CSE | December 2007 | Part 2 | Question: 28
The maximum data rate of binary signals on a noiseless $3\:KHz$ channel is : $3000$ bps. $6000$ bps. $9000$ bps. $12,000$ bps.
The maximum data rate of binary signals on a noiseless $3\:KHz$ channel is :$3000$ bps.$6000$ bps.$9000$ bps.$12,000$ bps.
go_editor
2.0k
views
go_editor
asked
Mar 28, 2020
Computer Networks
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
29
UGC NET CSE | December 2007 | Part 2 | Question: 29
For pure ALOHA, the maximum channel utilization is : $100\%$ $50\%$ $36\%$ $18\%$
For pure ALOHA, the maximum channel utilization is :$100\%$$50\%$$36\%$$18\%$
go_editor
722
views
go_editor
asked
Mar 28, 2020
Computer Networks
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
30
UGC NET CSE | December 2007 | Part 2 | Question: 30
An example of an adaptive routing algorithm is : distance vector routing flooding selective flooding shortest path routing
An example of an adaptive routing algorithm is :distance vector routingfloodingselective floodingshortest path routing
go_editor
1.2k
views
go_editor
asked
Mar 28, 2020
Computer Networks
ugcnetcse-dec2007-paper2
algorithms
distance-vector-routing
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register