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

3 votes
1 answer
1925
merge sort
Merge sort using linked list is better than array in terms of space complexity true or not with explanation :)
Merge sort using linked list is better than array in terms of space complexitytrue or not with explanation :)
User Avatar
2 votes
0 answers
1926
DAA: growth of functions
Can someone please prove or disprove the following conjecture? 1. Let f(n) be a asymptotically positive function. $f(n) + o(f(n)) = \Theta(f(n))$ Note that this is small-oh.
Can someone please prove or disprove the following conjecture?1. Let f(n) be a asymptotically positive function.$f(n) + o(f(n)) = \Theta(f(n))$Note that this is small-oh....
User Avatar
1 votes
1 answer
1927
Sorting
Which of the following sorting algorithm can sort at runtime? 1). Heapsort 2). Merge sort 3). Insertion Sort 4). Selection Sort This is a self made question. So many options many be correct.
Which of the following sorting algorithm can sort at runtime?1). Heapsort2). Merge sort3). Insertion Sort4). Selection SortThis is a self made question. So many options m...
User Avatar
3 votes
1 answer
1931
ace test series
how many times middle loops execute for bound =1,2,......n.
how many times middle loops execute for bound =1,2,......n.
User Avatar
1 votes
1 answer
1932
Cormen Edition 3 Exercise 8.4 Question 3 (Page No. 204)
Let $X$ be a random variable that is equal to the number of heads in two flips of a fair coin. What is $E[X^2]$? What is $E^2[X]$?
Let $X$ be a random variable that is equal to the number of heads in two flips of a fair coin. What is $E[X^2]$? What is $E^2[X]$?
User Avatar
0 votes
0 answers
1933
Find theta using recurrence relation
https://gateoverflow.in/?qa=blob&qa_blobid=827374952488372193 Find theta using the recurrence relation. Please answer it.
https://gateoverflow.in/?qa=blob&qa_blobid=827374952488372193 Find theta using the recurrence relation.Please answer it.
User Avatar
3 votes
2 answers
1936
#Graph Theory #Algorithms Self Doubt about Dense Graphs.
Please give some example regarding number of edges in dense graph is - |E| < |V2| I get that when we take log both sides we get O(ElogV), but I can't get this |E| < |V2|
Please give some example regarding number of edges in dense graph is - |E| < |V2|I get that when we take log both sides we get O(ElogV), but I can't get this |E| < |V2|
User Avatar
1 votes
2 answers
1937
Log formula related doubt.
Confusion regarding these log representations. 1.(logn)2 2.log2n 3.log(logn) 4.log(n)2 which of these are equal . Also explain meaning of each one.(Pls provide any source if possible).
Confusion regarding these log representations.1.(logn)22.log2n3.log(logn)4.log(n)2which of these are equal . Also explain meaning of each one.(Pls provide any source if p...
User Avatar
0 votes
1 answer
1938
Doubt regarding Algorithms
Given $f(n)=n^2log n$ AND $g(n)=n(log n)^{10}$ Which one of the following is true? $f(n)=O(g(n))$ $f(n)=\Omega(g(n))$ $f(n)=\theta(g(n))$ $\text{We can't compare.}$ Kindly work out this question. Stepwise solution. Thanx in advance. :)
Given $f(n)=n^2log n$ AND $g(n)=n(log n)^{10}$Which one of the following is true?$f(n)=O(g(n))$$f(n)=\Omega(g(n))$$f(n)=\theta(g(n))$$\text{We can't compare.}$Kindly work...
User Avatar
0 votes
1 answer
1940
Doubt
Consider f (n), g(n) and h(n) be function defined as follows: Which of the following represents correct asymptotic solution for f (n) + [g(n) × h(n)]? A . Omega(n^3) B. O(n^4) C. Theta(n^4) D. O(n^3) What should be the correct way of solving such questions ?
Consider f (n), g(n) and h(n) be function defined as follows:Which of the following represents correct asymptotic solution for f (n) + [g(n) × h(n)]?A . Omega(n^3)B. ...
User Avatar
Page: