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

1 votes
0 answers
1981
#madeeasy test series
User Avatar
1 votes
0 answers
1983
Sorting
Consider an execution of Quicksort with the first item of an array segment acting as pivot or splitter. After first pass of running quicksort on an array (Assume that we are sorting with increasing order)? 12,18,17,11,13,15,16,10 I want to know what will be the sequence for the first pass
Consider an execution of Quicksort with the first item of an array segment acting as pivot or splitter. After first pass of running quicksort on an array (Assume that we ...
User Avatar
1 votes
0 answers
1984
#algo
User Avatar
1 votes
0 answers
1986
#sorting
User Avatar
0 votes
1 answer
1990
Doubt
If the edge weight of minimum spanning tree are given and edge weight of each edge is distinct, then the minimum value of sum (a, b, c, d, e, f, g) is __________.
If the edge weight of minimum spanning tree are given and edge weight of each edge is distinct, then the minimum value of sum (a, b, c, d, e, f, g) is __________.
User Avatar
0 votes
0 answers
1992
test series
Which of the following statement(s) is/are correct? P: DFS can be used for finding shortest paths in unweighted graphs and can also be used testing bipartiteness Q: BFS can be used for topological sorting and finding strongly connected components.
Which of the following statement(s) is/are correct?P: DFS can be used for finding shortest paths in unweighted graphs and can also be used testing bipartitenessQ: BFS can...
User Avatar
0 votes
0 answers
1993
graph theory
if graph have articulation point then will it be hamiltonian graph?
if graph have articulation point then will it be hamiltonian graph?
User Avatar
0 votes
0 answers
1994
gate notebook
In a sorted array find a&b such that a+b>1000 Given array is 100 200 300 400 500 600 700 800
In a sorted array find a&b such that a+b>1000Given array is 100 200 300 400 500 600 700 800
User Avatar
1 votes
1 answer
1995
test series
Arrange the following functions in asymptotically increasing order f1(n) = n0.999999 log n f2(n) = 10000000n Please explain your solution. Thanks
Arrange the following functions in asymptotically increasing orderf1(n) = n0.999999 log nf2(n) = 10000000nPlease explain your solution. Thanks
User Avatar
0 votes
0 answers
1996
ALGORITHM
User Avatar
0 votes
2 answers
1997
Algo-test
Let f (n) = Ο(n), g(n) = Ο(n) and h(n) = θ(n). Then [f (n) . g(n)] + h(n) is : a) Ο(n) b)θ(n) I think it must be 0(n)
Let f (n) = Ο(n), g(n) = Ο(n) and h(n) = θ(n).Then [f (n) . g(n)] + h(n) is : a) Ο(n) b)θ(n)I think it must be 0(n)
User Avatar
0 votes
0 answers
1998
self doubt
please aswer it with some explainnation max(O(n),Ω(n)) =? max((Θ(n),O(n))=?
please aswer it with some explainnationmax(O(n),Ω(n)) =?max((Θ(n),O(n))=?
User Avatar
0 votes
1 answer
1999
doubt in asymptotic notation
given : 1/4 and 1 1/4 = theta(1) is this correct or only this 1/4 = O(1)
given : 1/4 and 1 1/4 = theta(1)is this corrector only this 1/4 = O(1)
User Avatar
0 votes
0 answers
2000
big o doubt
1/n = O(1) is this relationship valid always
1/n = O(1) is this relationship valid always
User Avatar
Page: