menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Recent questions in Algorithms

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

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{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&0&2&2&3&3&0&2&3
\\\hline\textbf{2 Marks Count}&2&4&2&3&2&3&2&2.7&4
\\\hline\textbf{Total Marks}&6&8&6&8&7&9&\bf{6}&\bf{7.3}&\bf{9}\\\hline
\end{array}}}$$

Recent questions in Algorithms

2 votes
9 answers
1
NIELIT 2016 MAR Scientist B - Section C: 12
Which of the following sorting algorithms does not have a worst case running time of $O(n​^2​)$? Insertion sort. Merge sort. Quick sort. Bubble sort.
Which of the following sorting algorithms does not have a worst case running time of $O(n​^2​)$? Insertion sort. Merge sort. Quick sort. Bubble sort.
asked Mar 31 in Algorithms Lakshman Patel RJIT 391 views
0 votes
1 answer
2
NIELIT 2016 MAR Scientist B - Section C: 19
If there is in NP-Complete language L whose complement is in NP, then complement of any language in NP is in P NP both (A) and (B) None of these
If there is in NP-Complete language L whose complement is in NP, then complement of any language in NP is in P NP both (A) and (B) None of these
asked Mar 31 in Algorithms Lakshman Patel RJIT 154 views
0 votes
3 answers
3
NIELIT 2016 MAR Scientist B - Section C: 22
Time complexity of an algorithm $T(n)$, where $n$ is the input size is given by $\begin{array}{ll}T(n) & =T(n-1)+1/n, \text{ if }n>1\\ & =1, \text{ otherwise} \end{array}$ The order of this algorithm is $\log n$ $n$ $n^2$ $n^n$
Time complexity of an algorithm $T(n)$, where $n$ is the input size is given by $\begin{array}{ll}T(n) & =T(n-1)+1/n, \text{ if }n>1\\ & =1, \text{ otherwise} \end{array}$ The order of this algorithm is $\log n$ $n$ $n^2$ $n^n$
asked Mar 31 in Algorithms Lakshman Patel RJIT 160 views
0 votes
1 answer
4
NIELIT 2016 DEC Scientist B (IT) - Section B: 5
Two alternative packages $A$ and $B$ are available for processing a database having $10k$ records. Package $A$ requires $0.0001n2$ time units and package $B$ requires $10 n \log 10n$ time units​ ​ to process $n$ records. What is the smallest value of $k$ for which package $B$ will be preferred over $A$? $12$ $10$ $6$ $5$
Two alternative packages $A$ and $B$ are available for processing a database having $10k$ records. Package $A$ requires $0.0001n2$ time units and package $B$ requires $10 n \log 10n$ time units​ ​ to process $n$ records. What is the smallest value of $k$ for which package $B$ will be preferred over $A$? $12$ $10$ $6$ $5$
asked Mar 31 in Algorithms Lakshman Patel RJIT 97 views
0 votes
1 answer
5
NIELIT 2016 DEC Scientist B (IT) - Section B: 7
What is the type of the algorithm used in solving the $4$ Queens problem? Greedy Branch and Bound Dynamic Backtracking
What is the type of the algorithm used in solving the $4$ Queens problem? Greedy Branch and Bound Dynamic Backtracking
asked Mar 31 in Algorithms Lakshman Patel RJIT 94 views
0 votes
2 answers
6
NIELIT 2016 DEC Scientist B (IT) - Section B: 8
Selection sort, quick sort is a stable sorting method True,True False,False True,False False,True
Selection sort, quick sort is a stable sorting method True,True False,False True,False False,True
asked Mar 31 in Algorithms Lakshman Patel RJIT 111 views
0 votes
1 answer
7
NIELIT 2016 DEC Scientist B (IT) - Section B: 12
Which of the following sorting procedures is the slowest? Quick Sort Merge Sort Shell Sort Bubble Sort
Which of the following sorting procedures is the slowest? Quick Sort Merge Sort Shell Sort Bubble Sort
asked Mar 31 in Algorithms Lakshman Patel RJIT 79 views
0 votes
1 answer
8
NIELIT 2016 DEC Scientist B (IT) - Section B: 16
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with $n$ discs is: $T(n)=2T(n-2)+2$ $T(n)=2T(n/2)+1$ $T(n)=2T(n-1)+n$ $T(n)=2T(n-1)+1$
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with $n$ discs is: $T(n)=2T(n-2)+2$ $T(n)=2T(n/2)+1$ $T(n)=2T(n-1)+n$ $T(n)=2T(n-1)+1$
asked Mar 31 in Algorithms Lakshman Patel RJIT 80 views
0 votes
1 answer
9
NIELIT 2016 DEC Scientist B (IT) - Section B: 27
Complexity of Kruskal's algorithm for finding minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is: $O(mn)$ $O(m)$ $O(m+n)$ $O(n)$
Complexity of Kruskal's algorithm for finding minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is: $O(mn)$ $O(m)$ $O(m+n)$ $O(n)$
asked Mar 31 in Algorithms Lakshman Patel RJIT 81 views
0 votes
1 answer
10
NIELIT 2016 DEC Scientist B (IT) - Section B: 52
Find the odd one out Merge Sort TVSP Problem Knapsack Problem OBST Problem
Find the odd one out Merge Sort TVSP Problem Knapsack Problem OBST Problem
asked Mar 31 in Algorithms Lakshman Patel RJIT 85 views
0 votes
1 answer
11
NIELIT 2016 DEC Scientist B (CS) - Section B: 7
The Knapsack problem belongs to which domain of problems? Optimization NP complete Linear Solution Sorting
The Knapsack problem belongs to which domain of problems? Optimization NP complete Linear Solution Sorting
asked Mar 31 in Algorithms Lakshman Patel RJIT 135 views
0 votes
2 answers
12
NIELIT 2016 DEC Scientist B (CS) - Section B: 12
The running time of Quick sort algorithm depends heavily on the selection of: No. of inputs Arrangement of elements in an array Size of elements Pivot Element
The running time of Quick sort algorithm depends heavily on the selection of: No. of inputs Arrangement of elements in an array Size of elements Pivot Element
asked Mar 31 in Algorithms Lakshman Patel RJIT 83 views
0 votes
2 answers
13
NIELIT 2016 DEC Scientist B (CS) - Section B: 16
Two main measures for the efficiency of an algorithm are: Processor and Memory Complexity and Capacity Time and Space Data and Space
Two main measures for the efficiency of an algorithm are: Processor and Memory Complexity and Capacity Time and Space Data and Space
asked Mar 31 in Algorithms Lakshman Patel RJIT 71 views
0 votes
1 answer
14
NIELIT 2016 DEC Scientist B (CS) - Section B: 27
What is the solution to the recurrence $T(n)=T \bigg (\dfrac{n}{2} \bigg )+n$? $O(\log n)$ $O(n)$ $O(n\log n)$ None of these
What is the solution to the recurrence $T(n)=T \bigg (\dfrac{n}{2} \bigg )+n$? $O(\log n)$ $O(n)$ $O(n\log n)$ None of these
asked Mar 31 in Algorithms Lakshman Patel RJIT 91 views
0 votes
1 answer
15
NIELIT 2016 DEC Scientist B (CS) - Section B: 52
The concept of order Big O is important because It can be used to decide the best algorithm that solves a given problem It is the lower bound of the growth rate of algorithm It determines the maximum size of a problem that can be solved in a given amount of time Both (A) and (B)
The concept of order Big O is important because It can be used to decide the best algorithm that solves a given problem It is the lower bound of the growth rate of algorithm It determines the maximum size of a problem that can be solved in a given amount of time Both (A) and (B)
asked Mar 31 in Algorithms Lakshman Patel RJIT 72 views
0 votes
2 answers
16
NIELIT 2017 July Scientist B (IT) - Section B: 59
What is the running time of the following function (specified as a function of the input value)? void Function(int n){ int i=1; int s=1; while(s<=n){ i++; s=s+i; } } $O(n)$ $O(n^2)$ $O(1)$ $O(\sqrt n)$
What is the running time of the following function (specified as a function of the input value)? void Function(int n){ int i=1; int s=1; while(s<=n){ i++; s=s+i; } } $O(n)$ $O(n^2)$ $O(1)$ $O(\sqrt n)$
asked Mar 30 in Algorithms Lakshman Patel RJIT 189 views
0 votes
1 answer
17
NIELIT 2017 July Scientist B (IT) - Section B: 60
$0/1$-Knapsack is a well known problem where, it is desired to get the maximum total profit by placing $n$ items (each item is having some weight and associated profit) into a knapsack of capacity $W$. The table given below shows the weights and associated ... $19$ $18$ $17$ $20$
$0/1$-Knapsack is a well known problem where, it is desired to get the maximum total profit by placing $n$ items (each item is having some weight and associated profit) into a knapsack of capacity $W$. The table given below shows the weights and associated profits for $5$ items, where one unit of ... $19$ $18$ $17$ $20$
asked Mar 30 in Algorithms Lakshman Patel RJIT 59 views
0 votes
1 answer
18
NIELIT 2017 July Scientist B (CS) - Section B: 9
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are $\Theta(n \log n),\Theta(n \log n) \text{ and } \Theta(n^2)$ $\Theta(n^2),\Theta(n^2)\text{ and } \Theta(n \log n)$ $\Theta(n^2), \Theta(n \log n)\text{ and } \Theta(n \log n)$ $\Theta(n^2),\Theta(n\log n) \text{ and } \Theta(n^2)$
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are $\Theta(n \log n),\Theta(n \log n) \text{ and } \Theta(n^2)$ $\Theta(n^2),\Theta(n^2)\text{ and } \Theta(n \log n)$ $\Theta(n^2), \Theta(n \log n)\text{ and } \Theta(n \log n)$ $\Theta(n^2),\Theta(n\log n) \text{ and } \Theta(n^2)$
asked Mar 30 in Algorithms Lakshman Patel RJIT 73 views
0 votes
1 answer
19
NIELIT 2017 July Scientist B (CS) - Section B: 39
Which of the following standard algorithms is not Dynamic Programming based? Bellman-Ford Algorithm for single source shortest path Floyd Warshall Algorithm for all pairs shortest paths $0-1$ Knapsack problem Prim’s Minimum Spanning Tree
Which of the following standard algorithms is not Dynamic Programming based? Bellman-Ford Algorithm for single source shortest path Floyd Warshall Algorithm for all pairs shortest paths $0-1$ Knapsack problem Prim’s Minimum Spanning Tree
asked Mar 30 in Algorithms Lakshman Patel RJIT 91 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...