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

#3541
8.1k
views
2 answers
9 votes
Cormen 2nd edition Exercise 11.2-1
Suppose we use a hash function h to hash n distinct keys into an array T of length m. Assuming simple uniform hashing, what is the expected number of collisions?
User Avatar
#3542
4.7k
views
2 answers
2 votes
Find which recurrence relaton is not polynomial?
If T (0) = T (1 ) = 1, each of the following recurrences for n ≥ 2 defines a function T on the non negative integers. Which of the following CANNOT be bounded by a ... (n)= 2T(n-2)+1T (n)= T(n-1)+ n2How to solve this?Please explain
User Avatar
#3543
2.1k
views
2 answers
0 votes
UGC NET CSE | June 2014 | Part 3 | Question: 66
Suppose that the splits at every level of quicksort are in the proportion $(1 - \alpha)$ to $\alpha$, where $0<\alpha\leq\frac{1}{2}$ is a constant. The minimum depth ... $-\frac{lg\alpha}{lgn}$
User Avatar
#3544
22.7k
views
4 answers
2 votes
Find he minimum number of scalar multiplications in matrix multiplication
Four matrices M1, M2, M3, and M4 have dimensions p x q, q x r, r x s, and s x t respectively can be multiplied in several ways with different number of ... = 5, and t = 80, then what is the minimum number of scalar multiplications needed ?
User Avatar
#3545
580
views
1 answers
2 votes
Find the complexity of recurrence equation:
A scientist developed a new algorithm for computation and he observed that ot follows the recurrence equation as ... is the complexity of new algorithm?$2^n$2^{n+1}$2^{n-1}$None of these
User Avatar
#3546
630
views
1 answers
0 votes
Find the upper bound of computing time
Please explain how to solve this??What is the upper bound of computing time of m coloring decison problem for n nodes?a. O( n m)b. O( m n)c. O( n m n )d. O( m n m )e. O( n m m n )
User Avatar
#3547
1.3k
views
3 answers
1 votes
UGC NET CSE | December 2012 | Part 3 | Question: 14
Let $T(n)$ be a function defined by $T(n) =1$ and $T(n)=2T (n/2) + \sqrt{n}$, which of the following is true?$T(n) = O(\sqrt{n})$T(n) = O(\log_2 n)$T(n) = O(n)$T(n) = O(n^2)$
User Avatar
#3548
2.6k
views
1 answers
1 votes
UGC NET CSE | June 2014 | Part 3 | Question: 63
The solution of the recurrence relation of $ T(n)=3T\left(floor \left(\frac{n}{4}\right)\right)+n$ is$O(n^{2})$O(n/g n)$O(n)$ $O(l g n)$
User Avatar
#3549
7.7k
views
2 answers
1 votes
UGC NET CSE | June 2014 | Part 3 | Question: 62
Consider the fractional knapsack instance ... is given by (Assume $p$ and $w$ denotes profit and weight of objects respectively)$40$38$ $32$30$
User Avatar
#3550
1.6k
views
1 answers
1 votes
UGC NET CSE | June 2014 | Part 3 | Question: 61
Given the following equalities : $E_{1}: n^{K+\in} + n^{K} \lg n = \theta (n^{K+\in})$ for all fixed $K$ and $\in, K \geq 0$ and $\in >0$ ... $E_{2}$ is correct.$E_{1}$ is not correct and $E_{2}$ is not correct.
User Avatar
#3551
2.0k
views
2 answers
1 votes
TestBook Test Series: Algorithms - Time Complexity
On which of the following recurrence relation Masters theorem can not be applied ?A. T(n)= 2T(n/2) + n (log n).B. T(n) = T(n/2) + 1.C. T(n) = 8T(n/2) + (log n).D. T(n) = 7(T(n/4) + n2.
User Avatar
#3552
760
views
1 answers
3 votes
recurrence ,please tell me which method should i apply? is geometric expansion ??
find solution to the recurrence equation $T(2^k) = 3 T(2^{k-1}) + 1, T (1) = 1$,
User Avatar
#3553
3.3k
views
2 answers
0 votes
UGC NET CSE | June 2014 | Part 3 | Question: 33
________ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution.Best first searchGoal stack planning Alpha-beta pruning procedureMin-max search
User Avatar
#3554
3.1k
views
2 answers
0 votes
UGC NET CSE | June 2014 | Part 3 | Question: 31
Consider $f(N) = g(N) + h(N)$ Where function $g$ is a measure of the cost of getting from the start node to the current node. $N$ and $h$ ... ?$A^{*}$algorithm$AO^{*}$ algorithmGreedy best first search algorithmIterative $A^{*}$ algorithm
User Avatar
#3555
392
views
1 answers
0 votes
algorithms analysis
Q; Consider the following functions: f(n)=2n g(n)= n! h(n)= nlognso what is the Asymptotic behavior of f(n),g(n) and h(n) is tryea. f(n)=O(g(n ... (f(n)) d. h(n)=O(f(n));g(n)=O(f(n))
User Avatar
#3556
764
views
0 answers
2 votes
What is the complexity of a generate-and test algorithm?
In the absence of a comparator, the time complexity of a generate-and test type of algorithm to sort n numbers would be of the order : (A) log n(B) n2(C) n(D) n!
User Avatar
#3557
2.9k
views
1 answers
2 votes
UGC NET CSE | June 2012 | Part 3 | Question: 51
The strategy used to reduce the number of tree branches and the number of static evaluations applied in case of a game tree isMinmax strategyAlpha-beta pruning strategyConstraint satisfaction strategyStatic max strategy
User Avatar
#3558
748
views
2 answers
0 votes
Asymptotic Notation
If f(n) = big_omega(n), g(n) = O(n) and h(n) = ⊙(n) then what is f(n).g(n) + h(n) ?
User Avatar
#3559
38.4k
views
15 answers
64 votes
GATE CSE 2007 | Question: 15, ISRO2016-26
Consider the following segment of C-code:int j, n; j = 1; while (j <= n) j = j * 2;The number of comparisons made in the execution of the loop for any $n > 0$ is:$\lceil \log_2n \rceil +1$n$\lceil \log_2n \rceil$\lfloor \log_2n \rfloor +1$
User Avatar
#3560
14.0k
views
2 answers
4 votes
UGC NET CSE | June 2012 | Part 2 | Question: 2
The post order traversal of a binary tree is DEBFCA. Find out the pre-order traversalABFCDEADBFECABDECFNone of the above
User Avatar
Page: