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{2024-1} & \textbf{2024-2} & \textbf{2023} & \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 1&2&2& 2 &3&2&1&2&3
\\\hline\textbf{2 Marks Count} &4&2&2& 2 &3&4&2&2.83&4
\\\hline\textbf{Total Marks} &9&6&6& 6 &9&10&\bf{6} & \bf{7.67}&\bf{10}\\\hline
\end{array}}}$$

Filter

Recent questions in Algorithms

1 votes
1 answer
3321
UGC NET CSE | August 2016 | Part 3 | Question: 36
Match the following : ... $\text{a-iii, b-i, c-iv, d-ii}$ $\text{a-iii, b-i, c-ii, d-iv}$
Match the following :$\begin{array}{clcl} \text{a.} & \text{Prim’s algorithm} & \text{i.} & \text{$O(V^2E)$} \\ \text{b.} & \text{Bellman-Ford algorithm} & \text{ii.} ...
User Avatar
0 votes
0 answers
3325
Merge sort
If we add a number in already sorted merge sort list then how much time it will take?plz explain
If we add a number in already sorted merge sort list then how much time it will take?plz explain
User Avatar
2 votes
2 answers
3329
Complexity finding of c program
#include <stdio.h> int main() { int x,y = 0; //assume a[] as any array. for(x = 0; x < n; ++x) { while(y < n && arr[x] < arr[y]) y++; } return 0; }
#include <stdio.h int main() { int x,y = 0; //assume a[] as any array. for(x = 0; x < n; ++x) { while(y < n && arr[x] < arr[y]) y++; } return 0; }
User Avatar
1 votes
0 answers
3330
Virtual Test series
User Avatar
1 votes
0 answers
3334
Virtual Test Series
User Avatar
0 votes
1 answer
3338
Modified Insertion sort
Insertion Sorts complexity is O(n+d) where d is no. of inversions. (There are some questions in gate where no. of inversions are given in terms of n.) I am unable to Understand this complexity Derivation. Plz make me understand. Thank U.
Insertion Sorts complexity is O(n+d) where d is no. of inversions.(There are some questions in gate where no. of inversions are given in terms of n.)I am unable to Under...
User Avatar
0 votes
1 answer
3339
made easy
what is the expected number of probs requires when inserting an element into an open address hash table with load factor x (assume uniform hashing) a 1/(1-x) b 1/(1+x) c 1/x d 2/(2-x)
what is the expected number of probs requires when inserting an element into an open address hash table with load factor x (assume uniform hashing)a 1/(1-x)b 1/(1+x)c 1/x...
User Avatar
1 votes
1 answer
3340
Sorting
Consider the problem of adding two n-bit binary integers, stored in two n-element arrays A and B. The sum of the two integers should be stored in binary form in an (n+1)-element array C.What is the time and space complexity of it. I think O(n) and O(1).PLz explain
Consider the problem of adding two n-bit binary integers, stored in two n-element arrays A and B. The sum of the two integers should be stored in binary form in an (n+1)-...
User Avatar
Page: