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

Filter

Hot questions in Algorithms

0 votes
1 answer
3632
Madeeasy test series
f(n)=Ω(n) g(n)=Ω($n^{2}$) then f(n)+g(n) is? 1)Ω(n) 2)ϴ(n) 3)Ω($n^{2}$) 4)Ο(n)
f(n)=Ω(n) g(n)=Ω($n^{2}$) then f(n)+g(n) is?1)Ω(n)2)ϴ(n)3)Ω($n^{2}$)4)Ο(n)
User Avatar
0 votes
0 answers
3634
Targate
Here it is mentioned as a queue and not a priority queue ,what would be the answer ?
Here it is mentioned as a queue and not a priority queue ,what would be the answer ?
User Avatar
1 votes
1 answer
3635
Quicksort
Consider an array with following element 12, 18, 17,11, 13, 15, 16 ,14 The number of element will change their initial position after completion of partition algorithm by choosing 15 as a pivot are __ Please solve step by step.
Consider an array with following element12, 18, 17,11, 13, 15, 16 ,14The number of element will change their initial position after completion of partition algorithm by c...
User Avatar
0 votes
0 answers
3636
questions
User Avatar
2 votes
1 answer
3637
Made Easy
what will be the change in time when quick sort is used over the heap sort to sort the edges in order to find the MST using kruskal algorithm...no of edges = 16
what will be the change in time when quick sort is used over the heap sort to sort the edges in order to find the MST using kruskal algorithm...no of edges = 16
User Avatar
1 votes
1 answer
3638
Algorithm Doubt
Assume we are given that f(n) = Οg(n), then which of the following can be stated true 2f(n) = Ο(2g(n)) log f(n) = Ο(log (g(n)) g(n) ≠ Ω f(n) None of these
Assume we are given that f(n) = Οg(n), then which of the following can be stated true2f(n) = Ο(2g(n)) log f(n) = Ο(log (g(n))g(n) ≠ Ω f(n)None of these
User Avatar
0 votes
1 answer
3639
self doubta
please explain these few point: how is longest path between any pair of vertices different from diameter of a agraph.? in dijkstra algorithm,each edge is relaxed eaxtly one time..is it true or false?
please explain these few point:how is longest path between any pair of vertices different from diameter of a agraph.?in dijkstra algorithm,each edge is relaxed eaxtly one...
User Avatar
0 votes
2 answers
3640
ADA Testbook
What is the time complexity to count the number of leaf nodes in a tree? I am getting O(nlogn) but answer is O(n) please anybody explain in detail
What is the time complexity to count the number of leaf nodes in a tree? I am getting O(nlogn) but answer is O(n) please anybody explain in detail
User Avatar
1 votes
2 answers
3641
worst case lower bound
What is the meaning of upper bound and worst case lower bound here?
What is the meaning of upper bound and worst case lower bound here?
User Avatar
0 votes
1 answer
3642
Time complexity
Let A =[a1, a2, …, an] be a one-dimensional array of integers define a MEGA-PEAK in A to be an element ai belongs A such that ai >= aj for all aj with | j – i | <= 2. What is the time complexity to find MEGA-PEAK?
Let A =[a1, a2, …, an] be a one-dimensional array of integers define a MEGA-PEAK in A to be an element ai belongs A such that ai >= aj for all aj with | j – i | <= 2....
User Avatar
4 votes
1 answer
3645
GATE Overflow | Algorithms | Test 1 | Question: 13
You are given a 1 billion numbers. The time require in seconds to sort them provided sorting thousand numbers takes 100 microseconds will be _______ 10,000 512 300 65536
You are given a 1 billion numbers. The time require in seconds to sort them provided sorting thousand numbers takes 100 microseconds will be _______10,00051230065536
User Avatar
2 votes
1 answer
3649
quick sort
Is quick sort in-place algorithm?
Is quick sort in-place algorithm?
User Avatar
Page: