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

Recent questions in Algorithms

1 1 vote
2 2 answers
911
911 views
NIELIT Scientist B 2020 November: 101
The program written for binary search, calculates the midpoint of the span as $\text{mid : =(Low+High)/2}$. The program works well if the number of elements in the list i...
User Avatar
1 1 vote
1 1 answer
797
797 views
NIELIT Scientist B 2020 November: 113
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order $\text{20, 47, 15, 8, 9, 4, 40, 30, 12, 17}$ then the order of these e...
User Avatar
1 1 vote
1 1 answer
907
907 views
NIELIT Scientific Assistant A 2020 November: 63
What is the product of following matrix using Strassen’s matrix multiplication algorithm?$$ A=\begin {bmatrix} 1&3\\ 5 &7 \end{bmatrix} \;\;\;\;\;\; B=\begin {bma...
User Avatar
1 1 vote
1 1 answer
1.1k
1.1k views
NIELIT Scientific Assistant A 2020 November: 64
Which of the following is a correct time complexity to solve the $0/1$ knapsack problem where $n$ and $w$ represents the number of items and capacity of knapsack respecti...
User Avatar
1 1 vote
1 1 answer
815
815 views
NIELIT Scientific Assistant A 2020 November: 65
Finding the location of the element with a given value is :TraversalSearchSortNone of the options
User Avatar
1 1 vote
1 1 answer
1.1k
1.1k views
NIELIT Scientific Assistant A 2020 November: 79
Which of the following algorithms can be used to most efficiently find whether a cycle is present in a given graph?Prim’s Minimum Spanning Tree AlgorithmBreadth First Sea...
User Avatar
1 1 vote
2 2 answers
905
905 views
NIELIT Scientific Assistant A 2020 November: 83
Which of the following is correct recurrence for worst case of QuickSort?$T(n)=T(n-4)+T(n-2)+O(1)$$T(n)=T(n-1)+T(0)+O(n)$$T(n)=2T(n/2)+O(n)$$T(n)=4T(n/2)+O(n)$
User Avatar
2 2 votes
2 2 answers
1.8k
1.8k views
NIELIT Scientific Assistant A 2020 November: 88
The given array is $\text{arr={1, 2, 4, 3}}$. Bubble sort is used to sort the array elements. How many passes will be done to sort the array?$4$$2$$1$$3$
User Avatar
3 3 votes
1 1 answer
1.4k
1.4k views
NIELIT Scientific Assistant A 2020 November: 101
What is the time complexity of the following recursive function?int ComputFun(int n) { if(n<=2) return 1; else return (ComputFun(floor(sqrt(n)))+n); }$\Theta(n)$$\Theta(\...
User Avatar
2 2 votes
1 1 answer
1.0k
1.0k views
NIELIT Scientific Assistant A 2020 November: 103
Consider an array of positive integers between $123456$ to $876543$, which sorting algorithm can be used to sort these number in linear time?Impossible to sort in linear ...
User Avatar
1 1 vote
1 1 answer
1.3k
1.3k views
NIELIT Scientific Assistant A 2020 November: 105
Assembly line scheduling and Longest Common Subsequence problems are an example of _______.Dynamic ProgrammingGreedy AlgorithmsGreedy Algorithms and Dynamic Programming r...
User Avatar
0 0 votes
1 1 answer
3.0k
3.0k views
UGC NET CSE | October 2020 | Part 2 | Question: 25
If algorithm $A$ and another algorithm $B$ take $\log_2 (n)$ and $\sqrt{n}$ microseconds, respectively, to solve a problem, then the largest size $n$ of a problem these a...
User Avatar
2 2 votes
4 4 answers
3.1k
3.1k views
UGC NET CSE | October 2020 | Part 2 | Question: 52
The running time of an algorithm is $O(g(n))$ if and only ifits worst-case running time is $O(g(n))$ and its best-case running time is $\Omega(g(n)) \cdot (O= \textit{ bi...
User Avatar
0 0 votes
1 1 answer
1.2k
1.2k views
UGC NET CSE | October 2020 | Part 2 | Question: 69
Match $\text{List I}$ with $\text{List II}$With reference to CMM developed by Software Engineering Institute (SEI)$\begin{array}{llll} & \text{List I} && \text{List II} \...
User Avatar
0 0 votes
2 2 answers
1.9k
1.9k views
UGC NET CSE | October 2020 | Part 2 | Question: 70
Match $\text{list I}$ with $\text{List II}$$\begin{array}{llll} & \text{List I} && \text{List II} \\ (A) & \text{Topological sort of DAG} & (I) & O(V+E) \\ (B) & \text{Kr...
User Avatar
1 1 vote
1 1 answer
1.4k
1.4k views
UGC NET CSE | October 2020 | Part 2 | Question: 73
Match $\text{List I}$ with $\text{List II}$$\begin{array}{llll} & \text{List I} & & \text{List II} \\ (A) & \text{Greedy Best-First Search} & (I) & \text{Space complexity...
User Avatar
1 1 vote
2 2 answers
3.0k
3.0k views
UGC NET CSE | October 2020 | Part 2 | Question: 78
Consider the undirected graph below:Using Prim’s algorithm to construct a minimum spanning tree starting with node $a$, which one of the following sequences of edges repr...
User Avatar
0 0 votes
1 1 answer
2.3k
2.3k views
UGC NET CSE | October 2020 | Part 2 | Question: 90
Given below are two statements:Statement $\text{I}$: A genetic algorithm is a stochastic hill-climbing search in which a large population of states is maintainedStatement...
User Avatar
2 2 votes
3 3 answers
1.7k
1.7k views
NIELIT 2016 MAR Scientist C - Section C: 18
Two alternative package $A$ and $B$ are available for processing a database having $10^{k}$ records. Package $A$ requires $0.0001 n^{2}$ time units and package $B$ requir...
User Avatar
3 3 votes
2 2 answers
1.4k
1.4k views
NIELIT 2016 MAR Scientist C - Section C: 51
The most efficient algorithm for finding the number of connected components in a $n$ undirected graph on $n$ vertices and $m$ edges has time complexity$\Theta (n)$$\Theta...
User Avatar
Page: