Register
Webpage for Algorithms

Recent questions tagged algorithms

1 votes
1 answer
1891
Strongly connected graph verification via BFS
Hi Guys, DFS could be used for finding directed graph is strongly connected or not. But could we use BFS also ? Please share your valuable opinion. ping @Kushagra Chatterjee, @Soumya29, @srestha, @Subarna Das and @VS ji.
Hi Guys,DFS could be used for finding directed graph is strongly connected or not. But could we use BFS also ? Please share your valuable opinion.ping @Kushagra Chatterje...
User Avatar
0 votes
1 answer
1893
self doubt apply
can masters theorem be used when base condition is given in a recurrence ? can we directly apply masters theorem to any recurrence ?
can masters theorem be used when base condition is given in a recurrence ?can we directly apply masters theorem to any recurrence ?
User Avatar
2 votes
1 answer
1895
time complexity
operation on the list in this order O(sqrt n)insert,O(nlog n) decrease key ,O(n) find operations. What is the time complexity of all these operations put together ?
operation on the list in this order O(sqrt n)insert,O(nlog n) decrease key ,O(n) find operations. What is the time complexity of all these operations put together ?
User Avatar
5 votes
2 answers
1897
Time Complexity
Consider the following function Void func(int n){ Int k=n; Int i=0; for(;i<n;i++){ while(k>1){ k>>=1; } } What is the worst case time complexity of the function?
Consider the following functionVoid func(int n){Int k=n;Int i=0;for(;i<n;i++){while(k>1){k>>=1;}}What is the worst case time complexity of the function?
User Avatar
3 votes
0 answers
1899
Shortest Path
First Statement is true. But I don't know about second?
First Statement is true. But I don't know about second?
User Avatar
1 votes
0 answers
1900
MST Kruskal
First statement is False because complexity will be O(E2). I think the second statement is true? But not sure
First statement is False because complexity will be O(E2).I think the second statement is true? But not sure
User Avatar
2 votes
1 answer
1901
algorithm
Suppose A is sorted array and some of the elements are duplicates what is the best upper bound to find out the number of elements that are equal to any given key 'k'.
Suppose A is sorted array and some of the elements are duplicates what is the best upper bound to find out the number of elements that are equal to any given key 'k'.
User Avatar
5 votes
1 answer
1902
Testbook Test Series
User Avatar
3 votes
1 answer
1904
Trees
Number of rooted labeled trees(i.e. each node can be the root) with 6 vertices is:
Number of rooted labeled trees(i.e. each node can be the root) with 6 vertices is:
User Avatar
1 votes
1 answer
1906
Fibonacci-Sequence
Which of the following is true about time complexity for generating $\color{blue} {n^{th}}$ Fibonacci number ? a)$O(n)$ b)$O(Logn)$ c)$O(2^n)$ d)$\Omega(n)$
Which of the following is true about time complexity for generating $\color{blue} {n^{th}}$ Fibonacci number ? a)$O(n)$b)$O(Logn)$c)$O(2^n)$d)$\Omega(n)$
User Avatar
0 votes
1 answer
1907
Knapsack problem
5.Consider the Knapsack instance with 5 objects and a capacity M=11, profit P=(5,4,7,2,3) and weight W=(4,3,6,2,2.). Solve it using dynamic programming approach.
5.Consider the Knapsack instance with 5 objects and a capacity M=11, profit P=(5,4,7,2,3) andweight W=(4,3,6,2,2.). Solve it using dynamic programming approach.
User Avatar
1 votes
0 answers
1908
Prim's algorithm for MST
Assuming that the graph can contain repeated edge weights, we have a single tree at any instance when applying Prim's algorithm. Justify this statement.
Assuming that the graph can contain repeated edge weights, we have a single tree at any instance when applying Prim's algorithm.Justify this statement.
User Avatar
1 votes
1 answer
1909
Asymptotic
which is asymptotically greater n or $2^{logn}$
which is asymptotically greater n or $2^{logn}$
User Avatar
2 votes
1 answer
1911
Kruskal
Can Anyone provide all the data structure that we can used and time complexity that we get for Kruskal algorithm of finding the minimum spanning tree.
Can Anyone provide all the data structure that we can used and time complexity that we get for Kruskal algorithm of finding the minimum spanning tree.
User Avatar
5 votes
0 answers
1913
Time Complexity
//n is a prime number here int main() { for(i=1;i<=n;i=2*i) { for(j=1;j<=n;j++) { if(n%i==0) { k=1; while(k<=n) { a=b+c; k=k+1; } } } } }
//n is a prime number hereint main() { for(i=1;i<=n;i=2*i) { for(j=1;j<=n;j++) { if(n%i==0) { k=1; while(k<=n) { a=b+c; k=k+1; } } } } }
User Avatar
0 votes
0 answers
1914
MERGE SORT
IS 2 way merge sort and normal merge sort is same.in which we have to use bottom-up merging approach by taking 2-2 element inside the list.if 5-way merge sort then in the list we have to take 5-5 elements from bottom to up for merging. if I am wrong please let me correct!
IS 2 way merge sort and normal merge sort is same.in which we have to use bottom-up merging approach by taking 2-2 element inside the list.if 5-way merge sort then in the...
User Avatar
1 votes
0 answers
1915
Algorithm
True or False Explain Bellman Ford can never find shortest path of a graph Floyd Warshall can find shortest path of a graph
True or False ExplainBellman Ford can never find shortest path of a graphFloyd Warshall can find shortest path of a graph
User Avatar
0 votes
0 answers
1916
#doubt algo
What is the disadvantage of avl tree over b tree ??
What is the disadvantage of avl tree over b tree ??
User Avatar
0 votes
0 answers
1918
Most efficient data structure to implement Sets of Integer and what is the complexity of operation......
Most efficient data structure to implement Sets of Integer and what is the complexity of operationinsert(int e),delete(int e),isMember(int e) : returns TRUE if member oth...
User Avatar
0 votes
0 answers
1920
Algorithm
1. What is the time complexity to design BST from given postorder and inorder traversal? 2. What is the time complexity to design BST from given postorder only. I know time to design BST from Preorder is O(n).
1. What is the time complexity to design BST from given postorder and inorder traversal?2. What is the time complexity to design BST from given postorder only. I know tim...
User Avatar
Page: