Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetcse-dec2007-paper2
2
2 votes
2
2 answers
1.7k
1.7k views
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 ...
go_editor
1.7k
views
asked
Mar 28, 2020
Probability
ugcnetcse-dec2007-paper2
probability
combinatory
+
–
1
1 vote
2
2 answers
1.7k
1.7k views
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$
go_editor
1.7k
views
asked
Mar 28, 2020
Graph Theory
ugcnetcse-dec2007-paper2
graph-theory
+
–
0
0 votes
1
1 answer
978
978 views
UGC NET CSE | December 2007 | Part 2 | Question: 3
A context free grammar is :type $0$type $1$type $2$type $3$
go_editor
978
views
asked
Mar 28, 2020
Theory of Computation
ugcnetcse-dec2007-paper2
theory-of-computation
context-free-grammar
+
–
0
0 votes
1
1 answer
993
993 views
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 wordthe minimum weight of a non zero code wordmn
go_editor
993
views
asked
Mar 28, 2020
Computer Networks
ugcnetcse-dec2007-paper2
computer-networks
+
–
1
1 vote
1
1 answer
1.8k
1.8k views
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’sthree or more b’stwo ...
go_editor
1.8k
views
asked
Mar 28, 2020
Theory of Computation
ugcnetcse-dec2007-paper2
theory-of-computation
moore-machine
+
–
0
0 votes
1
1 answer
528
528 views
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$
go_editor
528
views
asked
Mar 28, 2020
Mathematical Logic
ugcnetcse-dec2007-paper2
propositional-logic
well-formed-formula
+
–
0
0 votes
1
1 answer
1.1k
1.1k views
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}$
go_editor
1.1k
views
asked
Mar 28, 2020
Digital Logic
ugcnetcse-dec2007-paper2
digital-logic
boolean-algebra
+
–
0
0 votes
1
1 answer
2.8k
2.8k views
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$
go_editor
2.8k
views
asked
Mar 28, 2020
Digital Logic
ugcnetcse-dec2007-paper2
digital-logic
digital-counter
+
–
0
0 votes
1
1 answer
1.0k
1.0k views
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))}$
go_editor
1.0k
views
asked
Mar 28, 2020
Digital Logic
ugcnetcse-dec2007-paper2
digital-logic
boolean-algebra
dual-function
+
–
0
0 votes
1
1 answer
488
488 views
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$
go_editor
488
views
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
digital-electronics
+
–
1
1 vote
1
1 answer
998
998 views
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$
go_editor
998
views
asked
Mar 28, 2020
Programming in C
ugcnetcse-dec2007-paper2
programming-in-c
+
–
2
2 votes
2
2 answers
1.7k
1.7k views
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 ...
go_editor
1.7k
views
asked
Mar 28, 2020
Data Structures
ugcnetcse-dec2007-paper2
data-structures
linked-list
+
–
1
1 vote
1
1 answer
1.1k
1.1k views
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'; sw...
go_editor
1.1k
views
asked
Mar 28, 2020
Programming in C
ugcnetcse-dec2007-paper2
programming-in-c
switch-statement
+
–
0
0 votes
1
1 answer
1.3k
1.3k views
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 no...
go_editor
1.3k
views
asked
Mar 28, 2020
Object Oriented Programming
ugcnetcse-dec2007-paper2
object-oriented-programming
+
–
0
0 votes
1
1 answer
3.3k
3.3k views
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 ...
go_editor
3.3k
views
asked
Mar 28, 2020
Object Oriented Programming
ugcnetcse-dec2007-paper2
object-oriented-programming
constructor
+
–
1
1 vote
1
1 answer
1.6k
1.6k views
UGC NET CSE | December 2007 | Part 2 | Question: 16
A primary key for an entity is :a candidate keyany attributea unique attributea superkey
go_editor
1.6k
views
asked
Mar 28, 2020
Databases
ugcnetcse-dec2007-paper2
databases
+
–
0
0 votes
1
1 answer
841
841 views
UGC NET CSE | December 2007 | Part 2 | Question: 17
Aggregate functions in SQL are :GREATEST, LEAST and ABSSUM, COUNT and AVGUPPER, LOWER and LENGTHSQRT, POWER and MOD
go_editor
841
views
asked
Mar 28, 2020
Databases
ugcnetcse-dec2007-paper2
sql
databases
+
–
1
1 vote
1
1 answer
548
548 views
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 attributesno non-prime attribute is functionally dependent...
go_editor
548
views
asked
Mar 28, 2020
Databases
ugcnetcse-dec2007-paper2
databases
normal-forms
+
–
0
0 votes
1
1 answer
1.2k
1.2k views
UGC NET CSE | December 2007 | Part 2 | Question: 19
The end of an SQL command is denoted by :an end-of-line characteran ‘enter-key’ markerentering F4 keya semicolon (;)
go_editor
1.2k
views
asked
Mar 28, 2020
Databases
ugcnetcse-dec2007-paper2
databases
sql
+
–
1
1 vote
2
2 answers
2.3k
2.3k views
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 o...
go_editor
2.3k
views
asked
Mar 28, 2020
Databases
ugcnetcse-dec2007-paper2
databases
sql
query
+
–
1
1 vote
1
1 answer
1.4k
1.4k views
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 l...
go_editor
1.4k
views
asked
Mar 28, 2020
Data Structures
ugcnetcse-dec2007-paper2
data-structures
rooted-tree
+
–
0
0 votes
1
1 answer
2.1k
2.1k views
UGC NET CSE | December 2007 | Part 2 | Question: 22
Which of the following data structure is used to implement recursion ?ArraysStacksQueuesLinked lists
go_editor
2.1k
views
asked
Mar 28, 2020
Data Structures
ugcnetcse-dec2007-paper2
data-structures
recursion
+
–
1
1 vote
1
1 answer
1.8k
1.8k views
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)$
go_editor
1.8k
views
asked
Mar 28, 2020
Data Structures
ugcnetcse-dec2007-paper2
data-structures
binary-tree
time-complexity
+
–
0
0 votes
0
0 answers
675
675 views
UGC NET CSE | December 2007 | Part 2 | Question: 24
An example of a file extension is :textpictmp$3$web
go_editor
675
views
asked
Mar 28, 2020
Operating System
ugcnetcse-dec2007-paper2
file-extension
file-system
+
–
0
0 votes
1
1 answer
1.3k
1.3k views
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 re...
go_editor
1.3k
views
asked
Mar 28, 2020
Operating System
ugcnetcse-dec2007-paper2
operating-system
cache-memory
hit-ratio
+
–
0
0 votes
3
3 answers
2.1k
2.1k views
UGC NET CSE | December 2007 | Part 2 | Question: 26
The best known example of a MAN is :EthernetCable TelevisionFDDIIEEE $802.3$
go_editor
2.1k
views
asked
Mar 28, 2020
Computer Networks
ugcnetcse-dec2007-paper2
computer-networks
+
–
0
0 votes
1
1 answer
1.1k
1.1k views
UGC NET CSE | December 2007 | Part 2 | Question: 27
In a broadcast network, a layer that is often thin or non-existent is :network layertransport layerpresentation layerapplication layer
go_editor
1.1k
views
asked
Mar 28, 2020
Computer Networks
ugcnetcse-dec2007-paper2
computer-networks
+
–
0
0 votes
1
1 answer
3.1k
3.1k views
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.
go_editor
3.1k
views
asked
Mar 28, 2020
Computer Networks
ugcnetcse-dec2007-paper2
computer-networks
data-communication
+
–
0
0 votes
2
2 answers
1.2k
1.2k views
UGC NET CSE | December 2007 | Part 2 | Question: 29
For pure ALOHA, the maximum channel utilization is :$100\%$$50\%$$36\%$$18\%$
go_editor
1.2k
views
asked
Mar 28, 2020
Computer Networks
ugcnetcse-dec2007-paper2
computer-networks
pure-aloha
+
–
0
0 votes
1
1 answer
2.0k
2.0k views
UGC NET CSE | December 2007 | Part 2 | Question: 30
An example of an adaptive routing algorithm is :distance vector routingfloodingselective floodingshortest path routing
go_editor
2.0k
views
asked
Mar 28, 2020
Computer Networks
ugcnetcse-dec2007-paper2
algorithms
distance-vector-routing
+
–
Page:
1
2
next »