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

Hot questions in Algorithms

2 votes
1 answer
3121
Algo cormen Time complexity
T(n)= C+T(n-1), if n>1 = d, if n≤ 1 What is tme complexity?
T(n)= C+T(n-1), if n>1= d, if n≤ 1 What is tme complexity?
User Avatar
3 votes
3 answers
3122
UGC NET CSE | June 2013 | Part 3 | Question: 68
Which one of the following is not an informed search technique? Hill climbing search Best first search A* search Depth first search
Which one of the following is not an informed search technique?Hill climbing searchBest first searchA* searchDepth first search
User Avatar
7 votes
1 answer
3123
master theorem
T(n)=4T(n/2)+n/logn this can be solved by master theorem but why t(n)=2t(n/2)+n/logn can't be solved by master theorem ?
T(n)=4T(n/2)+n/lognthis can be solved by master theorem but whyt(n)=2t(n/2)+n/logn can't be solved by master theorem ?
User Avatar
1 votes
0 answers
3124
Merge sort
Time complexity of inplace merge sort??
Time complexity of inplace merge sort??
User Avatar
0 votes
0 answers
3125
algorithm
For a directed graph with positive wights on edges , bellmann ford runs faster than single source shortest path true or false?
For a directed graph with positive wights on edges , bellmann ford runs faster than single source shortest pathtrue or false?
User Avatar
1 votes
2 answers
3126
#algo
If a directed graph G is cyclic but can be made acyclic by removing one edge,then a depth-first search in G will encounter exactly one back edge??
If a directed graph G is cyclic but can be made acyclic by removing one edge,then a depth-first search in Gwill encounter exactly one back edge??
User Avatar
0 votes
1 answer
3127
Please solve this Q
What is the time complexity to construct a binary tree when inorder and preorder traversal of the tree is given? 1. O(n) 2.O(n log n) 3. O(n2) 4.O(n2 log n)
What is the time complexity to construct a binary tree when inorder and preorder traversal of the tree is given?1. O(n)2.O(n log n)3. O(n2)4.O(n2 log n)
User Avatar
0 votes
1 answer
3128
Test by Bikram | Algorithms | Test 2 | Question: 16
Consider the following max-heap as given below : 9 / \ 6 8 / \ / \ 3 4 5 7 The number of swaps required to convert the given max-heap into min-heap is ______.
Consider the following max-heap as given below : 9 / \ 6 8 / \ / \3 4 5 7The number of swaps required to convert the given max-hea...
User Avatar
3 votes
1 answer
3129
doubt in time complexity
what is time complexity : for( i= 1; i < n/22 ; ++i ) can i take n/22 = n for( i= 0 ; i < n/4 - 1 ; ++i ) can i take n/4 - 1 = n will it affect my answer ? because we interseted in upperbound that is n ??
what is time complexity : for( i= 1; i < n/22 ; ++i ) can i take n/22 = n for( i= 0 ; i < n/4 - 1 ; ++i ) can i take n/4 - 1 = n will it affect m...
User Avatar
0 votes
0 answers
3133
Data Structure
For a table of 12 items given 19,13,05,27,01,26,31,16,02,09,11,21 What will be the output when items of bucket are merged after first distribution??
For a table of 12 items given 19,13,05,27,01,26,31,16,02,09,11,21What will be the output when items of bucket are merged after first distribution??
User Avatar
0 votes
0 answers
3134
Algorithm
User Avatar
0 votes
1 answer
3135
Algorithm doubt
Q. An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is either maximum or minimum is A O(nlogn) B O(n) C O(logn) D O(1)
Q. An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is either maximum or minimum isAO(nlogn)BO(n)...
User Avatar
1 votes
0 answers
3136
Dynamic programming
Explain longest comman sbsequence , how to direct solve the lcs problems????
Explain longest comman sbsequence , how to direct solve the lcs problems????
User Avatar
2 votes
1 answer
3137
Graph
The problem of finding the set of vertices reachable from a given vertex in a graph can be solved in time A. O(|V|^2) B. O(|V| + |E|) C. O(|V||E|) D. none of these
The problem of finding the set of vertices reachable from a given vertex in a graph can be solved in timeA. O(|V|^2)B. O(|V| + |E|)C. O(|V||E|)D. none of these
User Avatar
2 votes
0 answers
3138
option d should be g(n) = o(f(n))
https://gateoverflow.in/664/gate2000-2-17
https://gateoverflow.in/664/gate2000-2-17
User Avatar
3 votes
1 answer
3139
Recursive equation time complexity
How to apply back substiution method on following recursive equation to find time complexity: T(n)= 2 T(n/2) + (n/log n) , where "n" is input.
How to apply back substiution method on following recursive equation to find time complexity:T(n)= 2 T(n/2) + (n/log n) , where "n" is input.
User Avatar
1 votes
0 answers
3140
algorithn
https://gateoverflow.in/1076/gate2004-82?show=141252#c141252 Can somenone please explain this question I really dont understand the difference made by the statement "counter=0"
https://gateoverflow.in/1076/gate2004-82?show=141252#c141252Can somenone please explain this questionI really dont understand the difference made by the statement "counte...
User Avatar
Page: