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
2 answers
2141
Time complexity
Find the time complexity using Master's theorem : (Also mention if Master's theorem can't be applied why not?) T(n)=2T(n/2)+nlogn
Find the time complexity using Master's theorem : (Also mention if Master's theorem can't be applied why not?)T(n)=2T(n/2)+nlogn
User Avatar
0 votes
0 answers
2142
algorithms
please help me how to solve this question fast and the method known to me take really a lot time and ans I got is not matching.
please help me how to solve this question fast and the method known to me take really a lot time and ans I got is not matching.
User Avatar
0 votes
0 answers
2143
Time Complexity
User Avatar
0 votes
2 answers
2144
Algorithms doubt
F(n)=n^(sin n) G(n)=n^(cos n) Why they are non comparable.
F(n)=n^(sin n)G(n)=n^(cos n)Why they are non comparable.
User Avatar
3 votes
1 answer
2145
Online and Offline Sorting Algorithms
How to know that whether a sorting algorithm is online or offline ? For example , Insertion sort is online but Merge Sort is offline..Please explain ..
How to know that whether a sorting algorithm is online or offline ? For example , Insertion sort is online but Merge Sort is offline..Please explain ..
User Avatar
0 votes
2 answers
2147
Test by Bikram | Algorithms | Test 2 | Question: 15
The length of the longest common subsequence of $L = ( 1,0,0,1,0,1,0,1 )$ and $K =( 0,1,0,1,1,0,1,1,0 )$ is __________.
The length of the longest common subsequence of $L = ( 1,0,0,1,0,1,0,1 )$ and $K =( 0,1,0,1,1,0,1,1,0 )$ is __________.
User Avatar
1 votes
2 answers
2149
Radix sort
User Avatar
0 votes
2 answers
2150
time complexity
main() { int i,count; for (i=1; i<=n; i++) { for(i=1; i<=(n*n); i++) { for(i=1; i<=(n*n*n); i++) { count++; } } } } What will be the time complexity of the given program?
main() { int i,count; for (i=1; i<=n; i++) { for(i=1; i<=(n*n); i++) { for(i=1; i<=(n*n*n); i++) { count++; } } } }What will be the time complexity of the given program?
User Avatar
1 votes
1 answer
2151
REGARDING SYLLABUS
TOPICS LIKE P,NP COMPLETE IS IN SYLLABUS????????
TOPICS LIKE P,NP COMPLETE IS IN SYLLABUS????????
User Avatar
0 votes
0 answers
2152
time complexity
how substitution of variables in master theoram take place
how substitution of variables in master theoram take place
User Avatar
0 votes
1 answer
2153
Ace Algorithms
If k is a positive constant, then the following divide and conquer recurrence evaluates to? T(n) = k ; n=1 T(n) = 3 T (n/2) + kn ;n>1 a)T(n)= 3kn2-kn b)T(n)=3kn log23 - 2kn c)T(n)=3knlog23 - kn d)T(n)=3kn2-2knlog23
If k is a positive constant, then the following divide and conquer recurrence evaluates to?T(n) = k ; n=1T(n) = 3 T (n/2) + kn ;n>1a)T(n)= 3kn2-knb)T(n)=3kn log23 - 2knc...
User Avatar
1 votes
0 answers
2155
Asymptotic Notation
User Avatar
0 votes
1 answer
2157
Ace Algorithms
The number of comparisons that are necessary and sufficient for finding both the largest and smallest element in a set of n elements is? a) (3n/2) - 2 b) 2n-2 c) (3n/2) -1 d) None of these
The number of comparisons that are necessary and sufficient for finding both the largest and smallest element in a set of n elements is?a) (3n/2) - 2b) 2n-2c) (3n/2) -1d)...
User Avatar
0 votes
1 answer
2159
Masters theorem
Solve by using master's theorem
Solve by using master's theorem
User Avatar
Page: