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|c|c|c|c|c|c|}\hline \textbf{Year}& \textbf{2026 - 1}& \textbf{2026 - 2}& \textbf{2025 - 1}& \textbf{2025 - 2}& \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}&4&4&2&2&1&2&2&2&3&2&1&2.4&4\\\hline \textbf{2 Marks Count}&6&4&3&3&4&2&2&2&3&4&2&3.3&6\\\hline \textbf{Total Marks}&16&12&8&8&9&6&6&6&9&10&\bf{6}&\bf{9}&\bf{16}\\\hline \end{array}}}$$

Filter

Questions without answers in Algorithms

0 0 votes
0 0 answers
69
69 views
Recurrence
Q.${Solve}$ ${Recurrence}$.$T(n) = T\left(\frac{n}{15}\right) + T\left(\frac{n}{10}\right) + 2T\left(\frac{n}{6}\right) + \sqrt{n}$ 
User Avatar
0 0 votes
0 0 answers
101
101 views
basics
User Avatar
0 0 votes
0 0 answers
121
121 views
UGC NET CSE | December 2025 | Part 2 | Question: 42
Arrange the following algorithms from the most efficient to least efficient based on their time complexity.Kruskal's AlgorithmBreadth first search AlgorithmBellman-Ford A...
User Avatar
0 0 votes
0 0 answers
346
346 views
GATE CSE 2026 | Set 2 | Algorithms | Memory Based | Question 19
In dynamic programming,$\verb|A[i][j]|$ is a term, for $1 \leq \verb|i|, \verb|j| \leq n$$\verb|A[0][k] = A[k][0] = 0|$$\verb|A[i][j] = 2A[i-1][j] + 3A[i][j-1]|$Which of ...
User Avatar
1 1 vote
0 0 answers
121
121 views
I don't know
(a) Show that sorting all small subarrays using Insertion Sort takes Θ(n) worst-case time.(b) Show that the merging work done above this cutoff level takes Θ(n log n) wor...
User Avatar
0 0 votes
0 0 answers
422
422 views
Made easy test series
In this question why option C is correct and option B is wrong?
User Avatar
0 0 votes
0 0 answers
371
371 views
gate cse 2015 set 1 question 43
hey i am trying to solve this question GATE CSE 2015 Set 1 | Question: 43 so what is my doubt is if i take the dijkstras algo for mcst then this is right but when i am tr...
User Avatar
1 1 vote
0 0 answers
334
334 views
GO Classes DPP | Algorithm|ALGORITHM DESIGN
Consider the following algorithm findCenterAlgo that takes a tree $T$ as input.findCenterAlgo (T)1. Let $T_{\text {current }}$ be a copy of the input tree $T$.2. While th...
User Avatar
0 0 votes
0 0 answers
222
222 views
UGC NET CSE | June 2025 | Part 2 | Question: 38
Which of the followings is Not a parent selection technique used in genetic algorithm implementationsRadialTournamentBoltzmannRank
User Avatar
0 0 votes
0 0 answers
195
195 views
UGC NET CSE | December 2023 | Part 2 | Question: 83
Arrange the following encoding strategies used in Genetic Algorithms (GAs) in the correct sequence starting from the initial step and ending with the final representation...
User Avatar
0 0 votes
0 0 answers
111
111 views
GO Classes CS Test Series | Algorithms | Subject Wise Test 3 | Question: 30
Consider the Code fragment of code written in C:Int bar(int n){ if(n <= 10){ return 0; } if( n < 100){ Int r = 0; for(int i = 0; i < n; i + +){ r++; } return r; } return ...
User Avatar
0 0 votes
0 0 answers
190
190 views
asymtotic notations
Q - check whether (logn)! is polynomially bounded ?given ans - condtion for the function f(n) to be polynomially bounded ( f(n) = O(logn) ). ...
User Avatar
1 1 vote
0 0 answers
275
275 views
T(n)= 2T(n^1/2)+(log n/log log n) solve this using master theorem
User Avatar
0 0 votes
0 0 answers
244
244 views
Graph traversal
How can we make a DFS tree and a BFS tree of a graph?
User Avatar
0 0 votes
0 0 answers
328
328 views
Application of Algorithm
9. Application of mergesort _________A. Graphic cardB. NetworkingC. Card SortingD. Data Processing
User Avatar
1 1 vote
0 0 answers
237
237 views
Application of Sorting Algorithm
8. Application of quicksort _________A. Graphic cardB. Data ProcessingC. Tape sortingD. Card Sorting 
User Avatar
0 0 votes
0 0 answers
140
140 views
NIELIT Scientific Assistant June 2025 | Question: 44
The $\text{LU}$ factorization requires:$\dfrac{n^{3}}{6}-\dfrac{n}{5}$ multiplication/division$\dfrac{n^{3}}{3}-\dfrac{n^{2}}{2}+\dfrac{n}{6}$ addition/subtraction$\dfrac...
User Avatar
0 0 votes
0 0 answers
201
201 views
CMI Data Science 2025 | Part B | Question: 11
The following question appeared in a quiz:$\text{}$“Write the pseudocode for a function $\textit{Closest}(A, n, x)$ that takes an array $A$, a positive integer $n$, and a...
User Avatar
1 1 vote
0 0 answers
392
392 views
TIFR CSE 2025 | Part B | Question: 8
Let $G=(V, E)$ be a weighted, undirected and connected graph, with weight $1 \leq$ $\mathrm{wt}_{G}(e) \leq 99$ for edge $e \in E$. Suppose $G^{\prime}$ is the graph with...
User Avatar
2 2 votes
0 0 answers
392
392 views
TIFR CSE 2025 | Part B | Question: 13
There are $n$ people in a house and $n$ pairs of shoes such that the $i$-th shoe fits the $i$-th person's feet (and no one else's). A burglar comes and throws the shoes a...
User Avatar
1 1 vote
0 0 answers
474
474 views
ISI2025-MCS-PCB (Non-CS) | Question: 1
Consider the following function job(), which takes two positive integers $x$ and $y$, and returns another integer.int job(int x, int y) {if (x y) return x;else if (x y) ...
User Avatar
0 0 votes
0 0 answers
319
319 views
ISI2025-MCS-PCB (Non-CS) | Question: 3
Suppose $X=\left(x_{1}, x_{2}, \ldots, x_{n}\right)$ is an array of numbers (not necessarily integers) sorted in the ascending order, and $Y=\left(y_{1}, y_{2}, \ldots, y...
User Avatar
0 0 votes
0 0 answers
262
262 views
ISI2025-MCS-PCB (CS) | Question: 3
Suppose $X=\left(x_{1}, x_{2}, \ldots, x_{n}\right)$ is an array of numbers (not necessarily integers) sorted in the ascending order, and $Y=\left(y_{1}, y_{2}, \ldots, y...
User Avatar
1 1 vote
0 0 answers
400
400 views
#self doubt
Are the following statements correct? Can someone please verify? My doubt is related to how function grows when we talk about small and big notation.f(n) is asymptoticall...
User Avatar
0 0 votes
0 0 answers
314
314 views
Time Complexity Analysis
Please give me suggestion I am Good at conceptual in algorithms but i am issue facing at Find time complexity of any problem.What Can i do resolve this problem .I revised...
User Avatar
0 0 votes
0 0 answers
225
225 views
CMI 2024 | Data Science | Part B | Question: 14
You are given a strange, analogue wall clock whose hour and minute hands are identical. Both the hands move continuously and there is no second hand. How many times are t...
User Avatar
0 0 votes
0 0 answers
185
185 views
CMI 2024 | Data Science | Part B | Question: 17
An electronic card shuffling machine always rearranges the cards in the same way relative to the order in which they are placed in it. One iteration of shuffling means th...
User Avatar
0 0 votes
0 0 answers
151
151 views
CMI 2023 | Data Science | Part B | Question: 13
Let $\mathrm{A}, \mathrm{B}$ and C denote arrays of real numbers, where B has $\mathrm{n}-1$ entries and $\mathrm{A}, \mathrm{C}$ have n entries each. Consider the follow...
User Avatar
To see more, click for the full list of questions or popular tags.