Register

Recent questions tagged algorithm-design-techniques

2 2 votes
2 2 answers
9.5k
9.5k views
NIELIT 2016 DEC Scientist B (CS) - Section B: 7
The Knapsack problem belongs to which domain of problems?OptimizationNP completeLinear SolutionSorting
User Avatar
1 1 vote
1 1 answer
3.4k
3.4k views
UGC NET CSE | December 2006 | Part 2 | Question: 22
Binary search tree is an example of :Divide and conquer techniqueGreedy algorithmBack trackingDynamic Programming
User Avatar
0 0 votes
0 0 answers
407
407 views
Cormen Edition 3 Exercise 2.4 Question 4 (Page No. 42)
Give an algorithm that determines the number of inversions in any permutation on $n$ elements in $\Theta (n\ lg\ n)$ worst-case time. (Hint: Modify merge sort.)
User Avatar
0 0 votes
1 1 answer
598
598 views
Cormen Edition 3 Exercise 2.3 Question 7 (Page No. 39)
Describe a $\Theta(n\ lg\ n)$ time algorithm that, given a set $S$ of $n$ integers and another integer $x$, determines whether or not there exist two elements in $S$ whos...
User Avatar
0 0 votes
2 2 answers
1.8k
1.8k views
NIELIT 2018-74
Dijkstra’s algorithm is based onGreedy approachDynamic programmingBacktracking paradigmDivide and conquer paradigm
User Avatar
8 8 votes
1 answers 1 answer
6.6k
6.6k views
ISRO CSE 2018 | Question: 16
The following paradigm can be used to find the solution of the problem in minimum time:Given a set of non-negative integer and a value $K$, determine if there is a subset...
User Avatar
1 1 vote
0 0 answers
810
810 views
branch and bound
What is branch and bound and how is it using queue datastructure
User Avatar
1 1 vote
1 answers 1 answer
1.4k
1.4k views
Daa........
What is the ans and give reason8) Selection sort algorithm design technique is an example ofA Greedy methodB Divide-and-conquerC Dynamic ProgrammingD BacktrackingE Linkin...
User Avatar
1 1 vote
2 2 answers
2.1k
2.1k views
Hamiltonian circuit
Hamiltonian circuit can be most perfectly related with:A. Greedy approachB. Dynamic programmingC. BacktrackingD. Branch and bound
User Avatar
36 36 votes
7 answers 7 answers
11.6k
11.6k views
GATE CSE 2017 | Set 1 | Question: 05
Consider the following table:$$\begin{array}{|ll|ll|}\hline & \textbf{Algorithms} & & \textbf{Design Paradigms} \\\hline \text{(P)} & \text{Kruskal} & \text{(i)}& \text...
User Avatar
0 0 votes
1 1 answer
3.3k
3.3k views
geeks for geeks
In a village, people build houses in the same side of the road. A thief plans to loot the village. He wants maximum amount of money without having any risk of getting cau...
User Avatar
20 20 votes
3 3 answers
6.2k
6.2k views
GATE CSE 1990 | Question: 12b
Consider the following problem. Given $n$ positive integers $a_{1}, a_{2}\dots a_n,$ it is required to partition them in to two parts $A$ and $B$ such that, $\displaystyl...
User Avatar
20 20 votes
1 answers 1 answer
9.5k
9.5k views
GATE CSE 1990 | Question: 2-vii
Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a) & \text{Strassen's matrix multiplication algorithm} & (p) & \text{Greedy method} \\\hline (...
User Avatar
5 5 votes
1 answers 1 answer
1.1k
1.1k views
Optimal Substructure
6. Which one of the following is an optimal substructure property?If $S$ is an optimal solution, then the components of $S$ are not necessarily optimalIf $S$ is an optima...
User Avatar
7 7 votes
2 answers 2 answers
9.0k
9.0k views
ISRO CSE 2011 | Question: 66
Which of the following algorithm design technique is used in merge sort?Greedy methodBacktrackingDynamic programmingDivide and Conquer
User Avatar
8 8 votes
3 3 answers
11.1k
11.1k views
ISRO CSE 2007 | Question: 55
Selection sort algorithm design technique is an example ofGreedy methodDivide-and-conquerDynamic ProgrammingBacktracking
User Avatar
34 34 votes
3 answers 3 answers
12.9k
12.9k views
GATE CSE 2015 | Set 2 | Question: 36
Given below are some algorithms, and some algorithm design paradigms. $$\begin{array}{|ll|ll|}\hline \text{1.} & \text{Dijkstra's Shortest Path} & \text{i.} & \text{Divid...
User Avatar
35 35 votes
4 answers 4 answers
9.7k
9.7k views
GATE CSE 2015 | Set 1 | Question: 6
Match the following:$$\begin{array}{|ll|ll|}\hline \text{P.} & \text{Prim's algorithm for minimum spanning tree} & \text{i.} & \text{Backtracking} \\\hline \text{Q.}...
User Avatar
29 29 votes
2 answers 2 answers
7.5k
7.5k views
GATE CSE 1995 | Question: 1.5
Merge sort uses:Divide and conquer strategyBacktracking approachHeuristic searchGreedy approach
User Avatar
28 28 votes
7 answers 7 answers
23.0k
23.0k views
GATE CSE 1994 | Question: 1.19, ISRO2016-31
Algorithm design technique used in quicksort algorithm is?Dynamic programmingBacktrackingDivide and conquerGreedy method
User Avatar
28 28 votes
3 answers 3 answers
8.8k
8.8k views
GATE CSE 1997 | Question: 1.5
The correct matching for the following pairs is $$\begin{array}{|ll|ll|}\hline \text{A.} & \text{All pairs shortest path} & \text{1.} & \text{Greedy} \\\hline \text{B.} ...
User Avatar
31 31 votes
2 answers 2 answers
13.6k
13.6k views
GATE CSE 1998 | Question: 1.21, ISRO2008-16
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?Dynamic programmingBacktrackingGreedyDivide and Conqu...
User Avatar
To see more, click for the full list of questions or popular tags.