Register
Webpage for Algorithms

Recent questions tagged algorithms

0 votes
0 answers
1351
DFS BFS
Please give an example i didn't get it The depth of any DFS tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex.
Please give an example i didn't get itThe depth of any DFS tree rooted at a vertex is at least as much as thedepth of any BFS tree rooted at the same vertex.
User Avatar
1 votes
2 answers
1352
Sorting
Could a binary search tree be built using o(n lg n) comparisons in the comparison model? Explain why or why not.
Could a binary search tree be built using o(n lg n) comparisons in the comparisonmodel? Explain why or why not.
User Avatar
0 votes
2 answers
1353
Algorithms doubt
F(n)=n^(sin n) G(n)=n^(cos n) Why they are non comparable.
F(n)=n^(sin n)G(n)=n^(cos n)Why they are non comparable.
User Avatar
0 votes
0 answers
1355
Master theorem rules
On which of the following recurrence relation Master Theorem cannot be applied? a) T(n)=2T(n/2)+nlogn b) T(n)=T(n/2)+1 c) T(n)=8T(n/2)+logn d) T(n)=7T(n/4)+n^2
On which of the following recurrence relation Master Theorem cannot be applied?a) T(n)=2T(n/2)+nlognb) T(n)=T(n/2)+1c) T(n)=8T(n/2)+lognd) T(n)=7T(n/4)+n^2
User Avatar
0 votes
2 answers
1356
time complexity
main() { int i,count; for (i=1; i<=n; i++) { for(i=1; i<=(n*n); i++) { for(i=1; i<=(n*n*n); i++) { count++; } } } } What will be the time complexity of the given program?
main() { int i,count; for (i=1; i<=n; i++) { for(i=1; i<=(n*n); i++) { for(i=1; i<=(n*n*n); i++) { count++; } } } }What will be the time complexity of the given program?
User Avatar
2 votes
1 answer
1357
Self doubt algorithms
In coremen it is given that $\log^kn$=$(\log n)^k$ $\log\log n$ is not equal to $\log^2n$ i understood it with example please correct me if I am wrong .
In coremen it is given that$\log^kn$=$(\log n)^k$$\log\log n$ is not equal to $\log^2n$ i understood it with exampleplease correct me if I am wrong .
User Avatar
3 votes
1 answer
1358
DFS Algo
Is following statement true/false? A DFS of a directed graph always produces the same number of tree edges, i.e., independent of the order in which vertices are considered for DFS. Answer is FALSE please explain
Is following statement true/false? A DFS of a directed graph always produces the same number of tree edges, i.e., independent of the order in which vertices are considere...
User Avatar
1 votes
1 answer
1359
MIT_algorithms
I don't understand How?
I don't understand How?
User Avatar
1 votes
1 answer
1360
Massachusetts Institute of Technology Professors Ron Rivest and Srini Devadas
There exists a comparison sort of 5 numbers that uses at most 6 comparisons in the worst case. True or False and Why?
There exists a comparison sort of 5 numbers that uses at most 6 comparisons in the worst case.True or False and Why?
User Avatar
1 votes
0 answers
1363
Algorithms
Solve the recurrence relation $T(n) = T(\sqrt{n}) + n$
Solve the recurrence relation $T(n) = T(\sqrt{n}) + n$
User Avatar
0 votes
1 answer
1364
Recurrence Relation
Solve the following recurrence relation :- N(h)=N(h−1)+N(h−2)+1
Solve the following recurrence relation :-N(h)=N(h−1)+N(h−2)+1
User Avatar
0 votes
0 answers
1365
How to print the row having maximum no of 1's in a bit-array ?
If we have a n*n Bit-Array in which we have only 1's and 0's filled . Constraint is that in every row , 0 comes before 1 , so how to find the index of the row which has maximum no of 1's
If we have a n*n Bit-Array in which we have only 1's and 0's filled . Constraint is that in every row , 0 comes before 1 , so how to find the index of the row which has m...
User Avatar
1 votes
1 answer
1366
UBC Intermediate Algorithm Design and Analysis (CPSC 320) Summer 2009
Analyze the runtime of the following piece of code. Give a bound using Θ notation. function Pesky(n) r ←0; for i ←1 to n do for j ←1 to i do for k ← j to i+j do r ←r + 1; return r;
Analyze the runtime of the following piece of code. Give a bound using Θ notation.function Pesky(n)r ←0;for i ←1 to ndo for j ←1 to ido for k ← j to i+jdo r ←r...
User Avatar
3 votes
2 answers
1367
Test-series algorithms
What is the time complexity of following function fun()? Assume that log(x) returns log value in base 2. void fun() { int i, j; for (i=1; i<=n; i++) for (j=1; j<=log(i); j++) printf("GeeksforGeeks"); }
What is the time complexity of following function fun()? Assume that log(x) returns log value in base 2.void fun() { int i, j; for (i=1; i<=n; i++) for (j=1; j<=log(i); j...
User Avatar
0 votes
0 answers
1370
Introduction to Algorithm - Cormen
I didn't understand Big-O notation: This is CORMEN exercise problem - 3.1-2 Solution link: https://www.csee.umbc.edu/~nam1/TA/HWSols/hw1sol.pdf
I didn't understand Big-O notation: This is CORMEN exercise problem - 3.1-2Solution link: https://www.csee.umbc.edu/~nam1/TA/HWSols/hw1sol.pdf
User Avatar
0 votes
0 answers
1371
How many times GO is printed ?
int main() { int i = -5; While(i<=5){ if(i>=0) break; else { i++; continue; } printf("GO"); } return 0; }
int main() { int i = -5; While(i<=5){ if(i>=0) break; else { i++; continue; } printf("GO"); }return 0;}
User Avatar
0 votes
1 answer
1372
Self doubt
Is np Completeness is there in syllabus ? ,as it is not mentioned in syllabus.
Is np Completeness is there in syllabus ?,as it is not mentioned in syllabus.
User Avatar
1 votes
0 answers
1373
Testbook Algorithm-1 Q6
Iterated logarithmic function is defined as Which of the following is/are TRUE ? (i) log∗n=O(log(logn)) (ii) (log∗n)!=O(logn) (iii) (log∗n)^n=O((logn)!) i and ii only i and iii only ii and iii only i, ii and iii
Iterated logarithmic function is defined asWhich of the following is/are TRUE ?(i) log∗n=O(log(logn))(ii) (log∗n)!=O(logn)(iii) (log∗n)^n=O((logn)!)i and ii onlyi a...
User Avatar
0 votes
1 answer
1374
Introduction To Algorithms
T(N) = 3T(N/4) + NlogN T(N) = 2T(N/2)+ NlogN Master theorem applicable to this ??
T(N) = 3T(N/4) + NlogNT(N) = 2T(N/2)+ NlogNMaster theorem applicable to this ??
User Avatar
0 votes
0 answers
1375
#avl tree
what is the worst case possible height of an avl tree ??? https://www.geeksforgeeks.org/practice-questions-height-balancedavl-tree/ how does 1.44*logn comes ????
what is the worst case possible height of an avl tree ???https://www.geeksforgeeks.org/practice-questions-height-balancedavl-tree/how does 1.44*logn comes ????
User Avatar
2 votes
1 answer
1376
Algorithms - Matrix Chain Ordering
How to understand the nesting of for loops in these algorithms like which for loop comes under the other ?
How to understand the nesting of for loops in these algorithms like which for loop comes under the other ?
User Avatar
0 votes
0 answers
1378
Cormen 2nd edition page 584(Representing shortest path)
I read this topic many times but could understand. Plz anyone precise the idea
I read this topic many times but could understand. Plz anyone precise the idea
User Avatar
Page: