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

Recent questions in Algorithms

1 votes
1 answer
2563
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
2564
Test by Bikram | Algorithms | Test 2 | Question: 19
A hash table of length $7$ uses open addressing with hash function $h(k) = k \text{mod }7$ ... table ? $49,35,75,89,28,16$ $49,28,35,16,75,89$ $75,49,35,89,28,16$ $49,35,28,75,16,89$
A hash table of length $7$ uses open addressing with hash function $h(k) = k \text{mod }7$ and linear probing to resolve collisions.After inserting 6 values in an empty h...
User Avatar
2 votes
1 answer
2565
Test by Bikram | Algorithms | Test 2 | Question: 20
Consider the following Graph G: The number of minimum cost spanning trees using Kruskal's Algorithm is _________ .
Consider the following Graph G: The number of minimum cost spanning trees using Kruskal's Algorithm is _________ .
User Avatar
1 votes
1 answer
2567
Test by Bikram | Algorithms | Test 2 | Question: 17
Which of the following are TRUE? $n! = \theta ((n + 1)!)$ $\log4 n = \theta ( \log2 n )$ $\sqrt{\log n} = O(\log \log n)$ (i) & (iii) only (i) & (ii) only (ii) only (i),(ii) and (iii)
Which of the following are TRUE?$n! = \theta ((n + 1)!)$$\log4 n = \theta ( \log2 n )$$\sqrt{\log n} = O(\log \log n)$(i) & (iii) only(i) & (ii) only(ii) only(i),(ii) ...
User Avatar
0 votes
2 answers
2568
Test by Bikram | Algorithms | Test 2 | Question: 15
The length of the longest common subsequence of $L = ( 1,0,0,1,0,1,0,1 )$ and $K =( 0,1,0,1,1,0,1,1,0 )$ is __________.
The length of the longest common subsequence of $L = ( 1,0,0,1,0,1,0,1 )$ and $K =( 0,1,0,1,1,0,1,1,0 )$ is __________.
User Avatar
0 votes
1 answer
2569
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
2 votes
2 answers
2570
Test by Bikram | Algorithms | Test 2 | Question: 14
Match the following: ... S 1 - S, 2 - R, 3 - Q, 4- R, 5 - S 1 - S, 2 - P, 3 - Q, 4- R, 5 - S
Match the following:$\begin{array}{|l|l|l|l|} \hline (1) & \text{Multistage graph} & (P) & \text{Divide and conquer}\\ \hline (2) & \text{Convex hull } & (Q) & \text{Dept...
User Avatar
1 votes
2 answers
2571
Test by Bikram | Algorithms | Test 2 | Question: 13
Which one of the following is a topological sort for the above graph? $1, 6, 2, 5, 3, 4$ $4, 5, 6, 3, 2, 1$ $2, 4, 5, 6, 3, 1$ $6, 4, 5, 2, 1, 3$
Which one of the following is a topological sort for the above graph?$1, 6, 2, 5, 3, 4$$4, 5, 6, 3, 2, 1$$2, 4, 5, 6, 3, 1$$6, 4, 5, 2, 1, 3$
User Avatar
0 votes
1 answer
2572
Test by Bikram | Algorithms | Test 2 | Question: 12
The time complexity of the function mentioned below is: void f(int k[], int n) { int i; printf("%d",n); for(i=0; i<n; i++) { printf("%d",k[i]); } printf("n"); } $O(n^2)$ $O(n \log n)$ $O(n)$ $O(n^3)$
The time complexity of the function mentioned below is:void f(int k[], int n) { int i; printf("%d",n); for(i=0; i<n; i++) { printf("%d",k[i]); } printf("n"); }$O(n^2)$$O(...
User Avatar
1 votes
2 answers
2574
Test by Bikram | Algorithms | Test 2 | Question: 10
In Strassen's Matrix Multiplication, what is the number of additions and multiplications done to get a better complexity than the normal matrix multiplication? $7$ and $16$ $18$ and $7$ $10$ and $8$ $7$ and $7$
In Strassen's Matrix Multiplication, what is the number of additions and multiplications done to get a better complexity than the normal matrix multiplication?$7$ and $16...
User Avatar
0 votes
1 answer
2576
Test by Bikram | Algorithms | Test 2 | Question: 9
Linked Lists are not suitable for : Binary Search Polynomial Manipulation Insertion Radix Sort
Linked Lists are not suitable for :Binary SearchPolynomial ManipulationInsertionRadix Sort
User Avatar
0 votes
2 answers
2577
Test by Bikram | Algorithms | Test 2 | Question: 6
$O(n^k)$ is complexity of the best method that finds longest Palindrome Substring in a word. For example, in the word "Atatb", the longest palindrome string is "tat". Then, the value of $10^*K$ is __________.
$O(n^k)$ is complexity of the best method that finds longest Palindrome Substring in a word. For example, in the word "Atatb", the longest palindrome string is "tat". The...
User Avatar
0 votes
1 answer
2580
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
Page: