Register

Web Page

Searching, Sorting, Hashing, Asymptotic worst case time and Space complexity, Algorithm design techniques: Greedy, Dynamic programming, and Divide‐and‐conquer, Graph search, Minimum spanning trees, Shortest paths.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}& \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 2 &3&2&3&2&0&2&2&3&3&0&2.2&3
\\\hline\textbf{2 Marks Count} & 2 &3&4&4&2&4&2&3&2&3&2&2.9&4
\\\hline\textbf{Total Marks} & 6 &9&10&11&6&8&6&8&7&9&\bf{6}&\bf{8}&\bf{11}\\\hline
\end{array}}}$$

Filter

Hot questions in Algorithms

0 votes
1 answer
2221
time complexity
What is the time complexity of the following program? main() { i = n; while(i>=1) { i=i/2; i=i/3; i=i/5; i=i*10; i=i-10; } } I am getting actual answer as $\log _3n$+ n/10 = O(n). Please explain briefly.
What is the time complexity of the following program?main(){ i = n;while(i>=1) { i=i/2; i=i/3; i=i/5; i=i*10; i=i-10;}}I am getting actual ...
User Avatar
2 votes
1 answer
2223
Cormen 4.4-5
Use the recursion tree to determine a good asymptotic upper bound on the recurrence T(n)=T(n-1)+T($\frac{n}{2}$)+n. Use substitution method to verify the answer.
Use the recursion tree to determine a good asymptotic upper bound on the recurrence T(n)=T(n-1)+T($\frac{n}{2}$)+n. Use substitution method to verify the answer.
User Avatar
2 votes
1 answer
2224
Sorting
User Avatar
0 votes
1 answer
2225
time complexity
int Dosomething(int n) { if(n>=2) return 1; else return (floor(sqrt(n)))+n; } time complexity of the program?
int Dosomething(int n){if(n>=2)return 1;elsereturn (floor(sqrt(n)))+n;}time complexity of the program?
User Avatar
2 votes
3 answers
2226
time complexity of for loops
For(I=1 ; I<=n ; I++) { For(J=1 ; J<=I ; J++) { For(K=1 ; K<=n^5 ; K=15 × K) { x=y+z; } } } What is the time complexity of above code ?
For(I=1 ; I<=n ; I++) { For(J=1 ; J<=I ; J++) { For(K=1 ; K<=n^5 ; K=15 × K) { x=y+z; } } }What is the time complexity of above code ?
User Avatar
0 votes
1 answer
2228
#algorithm
15.4-1 is it right ??? ans is 6 ?? is there any other method to determine the lcs coz it requires time to compute till the whole traversal of matrix
15.4-1 is it right ???ans is 6 ??is there any other method to determine the lcs coz it requires time to compute till the whole traversal of matrix
User Avatar
0 votes
2 answers
2229
UGC NET CSE | June 2014 | Part 3 | Question: 33
________ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. Best first search Goal stack planning Alpha-beta pruning procedure Min-max search
________ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution.Best first searchGoal stack planning Alp...
User Avatar
0 votes
2 answers
2230
gate 1987
In GATE 1987 question, order of $\Sigma$O(n)$ was found to be $O(n^2)$. Similarly, what will be the answer for order of $\Sigma$O(n^2)$ ? Will it be of $O(n^3)$ ? Thanks!
In GATE 1987 question, order of $\Sigma$$O(n)$ was found to be $O(n^2)$.Similarly, what will be the answer for order of $\Sigma$$O(n^2)$ ? Will it be of $O(n^3)$ ?Thanks...
User Avatar
3 votes
0 answers
2231
Master theorem and extended Master theorem
I have doubt regarding Master theorem.In which situation we should use Normal Master theorem/extended Master theorem?
I have doubt regarding Master theorem.In which situation we should use Normal Master theorem/extended Master theorem?
User Avatar
1 votes
1 answer
2232
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
2233
Made easy workbook
Assume that merge sort algorithm in the worst case takes 30 seconds for an input of size 64 which of The following most closely approximates the maximum input size of a problem that can be solved in 6 minutes
Assume that merge sort algorithm in the worst case takes 30 seconds for an input of size 64 which of The following most closely approximates the maximum input size of a p...
User Avatar
0 votes
1 answer
2234
Heap Sort
Would it be possible to implement a variant of heapsort based on a perfectly balanced ternary structure in which the children of node $i$ are at positions $3i - 1, 3i$, and $3i + 1$, and if so what would be the advantages and disadvantages of the new method?
Would it be possible to implement a variant of heapsort based on a perfectly balanced ternary structure in which the children of node $i$ are at positions $3i - 1, 3i$, a...
User Avatar
0 votes
1 answer
2236
time complexity
Q- consider an array A of size K where each element is either 10 or 20 what is the minimum time required to sort an array A??????
Q- consider an array A of size K where each element is either 10 or 20 what is the minimum time required to sort an array A??????
User Avatar
1 votes
2 answers
2238
Self-Doubt
What will be the solution of the following recurrence? $T(n)=3T\sqrt{n}+\log(n)$
What will be the solution of the following recurrence?$$T(n)=3T\sqrt{n}+\log(n)$$
User Avatar
3 votes
0 answers
2239
quick sort..plz tell the algo also
Which of the following cannot be the intermediate sequence if we apply quick sort on 9,8,7,6,5,4,3,2,1? Assume the pivot is always the first element A) 1,8,7,6,5,4,3,2,9 B) 1,2,3,6,5,4,7,8,9 C) 1,2,7,6,5,4,3,8,9 D) 1,2,3,5,4,6,7,8,9
Which of the following cannot be the intermediate sequence if we apply quick sort on 9,8,7,6,5,4,3,2,1?Assume the pivot is always the first elementA) 1,8,7,6,5,4,3,2,9B) ...
User Avatar
0 votes
0 answers
2240
selfdoubt
<p><a href="https://gateoverflow.in/224778/searching">https://gateoverflow.in/224778/searching</a></p> <p>what is actual answer becz using two pointers at extremes we are not able to do for all cases .....????</p>
<p><a href="https://gateoverflow.in/224778/searching">https://gateoverflow.in/224778/searching</a></p <p>what is actual answer becz using two pointers at extremes we are ...
User Avatar
Page: