Register

Recent questions tagged algorithm-design-technique

8.8k
views
2 answers
2 votes
NIELIT 2016 DEC Scientist B (CS) - Section B: 7
The Knapsack problem belongs to which domain of problems?OptimizationNP completeLinear SolutionSorting
User Avatar
2.5k
views
1 answers
0 votes
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
232
views
0 answers
0 votes
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
384
views
1 answers
0 votes
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$ whose sum is exactly $x$.
User Avatar
1.2k
views
2 answers
0 votes
NIELIT 2018-74
Dijkstra’s algorithm is based onGreedy approachDynamic programmingBacktracking paradigmDivide and conquer paradigm
User Avatar
5.2k
views
1 answers
3 votes
ISRO2018-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$, ... set with sum equal to $K$:Divide and ConquerDynamic ProgrammingGreedy AlgorithmBranch and Bound
User Avatar
614
views
0 answers
1 votes
branch and bound
What is branch and bound and how is it using queue datastructure
User Avatar
755
views
1 answers
1 votes
Daa........
What is the ans and give reason
User Avatar
1.3k
views
2 answers
1 votes
Hamiltonian circuit
Hamiltonian circuit can be most perfectly related with:A. Greedy approachB. Dynamic programmingC. BacktrackingD. Branch and bound
User Avatar
7.3k
views
7 answers
27 votes
GATE CSE 2017 Set 1 | Question: 05
Consider the following table: ...
User Avatar
2.5k
views
1 answers
0 votes
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 ... (c) Backtracking(d) Divide and conquer Please provide explanation to your solution :)
User Avatar
2.8k
views
2 answers
13 votes
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$ ... with $n=5$ for which the solution produced by the greedy algorithm is not optimal.
User Avatar
6.0k
views
1 answers
12 votes
GATE CSE 1990 | Question: 2-vii
Match the pairs in the following questions: ...
User Avatar
712
views
1 answers
5 votes
Optimal Substructure
User Avatar
8.0k
views
2 answers
7 votes
ISRO2011-66
Which of the following algorithm design technique is used in merge sort?Greedy methodBacktrackingDynamic programmingDivide and Conquer
User Avatar
6.8k
views
3 answers
6 votes
ISRO2007-55
Selection sort algorithm design technique is an example ofGreedy methodDivide-and-conquerDynamic ProgrammingBacktracking
User Avatar
7.3k
views
3 answers
26 votes
GATE CSE 2015 Set 2 | Question: 36
Given below are some algorithms, and some algorithm design paradigms. ... , 2-ii, 3-i, 4-iv}$\text{1-iii, 2-ii, 3-i, 4-v}$
User Avatar
5.8k
views
4 answers
28 votes
GATE CSE 2015 Set 1 | Question: 6
Match the following: ... {P-ii, Q-iii, R-iv, S-i}$\text{P-ii, Q-i, R-iii, S-iv}$
User Avatar
5.1k
views
2 answers
22 votes
GATE CSE 1995 | Question: 1.5
Merge sort uses:Divide and conquer strategyBacktracking approachHeuristic searchGreedy approach
User Avatar
18.7k
views
7 answers
22 votes
GATE CSE 1994 | Question: 1.19, ISRO2016-31
Algorithm design technique used in quicksort algorithm is?Dynamic programmingBacktrackingDivide and conquerGreedy method
User Avatar
5.3k
views
3 answers
22 votes
GATE CSE 1997 | Question: 1.5
The correct matching for the following pairs is ... $\text{A-4 B-1 C-2 D-3}$
User Avatar
9.3k
views
2 answers
25 votes
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 Conquer
User Avatar
To see more, click for the full list of questions or popular tags.