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

Most viewed questions in Algorithms

1 votes
0 answers
2462
problem on back edge
Can someone provide good example to illustrate cross edge,back edge ,forward edge?
Can someone provide good example to illustrate cross edge,back edge ,forward edge?
User Avatar
1 votes
1 answer
2463
Doubt
In Randomized Quick sort, Can we have partitioning algorithm that never gives worst case as $O(n^2)$ for every input?
In Randomized Quick sort, Can we have partitioning algorithm that never gives worst case as $O(n^2)$ for every input?
User Avatar
2 votes
1 answer
2464
Can anyone make the table of Complexities, No. of swaps required for N elements for all type of sorts?
If possible,. all 3 cases (best,average, worst)
User Avatar
1 votes
2 answers
2466
Asymptotic notations
g(n)=Ώ(n) h(n)=O(n) g(n) . h(n) =?
g(n)=Ώ(n)h(n)=O(n)g(n) . h(n) =?
User Avatar
0 votes
1 answer
2468
Merge Sort
The best case time complexity to merge two sorted file of size m and n is A. O(m) B. O(n) C. O(MIN{m,n}) D. O(m+n)
The best case time complexity to merge two sorted file of size m and n isA. O(m) B. O(n) C. O(MIN{m,n}) D. O(m+n)
User Avatar
1 votes
2 answers
2469
Asymptotic
User Avatar
1 votes
0 answers
2470
Test Series
User Avatar
2 votes
0 answers
2471
complexity
User Avatar
1 votes
0 answers
2472
algorithm
Which is not O(n^2)? a) (15^10) *n +12099 b) n^1.98 c) n^3 / sqrt(n) d) (2^20)*n
Which is not O(n^2)?a) (15^10) *n +12099b) n^1.98c) n^3 / sqrt(n)d) (2^20)*n
User Avatar
0 votes
1 answer
2473
SELF DOUBT
https://gateoverflow.in/1036/gate2004-39 WHAT IS DIFFERENCE BETWEEN TYM COMPLEXITY AND PROGRAM EXECUTION TIME??
https://gateoverflow.in/1036/gate2004-39WHAT IS DIFFERENCE BETWEEN TYM COMPLEXITY AND PROGRAM EXECUTION TIME??
User Avatar
0 votes
1 answer
2475
algo questions
in case of comparision sort max possible is n(n-1)/2
in case of comparision sort max possible is n(n-1)/2
User Avatar
0 votes
1 answer
2476
merge sort
n sorted subarrays each of size log n. find single sorted array with all elements.find time complexity
n sorted subarrays each of size log n. find single sorted array with all elements.find time complexity
User Avatar
0 votes
1 answer
2477
ADA Algortihms
Is longest common palindromic subsequence a part of GATE syllabus?
Is longest common palindromic subsequence a part of GATE syllabus?
User Avatar
0 votes
0 answers
2480
Heapsort, Space complexity
Could anyone explain Why the space complexity of heapsort is O(1)??
Could anyone explain Why the space complexity of heapsort is O(1)??
User Avatar
Page: