Register
Webpage for Algorithms

Recent questions tagged algorithms

0 votes
0 answers
1741
test series
Which of the following statement(s) is/are correct? P: DFS can be used for finding shortest paths in unweighted graphs and can also be used testing bipartiteness Q: BFS can be used for topological sorting and finding strongly connected components.
Which of the following statement(s) is/are correct?P: DFS can be used for finding shortest paths in unweighted graphs and can also be used testing bipartitenessQ: BFS can...
User Avatar
0 votes
0 answers
1742
gate notebook
In a sorted array find a&b such that a+b>1000 Given array is 100 200 300 400 500 600 700 800
In a sorted array find a&b such that a+b>1000Given array is 100 200 300 400 500 600 700 800
User Avatar
1 votes
1 answer
1743
test series
Arrange the following functions in asymptotically increasing order f1(n) = n0.999999 log n f2(n) = 10000000n Please explain your solution. Thanks
Arrange the following functions in asymptotically increasing orderf1(n) = n0.999999 log nf2(n) = 10000000nPlease explain your solution. Thanks
User Avatar
0 votes
2 answers
1744
Algo-test
Let f (n) = Ο(n), g(n) = Ο(n) and h(n) = θ(n). Then [f (n) . g(n)] + h(n) is : a) Ο(n) b)θ(n) I think it must be 0(n)
Let f (n) = Ο(n), g(n) = Ο(n) and h(n) = θ(n).Then [f (n) . g(n)] + h(n) is : a) Ο(n) b)θ(n)I think it must be 0(n)
User Avatar
0 votes
1 answer
1745
doubt in asymptotic notation
given : 1/4 and 1 1/4 = theta(1) is this correct or only this 1/4 = O(1)
given : 1/4 and 1 1/4 = theta(1)is this corrector only this 1/4 = O(1)
User Avatar
1 votes
1 answer
1746
ACE test series
please help me to understand
please help me to understand
User Avatar
2 votes
0 answers
1747
DAA: growth of functions
Can someone please prove or disprove the following conjecture? 1. Let f(n) be a asymptotically positive function. $f(n) + o(f(n)) = \Theta(f(n))$ Note that this is small-oh.
Can someone please prove or disprove the following conjecture?1. Let f(n) be a asymptotically positive function.$f(n) + o(f(n)) = \Theta(f(n))$Note that this is small-oh....
User Avatar
1 votes
1 answer
1749
Master Theorem
T(n) = 2T(n/2) + nlogn a. O(nlogn) b.n(log^2n) c.O(n^2)
T(n) = 2T(n/2) + nlogna. O(nlogn)b.n(log^2n)c.O(n^2)
User Avatar
0 votes
0 answers
1751
Question
Insert these element in avl tree 15,20,24,10,13,7,30,36,25 And then delete 24,20 Please explain step by step I am confuse
Insert these element in avl tree15,20,24,10,13,7,30,36,25And then delete 24,20Please explain step by stepI am confuse
User Avatar
4 votes
1 answer
1753
ISRO-DEC2017-20
Match the following and choose the correct answer for the order $A,B,C,D$ ... -s, c-p, d-q a-r, b-p, c-s, d-q a-q, b-s, c-p, d-r a-s, b-p, c-q, d-r
Match the following and choose the correct answer for the order $A,B,C,D$$$\begin{array}{|ll|ll|}\hline \text{A.} & \text{Strassen matrix multiplication} & \text{p.} & ...
User Avatar
2 votes
0 answers
1755
Please solve this Q
User Avatar
1 votes
1 answer
1758
Greedy vs Dynamic
Unlike greedy algorithms, dynamic programming method always provide correct/optimal solution. Is the above statement correct?
Unlike greedy algorithms, dynamic programming method always provide correct/optimal solution.Is the above statement correct?
User Avatar
2 votes
1 answer
1759
Minimum Spanning tree
If a simple undirected graph with positive weighted edges has 10 vertices and 30 edges, such that the cost of the Minimum Spanning tree is 59. Now, if all the edges weights are increased by 2, then the cost of the new MST is
If a simple undirected graph with positive weighted edges has 10 vertices and 30 edges, such that the cost of the Minimum Spanning tree is 59. Now, if all the edges weigh...
User Avatar
1 votes
1 answer
1760
Find the element that appears once in a sorted array.
In a sorted array, every element is repeated more than once except one. what will be the time complexity to find that element in the worst case?
In a sorted array, every element is repeated more than once except one. what will be the time complexity to find that element in the worst case?
User Avatar
0 votes
1 answer
1761
Bellman Ford algorithm
Consider the statements True/ False Bellman Ford algorithm reports a shortest path from source to a destination only in a directed graph which has a negative cycle.
Consider the statements True/ FalseBellman Ford algorithm reports a shortest path from source to a destination only in a directed graph which has a negative cycle.
User Avatar
2 votes
1 answer
1762
Optimal Merge Pattern
Given a set of sorted files f1,f2,f3,f4,f5 of lengths 99,27,71,199,259 we need to merge these files into a single sorted file Using Optimal Merge Pattern.
Given a set of sorted files f1,f2,f3,f4,f5 of lengths 99,27,71,199,259 we need to merge these files into a single sorted file Using Optimal Merge Pattern.
User Avatar
0 votes
1 answer
1763
Asymtotic notations
In the context of merge sort, which of the following are true? $1.\ T(n)\ =\ o(n^2)\\ 2.\ T(n)\ =\ O(n^2)\\3.\ T(n)\ =\ \omega(n)\\4.\ T(n)\ =\ \Omega(n) $
In the context of merge sort, which of the following are true?$1.\ T(n)\ =\ o(n^2)\\ 2.\ T(n)\ =\ O(n^2)\\3.\ T(n)\ =\ \omega(n)\\4.\ T(n)\ =\ \Omega(n) $
User Avatar
0 votes
0 answers
1764
BFS traversal sequence
Starting vertex is : $V_1$ Find the BFS traversal sequence
Starting vertex is : $V_1$Find the BFS traversal sequence
User Avatar
0 votes
1 answer
1765
more than n/2
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is Θ(n) Θ(logn) Θ(log∗n) Θ(1) isnt O(1) enough for this.....the answer give in this site is log N can i get a counter on why O(1) wont work ?
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers isΘ(n)Θ(logn)Θ(log∗n)Θ(1)isnt O(1)...
User Avatar
9 votes
2 answers
1769
TIFR CSE 2018 | Part B | Question: 3
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ? $1$ $2$ $4$ $6$ $8$
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ?$1$$2$$4$$6$$8$
User Avatar
Page: