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

#2241
588
views
1 answers
5 votes
Testbook Test Series
User Avatar
#2242
469
views
0 answers
2 votes
Testbook Test Series
Assume there are 1024 men,each with distinct arm strength,in an arm wrestling match stronger arm always wins.Number of arm wrestling matches required to find men with str...
User Avatar
#2243
888
views
2 answers
3 votes
MadeEasy Subject Test: Algorithms - Graph Algorithms
Consider vertices V1 and V2 that are simultaneously on function call stack at some point during DFS from vertex s.Which of the following are always true for this digraph ...
User Avatar
#2244
919
views
1 answers
1 votes
Hashing
The average number of probe required when inserting an element with load factor alpha (assume uniform hashing) 1 / 1-alpha how? Please explain
User Avatar
#2245
1.8k
views
1 answers
1 votes
Fibonacci-Sequence
Which of the following is true about time complexity for generating $\color{blue} {n^{th}}$ Fibonacci number ? a)$O(n)$b)$O(Logn)$c)$O(2^n)$d)$\Omega(n)$
User Avatar
#2246
9.5k
views
2 answers
0 votes
Activity Selection Problem
11. Explain and write an algorithm for greedy method of algorithm design. Given 10 activities along with their start and finish time as:A={A1,A2, A3, A4, A5, A6, A7, A8, ...
User Avatar
#2247
2.9k
views
1 answers
0 votes
Knapsack problem
5.Consider the Knapsack instance with 5 objects and a capacity M=11, profit P=(5,4,7,2,3) andweight W=(4,3,6,2,2.). Solve it using dynamic programming approach.
User Avatar
#2248
861
views
0 answers
1 votes
Prim's algorithm for MST
Assuming that the graph can contain repeated edge weights, we have a single tree at any instance when applying Prim's algorithm.Justify this statement.
User Avatar
#2249
309
views
1 answers
1 votes
Asymptotic
which is asymptotically greater n or $2^{logn}$
User Avatar
#2250
236
views
0 answers
0 votes
recurrence
A slight modification to binary search algorithm where it is split into sets of size one thirds and two thirds instead of equal sizes. What will be the recurence relation...
User Avatar
#2251
325
views
1 answers
2 votes
Finding Minimum
.........
User Avatar
#2252
965
views
0 answers
4 votes
Expectation and BST
Here how did we find the number of comparisons for any number.
User Avatar
#2253
565
views
1 answers
2 votes
Kruskal
Can Anyone provide all the data structure that we can used and time complexity that we get for Kruskal algorithm of finding the minimum spanning tree.
User Avatar
#2254
377
views
1 answers
1 votes
I have a basic question regarding DAA
let a functionf(x) =$n^3$+$n^4$+1so which are true1. θ($n^4$)2. θ($n^5$)3. θ(1)4. θ($n^3$)5. Ω ($n^4$)6. Ω ($n^5$)7. Ω (1)8. Ω ($n^3$)9. O ($n^4$)10. O ($n^5$)11....
User Avatar
#2255
690
views
0 answers
2 votes
Sorting
If we are asked to find best comparison based sorting algorithm to sort n numbers having d digit's and in the range from [1-k].If I say it is quick sort or merge sort or ...
User Avatar
#2256
412
views
0 answers
0 votes
dynamic programming
To be considered as a dynamic programming model...there are 2 properties1.must have optimal substructure2.must have overlapping subproblemsOnly if both are satisfied it ...
User Avatar
#2257
1.1k
views
0 answers
5 votes
Time Complexity
//n is a prime number hereint main() { for(i=1;i<=n;i=2*i) { for(j=1;j<=n;j++) { if(n%i==0) { k=1; while(k<=n) { a=b+c; k=k+1; } } } } }
User Avatar
#2258
632
views
0 answers
0 votes
MERGE SORT
IS 2 way merge sort and normal merge sort is same.in which we have to use bottom-up merging approach by taking 2-2 element inside the list.if 5-way merge sort then in the...
User Avatar
#2259
353
views
0 answers
1 votes
Algorithm
True or False ExplainBellman Ford can never find shortest path of a graphFloyd Warshall can find shortest path of a graph
User Avatar
#2260
196
views
0 answers
0 votes
#doubt algo
What is the disadvantage of avl tree over b tree ??
User Avatar
Page: