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

#2361
1.6k
views
3 answers
1 votes
dijkstra
If we run Dijkstra's algorithm to find single source shortest path for the above edge weighted directed graph with 8' as source. In what order do ... included into the set of vertices for which the shortest path distances are finalized.
User Avatar
#2362
318
views
1 answers
0 votes
Clrs EXP
HOW ARE C1,C2 VALUES CALCULATED ?
User Avatar
#2363
551
views
1 answers
–1 votes
Time Complexity
What will be the time complexity of a function f(n) = n^-2 i.e. pow (n,-2) ?
User Avatar
#2364
440
views
0 answers
0 votes
Self Doubt (Graphs)
How to understand this: For a connected graph, V = O(E))SOURCE http://www.geeksforgeeks.org/greedy-algorithms-set-5-prims-mst-for-adjacency-list- ... complexity for adjacency list representation. Also same is given in CLRS but no reason
User Avatar
#2365
169
views
0 answers
0 votes
GATEFORUM
User Avatar
#2366
508
views
1 answers
0 votes
Dynamic Programming: How to Approach these type of recurrence problems in DP?
User Avatar
#2367
907
views
0 answers
2 votes
time complexity
What is the time complexity of the following code snippet? Assume x is a global variable and “statement” takes O(n) time?
User Avatar
#2368
304
views
1 answers
2 votes
time complexity
If F(n) = (log n)n then, is F(n) = O(n2) true?Also, what about F(n) = $\Theta$(n2)
User Avatar
#2369
626
views
1 answers
0 votes
time complexity
a[] is an array of integer, the size of the array is n.Read the following code snippet and find the time complexity of the code. int main(){int i,j,k=0;for(i=0;i<n;i++){ for(j= ... while(k<i && a[j]<a[k]){ k++; }}}}
User Avatar
#2370
314
views
0 answers
1 votes
Made Easy Test Series :
Can anyone help to find the value of S2. The ans is (B). please help to evaluate the series s2. Thank you in advance.
User Avatar
#2371
374
views
0 answers
1 votes
Virtual Gate Test Series: Algorithms - Tree Coloring
Consider a tree with $n$ nodes where a node can be adjacent to max $4$ other nodes what is the minimum number of colors needed to color the tree so that no two adjacent nodes get the same color?
User Avatar
#2372
748
views
1 answers
0 votes
Minimum Spanning Trees
Suppose, the MST of a graph of n vertices has already been constructed. Now, if one new vertex is added to the graph along with 'i' incident edges. What is the max ... n c) Number of incident edges on new vertex n-id) none of these
User Avatar
#2373
847
views
0 answers
3 votes
cormen
Show that a graph has a unique minimum spanning tree if, for every cut of the graphs, there is a unique line edge crossing the cut. Show that the ... a counter example. I'm more interested in the converse. Please explain in detail.
User Avatar
#2374
2.6k
views
0 answers
0 votes
Floyd-warshall for longest path problem
I have few doubts related to Longest distance problem. From Wikipedia -->The NP-hardness of the unweighted longest path problem can be ... /stackoverflow.com/questions/42500120/floyd-warshall-for-longest-distance-for-undirected-graph)
User Avatar
#2375
392
views
0 answers
0 votes
Space Complexity
The space complexity of which of the following algorithms depends on ordering of input:a.Heap Sortb.Merge Sortc. Quick Sort.d. All of these
User Avatar
#2376
596
views
2 answers
1 votes
Asymptotic notations
g(n)=Ώ(n)h(n)=O(n)g(n) . h(n) =?
User Avatar
#2377
1.7k
views
3 answers
3 votes
Quick Sort
"Quick sort has good cache performance" , Can anyone explain this statement.How is cache related to quick sort.I searched for this over the internet but could not find a good article.
User Avatar
#2378
677
views
1 answers
1 votes
Divide and Conquer
Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a ... be easily modified for sorting this array and what is the obtainable time complexity ?
User Avatar
#2379
2.2k
views
1 answers
1 votes
True/False?
The depth of any DFS (Depth First Search) tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex.I think in line graph has the same depth in both DFS and BFS. So it may be false.
User Avatar
#2380
3.4k
views
2 answers
1 votes
Algorithms
Solve thisT(n) = 0.5T(n/2)+1 ; T(1)=1
User Avatar
Page: