Register
Webpage for Algorithms

Recent questions tagged algorithms

0 votes
1 answer
1502
Doubt
Consider a stack is used to evaluate fully parenthesized arithmetic expression from left to right. Each opperand is placed on the stack and operators operate on top two elements of the stack. The minimum size of stack required to evaluate given expression is ________.
Consider a stack is used to evaluate fully parenthesized arithmetic expression from left to right. Each opperand is placed on the stack and operators operate on top two e...
User Avatar
0 votes
2 answers
1503
Doubt
Consider A be a 2-dimensional array declared as follows: A[15] [15] of integers. Assume each integer take 1B. The array stored in row major order and first element of array is stored at location 1000, then the address of element a[10] [6] is ________ B.
Consider A be a 2-dimensional array declared as follows: A[15] [15] of integers. Assume each integer take 1B. The array stored in row major order and first element of arr...
User Avatar
1 votes
1 answer
1504
Time complexity
show how to sort n number in the range [0,n^2-1] in O(n)time?
show how to sort n number in the range [0,n^2-1] in O(n)time?
User Avatar
0 votes
1 answer
1506
Doubt
Consider f (n), g(n) and h(n) be function defined as follows: Which of the following represents correct asymptotic solution for f (n) + [g(n) × h(n)]? A . Omega(n^3) B. O(n^4) C. Theta(n^4) D. O(n^3) What should be the correct way of solving such questions ?
Consider f (n), g(n) and h(n) be function defined as follows:Which of the following represents correct asymptotic solution for f (n) + [g(n) × h(n)]?A . Omega(n^3)B. ...
User Avatar
0 votes
1 answer
1515
MadeEasy Test Series: Algorithms - Greedy Algorithm
Consider the following message: The number of bits required for huffman encoding of the above message are __________? My Strategy:- But the answer given is 52bits i used standard Algorithem Made Easy Solution :-
Consider the following message:The number of bits required for huffman encoding of the above message are __________?My Strategy:- But the answer given is 52bits i used st...
User Avatar
3 votes
1 answer
1516
time complexity
$f(n)=2n^2+ n log n$ $g(n)= \dfrac{n}{logn} + log^2n$ then $f(n)\times g(n)$ is: $n^2logn$ $\dfrac{n^3}{logn}$ $n^3log^2n$ $n^2log^2n$
$f(n)=2n^2+ n log n$$g(n)= \dfrac{n}{logn} + log^2n$ then $f(n)\times g(n)$ is:$n^2logn$$\dfrac{n^3}{logn}$$n^3log^2n$$n^2log^2n$
User Avatar
4 votes
1 answer
1518
Minimum Spanning Tree
1) Kruskal Algorithm 2) Prims Algorithm 3) Dijkstra Algorithm 4) Bellman Ford Algorithm 5) Floyd Warshall Algorithm Among these which one works for only i) Positive edge weight ii) Negative edge weight iii) Negative weight cycle
1) Kruskal Algorithm2) Prims Algorithm3) Dijkstra Algorithm4) Bellman Ford Algorithm5) Floyd Warshall AlgorithmAmong these which one works for onlyi) Positive edge weight...
User Avatar
0 votes
3 answers
1519
#Algorithms #MST Doubt in MST Questions.
Question 1) The shortest-path tree computed by Dijkstra's algorithm is necessarily an MST? Question2 ) Prim's algorithm works with negative weighted edges?
Question 1) The shortest-path tree computed by Dijkstra's algorithm is necessarily an MST?Question2 ) Prim's algorithm works with negative weighted edges?
User Avatar
0 votes
1 answer
1520
SELF_DOUBT(MST)
What important point we keep in mind while finding the #(number) of spanning tree ?? from the given graph
What important point we keep in mind while finding the #(number) of spanning tree ?? from the given graph
User Avatar
0 votes
1 answer
1521
Spanning trees
Suppose that a graph G has a minimum spanning tree already computed. How quickly can we update the minimum spanning tree if we add a new vertex and incident edges to G?
Suppose that a graph G has a minimum spanning tree already computed. How quickly can we update the minimum spanning tree if we add a new vertex and incident edges to G?
User Avatar
0 votes
1 answer
1522
Self Doubt
How can we distinguish b/w back edge, the forward edge and cross edge in BFS or DFS traversal in Graphs?
How can we distinguish b/w back edge, the forward edge and cross edge in BFS or DFS traversal in Graphs?
User Avatar
0 votes
2 answers
1525
#Algorithms #MST Self Doubt.
Let G be a connected simple graph with non distinct edge weights. Now, e be the lightest edge in G. So, does this edge e is present in every MST of G? My take - when all edge weights are same then lightest edge e won't be there.
Let G be a connected simple graph with non distinct edge weights. Now, e be the lightest edge in G. So, does this edge e is present in every MST of G?My take - when all e...
User Avatar
0 votes
0 answers
1528
Recursion Tree
What is the max height of recursion tree of recurrence $c(100,50)$? here, the recursive function is defined as $c(n,k) = c(n-1,k-1) + c(n,k-1)$ terminating condition $c(n,n) = 1, c(n,0) = 1$.
What is the max height of recursion tree of recurrence $c(100,50)$?here, the recursive function is defined as$c(n,k) = c(n-1,k-1) + c(n,k-1)$terminating condition$c(n,n) ...
User Avatar
0 votes
1 answer
1529
Cormen 3rd edition Exercise 4.4.9
Use a recursion tree to give an asymptotically tight solution to the recurrence T(n) =T(an)+T((1-a)n)+cn, where a is constant in the range 0<a<1 and c>0 is also a constant.
Use a recursion tree to give an asymptotically tight solution to the recurrenceT(n) =T(an)+T((1-a)n)+cn, where a is constant in the range 0<a<1 and c>0 is also a constant...
User Avatar
1 votes
1 answer
1530
Time Complexity
Please find the time complexity of the following code:-int i,s1; i=1,s1=1; while(s1<=n) { i++; s1+=s1+i; printf("Hope"); }
Please find the time complexity of the following code:-int i,s1;i=1,s1=1; while(s1<=n) { i++; s1+=s1+i; printf("Hope"); }
User Avatar
Page: