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}}}$$

Recent questions in Algorithms

#2321
1.7k
views
2 answers
1 votes
.Let S1= ∑nr/2r (r=0 to logn-1) .S2= ∑r2r (r=0 to logn-1)what will be s1 and and s2 after expension
#2322
446
views
1 answers
1 votes
#2323
15.8k
views
5 answers
5 votes
Total no. of ways to perform matrix multiplication having 7 matrices is ?Total no. of ways to by which we could parenthesize 7 matrices is ?Does the above two questions are different or same ?Plz explain the answer.
#2324
379
views
1 answers
0 votes
void fun(int n, int k){ for (int i=1; i<=n; i++) { int p = pow(i, k); for (int j=1; j<=p; j++) { // Some O(1) work } }}Time complexity= ?
#2325
674
views
1 answers
0 votes
void fun(int n){ int j = 1, i = 0; while (i < n) { // Some O(1) task i = i + j; j++; }}Time complexity of the above code ?
#2326
442
views
1 answers
0 votes
What will be the time complexity?voidfun(){int i, j;for (i=1; i<=n; i++)for (j=1; j<=log(i); j++)printf("hello");}
#2327
343
views
1 answers
0 votes
How to write recurrence relation for , possible binary sequence of size n ?
#2328
1.6k
views
1 answers
1 votes
What is cost of shortest path from S to T ?is any difference between when greedy method is used
#2329
3.0k
views
3 answers
1 votes
Consider a hash table consisting of M=11 slots, and suppose integer key value are hashed into the table using hash function h1:int h1(int key) { x = (key + 5)*( ... , 0, 15, 31, 4, 7, 11, 3Source:- http://www.techtud.com/example/hashing
#2330
643
views
1 answers
1 votes
Could anyone describe how the partitioning algorithm vary when the pivot is varied ?In Cormen , last element is taken as pivot . Suppose I took first ... element or 3 rd element as pivot then how the partitioning algorithm will change.
#2331
589
views
1 answers
1 votes
Which algorithm does kruskal uses for detecting every cycle and what is the time complexity?
#2332
210
views
0 answers
0 votes
What is constant amortized time?How using Amortized Analysis, we could prove that the Dynamic Table scheme has O(1) insertion time when n insertion is being done?Can anybody please explain...
#2333
611
views
0 answers
0 votes
#2334
313
views
0 answers
0 votes
What is the correct answer please provide with reason?
#2335
155
views
0 answers
0 votes
How to solve this?
#2336
470
views
2 answers
0 votes
f(n) + o(f(n)) = thetha(f(n))Does this hold? o is small -oh notation.
#2337
1.9k
views
2 answers
2 votes
Consider the following code which sort all elements of an array A' in descending order.Which of the following will represents correct value of X, Y, Z in ... it is aranging in ascending order.And option D is doing what question is saying.
#2338
725
views
1 answers
0 votes
Which of the following statements is/are valid?1. Time Complexity of QuickSort is Θ(n^2)2. Time Complexity of QuickSort is O(n^2)3. For any two functions f(n) ... Ω(g(n)).4. Time complexity of all computer algorithms can be written as Ω(1)
#2339
322
views
1 answers
0 votes
An unsorted list contain log(n) (base 2) distinct elements. The time complexity to find an element in this list that is neither maximum nor minimum is?
#2340
2.6k
views
1 answers
3 votes
Explain Prims AlgorithmAnalysis Of Time ComplexityHow does $\mathcal{O}(VlogV + ElogV)=\mathcal{O}(ElogV)$