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

1 votes
0 answers
2641
solve this
$T(n) = 2t(\frac{n}{2}) + \frac{n}{\log n } ; T(1 ) =1$
$T(n) = 2t(\frac{n}{2}) + \frac{n}{\log n } ; T(1 ) =1$
User Avatar
1 votes
0 answers
2642
Optimal binary search tree
Let n=4, and (a1,a2,a3,a4) =(do,if,int,while). Let p (1••••••4) = (3,3,1,1) and q ( 0••••4) =(2,3,1,1,1). If you construct optimal cost binary search tree then what is the cost of the optimal binary search tree? And which is the root in the optimal cost binary search tree?
Let n=4, and (a1,a2,a3,a4) =(do,if,int,while).Let p (1••••••4) = (3,3,1,1) and q ( 0••••4) =(2,3,1,1,1). If you construct optimal cost binary search t...
User Avatar
1 votes
0 answers
2643
Test Series
User Avatar
1 votes
1 answer
2644
madeeasy test series
Consider the following functions: $f1=n^{\log n}$ $f2=2^n$ $f3=2^{\sqrt{n}}$ Which of the following is true with regard to asymptotic growth? A. $f1\leq f3\leq f2$ B. $f3\leq f1\leq f2$
Consider the following functions:$f1=n^{\log n}$$f2=2^n$$f3=2^{\sqrt{n}}$Which of the following is true with regard to asymptotic growth?A. $f1\leq f3\leq f2$B. $f3\leq f...
User Avatar
1 votes
1 answer
2645
doubts algorithm
User Avatar
2 votes
1 answer
2646
test series
plz explain this question
plz explain this question
User Avatar
1 votes
0 answers
2647
Algorithm
What are the differences between Euler graph and Hamiltonian graph
What are the differences between Euler graph and Hamiltonian graph
User Avatar
1 votes
0 answers
2648
made easy test 7
Let f (n) = Ο(n), g(n) = Ο(n) and h(n) = θ(n). Then [f (n) . g(n)] + h(n) is _______. (A) Ω(n) (B) Ο(n) (C ) θ(n) (D) NOT Answer is C but why .it should be A ? Please help Thanks
Let f (n) = Ο(n), g(n) = Ο(n) and h(n) = θ(n). Then [f (n) . g(n)] + h(n) is _______. (A) Ω(n)(B) Ο(n) (C ) θ(n)(D) NOTAnswer is C but why .it should be A ...
User Avatar
1 votes
0 answers
2651
insertion sort with binary search
User Avatar
1 votes
0 answers
2652
algorithms
Merge sort using a linked list is efficient compared to array in terms of space complexity.plz explain
Merge sort using a linked list is efficient compared to array in terms of space complexity.plz explain
User Avatar
1 votes
0 answers
2654
recurrence equation
what is recurrence relation of harmonic number/series ? and it's time complexity
what is recurrence relation of harmonic number/series ? and it's time complexity
User Avatar
3 votes
3 answers
2655
Quick Sort
"Quick sort has good cache performance" , Can anyone explain this statement.How is cache related to quick sort.I searched for this over the internet but could not find a good article.
"Quick sort has good cache performance" , Can anyone explain this statement.How is cache related to quick sort.I searched for this over the internet but could not find a ...
User Avatar
1 votes
1 answer
2656
Test series
The recurrence relation T(n) =2t(n/2) + n/logn , T(1) =1 Evaluates to Plz explain how to evaluate ?
The recurrence relationT(n) =2t(n/2) + n/logn , T(1) =1Evaluates to Plz explain how to evaluate ?
User Avatar
1 votes
1 answer
2659
doubt algo 2
User Avatar
1 votes
1 answer
2660
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
Page: