The number of edges in a complete graph with n vertices is equal to:
Anonymous Quiz
19%
a.)n(n-1)
64%
b.) n(n-1)/2
8%
c.) n^2
9%
d.)2n-1
UGC NTA NET COMPUTER SCIENCE pinned «The number of edges in a complete graph with n vertices is equal to:»
UGC NTA NET COMPUTER SCIENCE pinned «A tree with n vertices has ...... edges»
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? (DEC 2007 QUESTION)
Anonymous Quiz
7%
A.)6/7
31%
B.) 5/7
38%
C.) 4/7
24%
D.) 3/7
UGC NTA NET COMPUTER SCIENCE
A tree with n vertices has ...... edges
Explanation:A vertice is a node or a point in graph. An edge is a line that connects two nodes or points. Thus, let say if there are two nodes, there will be one edge. Simple and logical question on graph.
UGC NTA NET COMPUTER SCIENCE pinned «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? (DEC 2007 QUESTION)»
The desirable characteristics of a module in software engineering are
Anonymous Quiz
25%
a.) low cohesion, tight coupling
26%
b.) high cohesion, tight coupling
14%
c.) low cohesion, loose coupling
35%
d.) high cohesion, loose coupling
UGC NTA NET COMPUTER SCIENCE pinned «The desirable characteristics of a module in software engineering are»
In a network with 25 computers, how many cables would be required in mesh topology?
Anonymous Quiz
27%
a.) 250
20%
b.) 200
43%
c.) 300
10%
d.) 350
UGC NTA NET COMPUTER SCIENCE
In a network with 25 computers, how many cables would be required in mesh topology?
Mesh topology requires n(n-1)/2 cables.
25(25-1)/2=300
25(25-1)/2=300
A hash function f defined as f(key) =key mod 7 with linear probing is used to insert the key 37,38,72,48,98,11,56 into a table index from 0 to 6. what will be the location of 11?
(Dec 2005 question)
(Dec 2005 question)
Anonymous Quiz
8%
a.) 3
31%
b.) 4
33%
c.) 6
28%
d.) 5
UGC NTA NET COMPUTER SCIENCE pinned «A hash function f defined as f(key) =key mod 7 with linear probing is used to insert the key 37,38,72,48,98,11,56 into a table index from 0 to 6. what will be the location of 11?
(Dec 2005 question)»
(Dec 2005 question)»
The total number of spanning trees that can be drawn using five labelled vertices
Anonymous Quiz
19%
a.) 25
60%
b.) 125
16%
c.) 75
5%
d.) 36