Register

Search results for testbook-test-series

0 votes
0 answers
1
testbook
Can you help me understand the last 2 options
Can you help me understand the last 2 options
User Avatar
0 votes
1 answer
3
#TestBook #TestSeries
((f,g)|f(0)=g(0) or f(1)=g(1)) is the relation equivalent on set of function for all Z to Z . I find this to be equivalence relation ,but the solution says its not .cannot understand the solution properly . Anyone please Clear my doubt
((f,g)|f(0)=g(0) or f(1)=g(1)) is the relation equivalent on set of function for all Z to Z . I find this to be equivalence relation ,but the solution says its not .ca...
User Avatar
0 votes
0 answers
4
Testbool test Series
User Avatar
1 votes
2 answers
7
Testbook group theory question
Let G be a group of order 49. Then G is abelian G is cyclic G is non-abelian Centre of G has order 7
Let G be a group of order 49. ThenG is abelianG is cyclicG is non-abelianCentre of G has order 7
User Avatar
1 votes
0 answers
8
TestBook graph theory question
If G is a simple planar connected graph with 5 vertices, how many edges in maximum can be there in the given graph?
If G is a simple planar connected graph with 5 vertices, how many edges in maximum can be there in the given graph?
User Avatar
0 votes
0 answers
14
TestBook TestSeries question to find number of paths in directed graph
Consider the following directed graph and assume the number of paths to reach to itself i.e. N(A) = 1. Number of paths from A to K are __
Consider the following directed graph and assume the number of paths to reach to itself i.e. N(A) = 1.Number of paths from A to K are __
User Avatar
0 votes
0 answers
15
TestBook graph theory questions
Let Gn be the complete bipartite graph K13, 17 then the chromatic number of G̅n is _____ (G̅n is complement of Gn and n = 30) A 13 B 17 C n(n−1)2−13×17 D n(n−1)2−2
Let Gn be the complete bipartite graph K13, 17 then the chromatic number of G̅n is _____ (G̅n is complement of Gn and n = 30)A13B17Cn(n−1)2−13×17Dn(n−1)2−2
User Avatar
1 votes
1 answer
17
#testbook
Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$
Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$
User Avatar
0 votes
0 answers
18
#testbook
User Avatar
0 votes
1 answer
19
Testbook Test Series
User Avatar
1 votes
1 answer
20
Testbook Test Series
User Avatar
Page: