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{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}&3&2&3&2&0&2&2&3&3&0&2.2&3
\\\hline\textbf{2 Marks Count}&3&4&4&2&4&2&3&2&3&2&3&4
\\\hline\textbf{Total Marks}&9&10&11&6&8&6&8&7&9&\bf{6}&\bf{8.2}&\bf{11}\\\hline
\end{array}}}$$

Recent questions in Algorithms

3 votes

3 answers

unacademy combat
what will be time complexity of this program? void function(int n) { int count = 0; for (int i=0; i<n; i++) { for (int j=1; j< i*i; j++) { if (j%i == 0) { for (int k=0; k<j; k++) printf("*"); } } } }

viral8702 asked in Algorithms 3 days ago

by viral8702

321 views

0 votes

3 answers

Self doubt.
What is the time & space complexity of this algorithm? Main() { for(i=n; i>10; i=i^1/4) { for(j=201; j<n^3; j=j+400) { for(k=47; k<=n^84; k=k*108) { k=k^61; } } } }

Nisha Bharti asked in Algorithms 3 days ago

by Nisha Bharti

79 views

0 votes

0 answers

Recurrence relationship
T(n) = 3T(n-1) -4T(n-2) + 2T(n-3) If n = 0 then T(n) = 1 if n= 1 or 2 then T(n) = 0 What is the generalized solution?

kumar123 asked in Algorithms 3 days ago

by kumar123

76 views

0 votes

2 answers

igate Test Series
Rahul knows the implementation of merge sort. One day, his teacher asked him to find numbers of inversion in an array. An inversion can be defined in an array as if i < j, a[i] > a[j] then it is an inversion. Now, given there are p inversions in an ... multiply all elements by -1, what is the time complexity to find inversions in an updated array? O(n) O(nlogn) O(n^2) None

rsansiya111 asked in Algorithms 6 days ago

by rsansiya111

75 views

0 votes

1 answer

Applied Test
Which of the following are applications for DFS when we have an unweighted directed graph at hand. 1.Single source shortest path from the source vertex. 2 Topological sorting of the vertices 3 Strongly connected components of the graph. 4 Detection of cycles in the graph. Can we use unweighted directed graph in Topological sorting ?? .

lalitver10 asked in Algorithms Sep 9

by lalitver10

98 views

0 votes

0 answers

Time complexity
1. for ( i = 1 ; i <= n ; i++) { for ( j= 1 ; j <= i; j++) { for ( k = 1 ; k <= j ; k++) cout<<"a"; } } Here , complexity = O(n³) 2. for ( i = 1 ; i <= n ; i=i*2) { for ( j = 1 ; j <= i ; j++) cout<< ... = O(n) . But I am getting O(2^n) (A gp was formed , first term = 1 = 2^0 , last term was 2^n so sum is 2^(n+1) which gives complexity as 2^n)

Ferox asked in Algorithms Sep 8

by Ferox

114 views

0 votes

0 answers

T(n) = 2^nT(n/2) + n^n find TC
T(n) = 2^nT(n/2) + n^n find TC

mohdraza asked in Algorithms Sep 1

by mohdraza

106 views

0 votes

0 answers

Asymptotic Functions
Consider f(n) and g(n) be asymptotic non-negative functions. So here can we say that min(f(n), g(n)) = Θ(f(n) + g(n)) My proof for this For f(n) = Θ(g(n)) c1*g(n) $\leq $ f(n) $\leq $ c2*g(n) such that c1, c2 >0 Considering the above definition ... ) So thus we can say that min(f(n), g(n)) = Θ(f(n) + g(n)) Is this the correct way? What would be the correct answer?

Chaitanya Kale asked in Algorithms Aug 29

by Chaitanya Kale

103 views

1 vote

1 answer

Divide and conquer
How To Solve This Using Divide And Conquer Suppose we are given the two n bit integers, assuming for common sense n as power of 2. It is required to multiply them using Divide & conquer method. What is the divide & conquer recurrence, that would arise for the problem. 1. T(n) = 4T(n/2) + O(1) 2. T(n) = 2T(n/2) + O(n) 3. T(n) = 4T(n/2) + O(n^2) 4. T(n) = 4T(n/2) + O(n)

[ Jiren ] asked in Algorithms Aug 28

by [ Jiren ]

97 views

2 votes

0 answers

I-Gate Question
Consider the following algorithm, Dosomething( x, n) { m= n, temp= 1,z= x; while(m>0) do { while((m mod z)=0) do { m= Floor(m/2); z=z^2; } m = m-1, temp= temp* z; } return temp; } The complexity of above algorithm is Theta(log n) Theta(n log n) Theta(n^2) Theta(n)

loki2023 asked in Algorithms Aug 23

by loki2023

114 views

0 votes

1 answer

Dynamic Programming
int max(int a, int b) { return (a > b) ? a : b; } // Returns the maximum value that can be // put in a knapsack of capacity W int knapSack(int W, int wt[], int val[], int n) { // Base Case if (n == 0 || W == 0) return 0; // If ... , wt, val, n - 1), knapSack(W, wt, val, n - 1)); } This statement implies that the max value return by the two different recursive problems right?

ryandany07 asked in Algorithms Aug 18

by ryandany07

104 views

0 votes

1 answer

Madeeasy Test Series
A hash table of size 10 using open addressing with linear probing and hash function is h(k)= (k)mod10 , where k is key value , initially table is empty . Following keys are inserted into table in given order . 44,87,43,68,30,20,67 How many number of probes required to insert 17 in table after inserting above keys?

Manisha Jaishwal asked in Algorithms Jul 25

by Manisha Jaishwal

232 views

1 vote

1 answer

#doubt
BigO notation of T(n)=T(n-1)+ √n ; n>=1 =0. ; Otherwise

Subbu. asked in Algorithms Jul 18

by Subbu.

173 views

0 votes

1 answer

#Dfs And Bfs
Please list the problems where BFS alone can do and DFS alone can do and both can do??

Subbu. asked in Algorithms Jul 16

by Subbu.

81 views

0 votes

0 answers

Iteration Functions (Cormen)
Iterative functions: f(n)= n/logn c=2 What is f*(n) ? How to solve this question?

mb14 asked in Algorithms Jul 6

by mb14

108 views

0 votes

0 answers

what is the running time of the following iterative algorithm? b) It is possible to talk about the best, average and worst running times for this algorithm. Why?

usdid asked in Algorithms Jul 2

by usdid

91 views

0 votes

0 answers

please tell me whether the Branch & Bound concept and NP Hard & NP Complete concepts are there for gate or not in algorithms?

Vijay_Ram asked in Algorithms Jul 2

by Vijay_Ram

50 views

0 votes

1 answer

Shortest path in DAG and Travelling salesman problem are in DSA gate syllabus??

Vink7389 asked in Algorithms Jun 27

by Vink7389

71 views

1 vote

1 answer

Recurrence Tree Method
T(n) = 5T(n/3) + T(2n/3) + 1. My answer is BigOmega(n) BigO(n). Am I right? This is a question I found on cs.stackexchange.

yuyutsu asked in Algorithms Jun 23

by yuyutsu

244 views

0 votes

1 answer

Solve equation using master theorem T(n) = 8T(n/2) + 3n^2
I can't figure out how to proceed and which case it's falling under after calculating h(n)

ItzDc asked in Algorithms Jun 3

by ItzDc

327 views

Page:

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions in Algorithms

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Subjects

Network Sites

Recent questions in Algorithms

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Recent Posts

Subjects

Recent Blog Comments

Network Sites