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

2 votes
1 answer
2161
Dijkstra shorest path algorithm
if Dijkstra shorest path algorithm takes 8 second for a graph of 1000 nodes then approximatly how much time would it take for a graph of 1000000 nodes. a) 8000000 sec. b) 8000 sec. c) 16000 sec. d)16000000 sec.
if Dijkstra shorest path algorithm takes 8 second for a graph of 1000 nodes then approximatly how much time would it take for a graph of 1000000 nodes.a) 8000000 sec.b) 8...
User Avatar
1 votes
1 answer
2163
Algorithm Complexity problem
T(n) = 4T(sqrt(n)) + (logn)^5 Find Time complexity.(n=2^k) Give detailed answer , how to derive it.
T(n) = 4T(sqrt(n)) + (logn)^5Find Time complexity.(n=2^k)Give detailed answer , how to derive it.
User Avatar
0 votes
0 answers
2165
Introduction to Algorithm - Cormen
I didn't understand Big-O notation: This is CORMEN exercise problem - 3.1-2 Solution link: https://www.csee.umbc.edu/~nam1/TA/HWSols/hw1sol.pdf
I didn't understand Big-O notation: This is CORMEN exercise problem - 3.1-2Solution link: https://www.csee.umbc.edu/~nam1/TA/HWSols/hw1sol.pdf
User Avatar
1 votes
0 answers
2167
# Backtracking
Find all the possible solution for sum of subset problem for the instance m=35 and S=<1,2,5,7,8,10,15,20,25> using Backtracking. I am totally confused hence please provide me the solution for it.
Find all the possible solution for sum of subset problem for the instance m=35 and S=<1,2,5,7,8,10,15,20,25 using Backtracking.I am totally confused hence please provide ...
User Avatar
0 votes
0 answers
2170
Tower of Hanoi
how to Write a program in C which implements tower of Hanoi using recursion? and please explain lines of code if possible. It 'll be a great help.
how to Write a program in C which implements tower of Hanoi using recursion? and please explain lines of code if possible.It 'll be a great help.
User Avatar
0 votes
0 answers
2172
Analysis of complexity
The increasing order of following functions in terms of asymptotic complexity is: (a) f1(n); f4(n); f2(n); f3(n) (b) f1(n); f2(n); f3(n); f4(n) (c) f2(n); f1(n); f4(n); f3(n) (d) f1(n); f2(n); f4(n); f3(n)
The increasing order of following functions in terms of asymptotic complexity is:(a) f1(n); f4(n); f2(n); f3(n) (b) f1(n); f2(n...
User Avatar
1 votes
1 answer
2173
ACE test series
please help me to understand
please help me to understand
User Avatar
0 votes
0 answers
2175
Time complexity Question.
Given an array of n elements whose sorting values range from o to n. If range is 0 to n^2 then theta n will be? a. $\theta$ $log n$ b. $\theta n$ c. $nlogn$ d. $theta (n^2)$
Given an array of n elements whose sorting values range from o to n. If range is 0 to n^2 then theta n will be?a. $\theta$ $log n$b. $\theta n$c. $nlogn$d. $theta (n^2)$
User Avatar
0 votes
3 answers
2176
class test
m=1; for i=1 to n do begin m=m*3; for j=1 to m do {Something which is O(1)} What is the complexity of above algorithm? 1. O(n*m3) 2. O(n3) 3. O(3n) 4. O(3m)
m=1;for i=1 to n do begin m=m*3; for j=1 to m do {Something which is O(1)}What is the complexity of above algorithm?1. O(n*m3)2. O(n3)3. O(3n)...
User Avatar
3 votes
1 answer
2178
Time Complexity
Is the answer D ?
Is the answer D ?
User Avatar
1 votes
1 answer
2179
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
0 votes
0 answers
2180
Find the weight MST
Let us assume that $G$($V$, $E$) is a weighted complete graph such that weight of the edge <$V_K$,$V_L$>=2|$K$-$L$|. The weight MST of $G$ with 100 vertices is ____________________.
Let us assume that $G$($V$, $E$) is a weighted complete graph such that weight of the edge <$V_K$,$V_L$>=2|$K$-$L$|. The weight MST of $G$ with 100 vertices is __________...
User Avatar
Page: