171 views
0 votes
0 votes

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Rajib Datta Roy asked Nov 2, 2023
198 views
((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...
0 votes
0 votes
0 answers
2
amit166 asked Jan 19, 2023
238 views
1 votes
1 votes
1 answer
3
amit166 asked Jan 5, 2023
287 views
Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$
0 votes
0 votes
0 answers
4
anjali007 asked Dec 19, 2018
804 views
If G = (V,E) is a directed graph, then length of adjacency list is ______ and it requires ______ amount of memory.12|E|, θ(V)2|E|, θ(V+E)Correct Answer3|E|, θ(E)42|E|,...