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

0 votes
0 answers
3121
space complexity of sorting algo
User Avatar
0 votes
1 answer
3123
order of expression
User Avatar
1 votes
1 answer
3124
BFS & DFS
User Avatar
2 votes
3 answers
3125
BFS vs DFS
What are some applications where only DFS can be used and BFS can`t and vice versa?
What are some applications where only DFS can be used and BFS can t and vice versa?
User Avatar
19 votes
3 answers
3126
GATE CSE 1989 | Question: 13b
Find a solution to the following recurrence equation: $T(n)=\sqrt{n}+T\left(\frac{n}{2}\right)$ $T(1)=1$
Find a solution to the following recurrence equation:$T(n)=\sqrt{n}+T\left(\frac{n}{2}\right)$$T(1)=1$
User Avatar
0 votes
2 answers
3127
travelling salesman problem
Question - 14 question is what is the approch to solve it by dynamic programming ?
Question - 14 question is what is the approch to solve it by dynamic programming ?
User Avatar
7 votes
2 answers
3128
GATE CSE 1989 | Question: 13a
A language uses an alphabet of six letters, $\left\{a, b, c, d, e, f\right\}$ ... Design a prefix binary code for the language which would minimize the average length of the encoded words of the language.
A language uses an alphabet of six letters, $\left\{a, b, c, d, e, f\right\}$. The relative frequency of use of each letter of the alphabet in the language is as given be...
User Avatar
1 votes
1 answer
3129
[Algorithms] BFS Back edges
True / False? 1. For a directed graph, the absence of back edges with respect to a BFS tree implies that the graph is acyclic. 2. The depth of any DFS tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex.
True / False?1. For a directed graph, the absence of back edges with respect to a BFS tree implies that the graph is acyclic.2. The depth of any DFS tree rooted at a vert...
User Avatar
0 votes
0 answers
3130
Made Easy
Why it is not 5/11 ??
Why it is not 5/11 ??
User Avatar
0 votes
0 answers
3131
Made Easy
according to me answer is coming as:(3n^2 + n)/2 for first n times, sum of first n natural numbers will come, and after n times i will always be greater than n, so 1 will be added n times in every iteration of i. so, n^2 + n(n+1)/2 should be the answer. Please correct me if I am commiting some mistake.
according to me answer is coming as:(3n^2 + n)/2for first n times, sum of first n natural numbers will come, and after n times i will always be greater than n, so 1 will ...
User Avatar
0 votes
1 answer
3132
Made Easy
User Avatar
1 votes
0 answers
3134
ACE TEST SERIES
User Avatar
0 votes
2 answers
3136
Kruskals MST
Consider a graph with V vertices and e edges,What is the worst case time complexity for kruskal's algorithm when implemented using array data structure? a.) E+ElogV b.)VlogV c.)V^2 d.)Vlog^2V
Consider a graph with V vertices and e edges,What is the worst case time complexity for kruskal's algorithm when implemented using array data structure?a.) E+ElogVb.)Vlog...
User Avatar
0 votes
1 answer
3138
Time Complexity
Do we need to solve them by subtituion?I am not able to apply master theorem to anyone of these
Do we need to solve them by subtituion?I am not able to apply master theorem to anyone of these
User Avatar
0 votes
2 answers
3140
Master Theorem Algorithm
How is master theorem applicable here?
How is master theorem applicable here?
User Avatar
Page: