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

Recent questions in Algorithms

0 votes
0 answers
331
#Robot tour optimization
I recently came across one problem solving topic called "The Robot tour optimization" but I couldn't get it. Can someone explain what is this?
I recently came across one problem solving topic called "The Robot tour optimization" but I couldn't get it. Can someone explain what is this?
User Avatar
5 votes
1 answer
333
Applied Test Series
Given the following undirected graph, the cost of the minimal spanning tree of the graph is ____.
Given the following undirected graph, the cost of the minimal spanning tree of the graph is ____.
User Avatar
1 votes
1 answer
334
Self doubt
what is significance of loop Invariant? when we use a loop in an algo we check it , if it properly runs then fix it in that, then why do check separately loop invariant ?
what is significance of loop Invariant?when we use a loop in an algo we check it , if it properly runs then fix it in that, then why do check separately loop invariant ?
User Avatar
0 votes
1 answer
335
My doubt
What will be the recurrence relation for max heapify. Please explain with example.
What will be the recurrence relation for max heapify. Please explain with example.
User Avatar
1 votes
1 answer
336
Applied Test Series
What is the correct order ?
What is the correct order ?
User Avatar
2 votes
2 answers
337
Applied Test Series
Consider an array contains n integers, each integer belongs to {0, 1, 2}. What is the best case time complexity to sort an array?
Consider an array contains n integers, each integer belongs to {0, 1, 2}. What is the best case time complexity to sort an array?
User Avatar
0 votes
2 answers
338
Sorting(Algorithms)
The complexity of comparison based sorting algorithm is (nlogn) .How?
The complexity of comparison based sorting algorithm is (nlogn) .How?
User Avatar
0 votes
0 answers
339
Can anyone keep the solution manual of Horowitz and sahani introduction to algo textbook
Can anyone please keep the solution manual of Horowitz and sahani introduction to algorithms textbook
Can anyone please keep the solution manual of Horowitz and sahani introduction to algorithms textbook
User Avatar
0 votes
1 answer
340
Master Theorm
which formula to use in master theorm
which formula to use in master theorm
User Avatar
1 votes
1 answer
341
Applied gate demo test
Consider the following function int foo(int n) { int p = 1 ; if (n && !(n&(n-1))) return n; while (p<n) { p <<= 1; } return p; } What is the worst case time complexity of function foo(n)
Consider the following function int foo(int n){int p = 1 ;if (n && !(n&(n-1))) return n; while (p<n){p <<= 1;}return p;}What is the worst case time complexity of function...
User Avatar
1 votes
1 answer
342
I have a doubt in this Question , please give me hint
In a randomised BST is constructing with 7 distinct elements . What is the probability that its Inorder and postOrder traversal are same
In a randomised BST is constructing with 7 distinct elements . What is the probability that its Inorder and postOrder traversal are same
User Avatar
0 votes
1 answer
343
personal doubt
The tightest lower bound on the number of swaps, in the worst case, for comparison-based sorting is of the order of __________.
The tightest lower bound on the number of swaps, in the worst case, for comparison-based sorting is of the order of __________.
User Avatar
14 votes
4 answers
348
GATE CSE 2021 Set 2 | Question: 8
What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size $n$? $\Theta ( \sqrt{n})$ $\Theta (\log _2(n))$ $\Theta(n^2)$ $\Theta(n)$
What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size $n$?$\Theta ( \sqrt{n})$$\Theta (\log _2(n))$$\Theta...
User Avatar
Page: