Register

Computer Networks

• recategorized by
339 views
0 votes
0 votes

I am not getting the question.(Please explain me the question first).

• recategorized by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Overflow04 asked Oct 9, 2022
415 views
Algorithms
how O($n^{2}$) in the last.(in the given solution).
how O($n^{2}$) in the last.(in the given solution).
User Avatar
0 votes
0 votes
0 answers
2
Overflow04 asked Oct 9, 2022
285 views
Algorithms
Is it really coping operation will take O(n). Does copy is done character by character. means simple code like (in c++) for(int i=0;i<n;i++) { s=s; } will take O($n^{2}$)
Is it really coping operation will take O(n).Does copy is done character by character.means simple code like (in c++) for(int i=0;i<n;i++){s=s;}will take O($n^{2}$)
User Avatar
1 votes
1 votes
2 answers
3
Nitesh_Yadav asked Apr 11, 2022
275 views
Test Series
What is the time complexity of the below mentioned recursive function. int f(n) { if(n!=1) { return f(n/2)+f(n/2); } else return 10; } O(n) O(n^2) O(log n) O(n logn)
What is the time complexity of the below mentioned recursive function.int f(n){ if(n!=1){ return f(n/2)+f(n/2);}elsereturn 10;} O(n)O(n^2)O(log n)O(n logn)
User Avatar
0 votes
0 votes
1 answer
4
raja11sep asked Jan 15, 2022
871 views
Gateoverflow Test series
Can anyone explain each option, for every option if it is true then why? If false then why? (Please don’t comment like answer is A,B etc) Please help
Can anyone explain each option, for every option if it is true then why? If false then why? (Please don’t comment like answer is A,B etc) Please help
User Avatar
Link Copied!