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
3271
T(n) =T(n^(1/2))+1
User Avatar
1 votes
1 answer
3272
bubble sort
A machine takes 200 second to sort 200 names, using bubble sort . In 800 seconds , it can approximately sort how many names?
A machine takes 200 second to sort 200 names, using bubble sort . In 800 seconds , it can approximately sort how many names?
User Avatar
0 votes
1 answer
3273
Huffman coding question
Question:What is the time complexity of Huffman algorithms when the input is already sorted
Question:What is the time complexity of Huffman algorithms when the input is already sorted
User Avatar
2 votes
2 answers
3274
longest common subsequence
For X= BDCABA and Y=ABCBDAB find length of lcs and no of such lcs..(solve it using table method)
For X= BDCABA and Y=ABCBDAB find length of lcs and no of such lcs..(solve it using table method)
User Avatar
1 votes
1 answer
3275
Test by Bikram | Algorithms | Test 2 | Question: 21
The number of comparisons required to find the maximum and minimum element in an array $A[n]$ using Divide and Conquer method is: $(3n/2)+ 2$ $(3n/2) - 2$ $3n$ $3n/2$
The number of comparisons required to find the maximum and minimum element in an array $A[n]$ using Divide and Conquer method is:$(3n/2)+ 2$$(3n/2) - 2$$3n$$3n/2$
User Avatar
0 votes
1 answer
3277
Test by Bikram | Algorithms | Test 2 | Question: 25
Let $T$ be a rooted ternary tree where each internal node of $T$ has a maximum of $3$ children. If root is at depth $0$, then maximum total number of vertices $T$ can have with depth $3$ is ______.
Let $T$ be a rooted ternary tree where each internal node of $T$ has a maximum of $3$ children. If root is at depth $0$, then maximum total number of vertices $T$ can hav...
User Avatar
0 votes
1 answer
3278
HOW TO FIND NO OF PASSES IN MERGE SORT
IF ONE USES STRAIGHT MERGE SORT TO THE FOLLOWING ELEMENTS 20,47,15,8,9,4,40,30,12,17 THEN THE ORDER OF THE ELEMENTS AFTER 2ND PASS OF THE ALGORITHM
IF ONE USES STRAIGHT MERGE SORT TO THE FOLLOWING ELEMENTS 20,47,15,8,9,4,40,30,12,17 THEN THE ORDER OF THE ELEMENTS AFTER 2ND PASS OF THE ALGORITHM
User Avatar
1 votes
1 answer
3279
MIT assignment Doubt
How the worst case of merge sort is O(n^2) according to the given MIT assignment pdf:- explain ?
How the worst case of merge sort is O(n^2) according to the given MIT assignment pdf:-explain ?
User Avatar
0 votes
1 answer
3280
Test by Bikram | Algorithms | Test 2 | Question: 26
Consider the following instance of the knapsack problem : ... above weights and benefits of items, if we need an optimal solution of fractional knapsack problem, the value of maximum benefit will be ______.
Consider the following instance of the knapsack problem :$\begin{array}{|c|c|c|c|c|c|} \hline \text{Item} & a & b & c & d & e \\ \hline \text{Benefit} & 15 & 12 & 9 & 16 ...
User Avatar
0 votes
1 answer
3282
Test by Bikram | Algorithms | Test 2 | Question: 3
Which of the following algorithms CANNOT be designed without recursion? Tower of Hanoi Fibonacci Series Tree Traversal None of the above
Which of the following algorithms CANNOT be designed without recursion?Tower of HanoiFibonacci SeriesTree TraversalNone of the above
User Avatar
0 votes
1 answer
3283
Test by Bikram | Algorithms | Test 2 | Question: 5
A problem called Boolean Parenthesis Matching (match all parenthesis in an expression) can be solved by: Greedy Approach Recursion Dynamic Approach Both [B] and [C]
A problem called Boolean Parenthesis Matching (match all parenthesis in an expression) can be solved by:Greedy ApproachRecursionDynamic ApproachBoth [B] and [C]
User Avatar
3 votes
2 answers
3284
Time complexity
User Avatar
0 votes
1 answer
3286
Back Edge
User Avatar
0 votes
1 answer
3288
algorithm
what is meant by an optimal algorithm with reference to questions asked in gate papers?
what is meant by an optimal algorithm with reference to questions asked in gate papers?
User Avatar
0 votes
1 answer
3289
Design and Analysis of Algorithm
We have a list of pairs [("Tariq",71),("Brinda",85),("Shweta",71),("Sunita",85),("Salma",72),("Uday",60)], where each pair consists of a student's name and his/her marks in a ... ,60),("Tariq",71),("Shweta",71),("Salma",72),("Sunita",85),("Brinda",85)]
We have a list of pairs [("Tariq",71),("Brinda",85),("Shweta",71),("Sunita",85),("Salma",72),("Uday",60)], where each pair consists of a student's name and his/her marks ...
User Avatar
Page: