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

#3441
533
views
1 answers
1 votes
#made easy
suppose a problem A reduces to problem B & reduction is done at $O(n^2)$ time.if the problem is solved in $O(n^3)$ time then what about the time of problem A___??$O(n^2)$O(n^3)$O(2^n)$O(n^5)$
User Avatar
#3442
329
views
2 answers
1 votes
#asymtotic notation
consider 2 function below1.f(n)=n2.g(n)=n^1+sinxwhich is true1.f(n)is g(n)2.f(n) is big omega(g(n))3.g(n) is O(f(n))4.none
User Avatar
#3443
536
views
1 answers
1 votes
test series
Devid has an algorithm X for a problem with time complexity X that is polynominal over input size.Jack has an algorithm Y for another problem with time complexity Y that is exponential ... (y)2.theta(X)=theta(Z)3.theta(Y)=theta(Z)4.O(Z)=X
User Avatar
#3444
1.0k
views
1 answers
1 votes
#made easy
Big oh estimate forf(x)=(x+1)log($x^2 +1$)+3$x^2$ is given as1.O(xlogx)2.O($x^2$)3.O($x^3$)4O($x^2$logx)
User Avatar
#3445
354
views
1 answers
1 votes
#made easy
soluation for the recurrence relation isf(x)=2T(floor(rootn))+logn1.O(nlogloglogn)2.O(nloglogn)3.O(loglogn)4O(lognloglogn)
User Avatar
#3446
355
views
1 answers
2 votes
#made easy
cosider following set of frequeciesmessage frequenciesa ... millionwhat will be the percentage improvement for total binary stram transmission using haffman coding over simple encoding
User Avatar
#3447
310
views
1 answers
1 votes
#made easy
given 2 sorted list of size m and n the number of comparison are required in worst case by merge sort algorithsm is1.mn2.max(m,n)3.min(m,n)4.m+n-1
User Avatar
#3448
609
views
1 answers
2 votes
made easy
which is true about huffman coding-1.Huffman coding may become loss in some time2.in Huffman coding no code is prefix of any other code3.huffman code may not be optimal lossless code in some case4.all of above
User Avatar
#3449
318
views
0 answers
1 votes
Space complexity
What is the best way to find the space complexity of a particular function ?
User Avatar
#3450
415
views
1 answers
2 votes
Asymptotic Notation
If f(n) is O(g(n)) and g(n) is not Ο(h(n)) then which one of following will always be TRUE?(a) f(n) = Θ (h(n)) (b) f(n) = O(h(n)) (c) f(n) = o(h(n)) (d) None
User Avatar
#3451
1.3k
views
1 answers
1 votes
Algorithms
Consider the following fragment of code for a graph algorithm on an undirected graph. for each vertex i in V mark i as visited for each edge (j,i) pointing into i ... is the number of edges.)(a) O(n)(b)O(nm)(c)O(n+m)(d)O(m)
User Avatar
#3452
2.5k
views
1 answers
3 votes
UGC NET CSE | December 2011 | Part 2 | Question: 3
Which of the following is a bad example of recursion ?FactorialFibonacci numbersTower of HanaiTree traversal
User Avatar
#3453
572
views
2 answers
4 votes
Recurrence relation
Which of the following is/are TRUE?1. n! = $\Theta$ ((n+1)!)2.log n base 4 =$\Theta$ (log n base 2)3. √log n = O (log log n)A) 1 and 2 onlyB) 1 and 3 onlyC) 2 onlyD) 1, 2 and 3 only
User Avatar
#3454
2.6k
views
1 answers
3 votes
time complexity to solve recurrence relation
recurrence relation for the functional value of F(n) is given below :$F(n) = a_{1}F(n-1) + a_{2}F(n-2) + a_{3}F(n-3) + \ldots + a_{k}F(n-k)$ where $a_{i} =$ non ... $O(n)$ )C. Logarithmic ( $O(\log n)$ )D. $O(n \log n)$
User Avatar
#3455
404
views
1 answers
1 votes
ace test series
User Avatar
#3456
3.2k
views
2 answers
3 votes
Pick the true statement for an algorithm
Pick the true statement for an algorithm:A) An algorithm can have zero or more inputs but must have one or more outputs.B) An algorithm can have one or ... more inputs and outputs.D) An algorithm can have one or more inputs and outputs
User Avatar
#3457
4.8k
views
1 answers
5 votes
UGC NET CSE | December 2015 | Part 3 | Question: 21
Let $n=4$ and $(a_1, a_2, a_3, a_4)$ ... $x$ being searched satisfy $a_i < x < a_{i+1}$ respectively. The optimal search tree is given by:
User Avatar
#3458
2.1k
views
1 answers
3 votes
UGC NET CSE | December 2015 | Part 3 | Question: 20
Floyd-Warshall algorithm utilizes _____ to solve the all-pairs shortest paths problem on a directed graph in ____ timeGreedy algorithm, $\theta(V^3)$ ... programming, $\theta(V^3)$Dynamic programming, $\theta(V^2 lgn)$
User Avatar
#3459
2.0k
views
2 answers
2 votes
UGC NET CSE | December 2015 | Part 3 | Question: 19
The solution of the reccurence relation ... $O(\lg n)$O(n)$O(n \lg n)$None of the above
User Avatar
#3460
4.4k
views
1 answers
2 votes
UGC NET CSE | December 2015 | Part 3 | Question: 18
If there are n integers to sort, each integer had d digits and each digit is in the set $\{1, 2, \dots, k\}$, radix sort can sort the numbers in$O(d \: n \: k)$O(d n^k)$O(d+n)k)$O(d(n+k))$
User Avatar
Page: