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
4351
true or false?
T1(n)=O(f(n)) T2(n)=O(f(n)) then check T/F? .T1(n)+T2(n)=O(f(n)) .T1(n)=O(T2(n)) .T1(n)=$\omega$(T2(n)) .T1(n)=${\color{Red} \Theta }$(T2(n))
T1(n)=O(f(n))T2(n)=O(f(n))then check T/F?.T1(n)+T2(n)=O(f(n)).T1(n)=O(T2(n)).T1(n)=$\omega$(T2(n)).T1(n)=${\color{Red} \Theta }$(T2(n))
User Avatar
1 votes
1 answer
4352
Given n points in the xy plane, what is the time complexity to find the closest pair?
what is the approach of this question , Is it that first we will traverse all the pairs then find the minimum distance between all the pairs
what is the approach of this question , Is it that first we will traverse all the pairs then find the minimum distance between all the pairs
User Avatar
1 votes
1 answer
4353
Give the result of partitioning the keys after the 1st pass of quicksort.
THISCOURSEISOVER Choose the last elements as pivot elements (R). Also for duplicates, adopt the convention that both pointers stop. a) EHIOCOIERRUSSVTS b) EHISCOIERRUSOVTS b) EHIOCOUESRTSSVTR c) EHIOOCIERRUSSVTS
THISCOURSEISOVERChoose the last elements as pivot elements (R). Also for duplicates, adopt the convention that both pointers stop.a) EHIOCOIERRUSSVTSb) EHISCOIERRUSOVTSb)...
User Avatar
1 votes
2 answers
4358
single source shortest path algorithm
When can we have single source shortest path algorihm runs in Big Oh of number of edges. Options are like weighted graph, undirected graph, undirected and weighted, not possilbe (i dont remember all the options)
When can we have single source shortest path algorihm runs in Big Oh of number of edges.Options are like weighted graph, undirected graph, undirected and weighted, not po...
User Avatar
0 votes
3 answers
4360
Asymptotic Notation
Describe a Θ(nlgn)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exists two elements of S whose sum is exactly x.
Describe a Θ(nlgn)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exists two elements of S whose sum is exactly ...
User Avatar
0 votes
1 answer
4361
What is the maximum number of topological sorting possible ?
For a given set of vertices , can we compute the maximum number of topological sortings possible ?
For a given set of vertices , can we compute the maximum number of topological sortings possible ?
User Avatar
0 votes
1 answer
4364
what is the tightest lower bound of the below pseudo-code ?
int isprime(int n ) { for(int i=2;i<=sqrt(n) ; i++) { if(n%i==0) { not prime } }
int isprime(int n ){for(int i=2;i<=sqrt(n) ; i++){if(n%i==0){not prime}}
User Avatar
1 votes
1 answer
4365
What is the proper order in which we can arrange the sorting algos in terms of the number of swap operations they do ?
I am not getting which algorithm has minimum no of swap operations , acc to me both selection and insertion should be at the lowest level as well as merge sort since afte...
User Avatar
2 votes
2 answers
4366
Find Time complexity
User Avatar
1 votes
1 answer
4367
BFS DFS
User Avatar
1 votes
1 answer
4369
Solve the recurrence
T(n) = T(n - 1) + 1/n a) O(1) b) O(n) c) O(log n) d) O(log log n)
T(n) = T(n - 1) + 1/na) O(1)b) O(n)c) O(log n)d) O(log log n)
User Avatar
1 votes
3 answers
4370
which of the following is correct
which of the following is correct?
which of the following is correct?
User Avatar
Page: