Register

reference book

670 views
0 0 votes 
Evaluate the time complexity of following recurrence relation:

    T(x,c) = Θ(x)                         for c<=2
    T(c,x) = Θ(y)                         for c<=2
    T(x,y) = Θ(x+y) + T(x/2,y/2) otherwise

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Testbook Test Series...Next → · madeeasy test series
← Previous in category · Ace test seriesNext in category → · which DFS algorithm ...
Position:
Show:

Related questions

0 0 votes
1 1 answer
549
549 views
rexritz asked Aug 30, 2023
549 views
Digital logic reference book doubt
Is Modern Digital Electronics by R.P Jain a good book for preparing digital logic for CSE or should I stick with Morris Mano only? Which book covers gate related content ...
0 0 votes
1 answers 1 answer
2.4k
2.4k views
iarnav asked Apr 25, 2018
2,417 views
#Algorithms #Mst Reference to Gate 2008 Question
Link to actual Question - https://gateoverflow.in/3355/gate2008-it-45?show=214096#c214096For the undirected, weighted graph given below, which of the following sequences ...
59 59 votes
4 answers 4 answers
24.8k
24.8k views
Arjun asked Feb 12, 2020
24,838 views
GATE CSE 2020 | Question: 23
Consider a double hashing scheme in which the primary hash function is $h_1(k)= k \text{ mod } 23$, and the secondary hash function is $h_2(k)=1+(k \text{ mod } 19)$. Ass...
0 0 votes
1 1 answer
143
143 views
sri321 asked Aug 26
143 views
Question on Call by object reference
What is the output of the below code snippet?def move(list1, list2): for num in list1: list2.append(num) list1.remove(num) list1 = [1,2,3,4,5] list2 = [10] move(list1, li...