Register

Recent questions tagged algorithm-design-technique

0 votes
1 answer
2
UGC NET CSE | December 2006 | Part 2 | Question: 22
Binary search tree is an example of : Divide and conquer technique Greedy algorithm Back tracking Dynamic Programming
Binary search tree is an example of :Divide and conquer techniqueGreedy algorithmBack trackingDynamic Programming
User Avatar
0 votes
0 answers
3
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.)
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 votes
1 answer
4
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$.
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 votes
2 answers
5
NIELIT 2018-74
Dijkstra’s algorithm is based on Greedy approach Dynamic programming Backtracking paradigm Divide and conquer paradigm
Dijkstra’s algorithm is based onGreedy approachDynamic programmingBacktracking paradigmDivide and conquer paradigm
User Avatar
1 votes
0 answers
7
branch and bound
What is branch and bound and how is it using queue datastructure
What is branch and bound and how is it using queue datastructure
User Avatar
1 votes
1 answer
8
Daa........
What is the ans and give reason
What is the ans and give reason
User Avatar
1 votes
2 answers
9
Hamiltonian circuit
Hamiltonian circuit can be most perfectly related with: A. Greedy approach B. Dynamic programming C. Backtracking D. Branch and bound
Hamiltonian circuit can be most perfectly related with:A. Greedy approachB. Dynamic programmingC. BacktrackingD. Branch and bound
User Avatar
26 votes
7 answers
10
GATE CSE 2017 Set 1 | Question: 05
Consider the following table: ... $(P) \leftrightarrow (i), (Q) \leftrightarrow (ii), (R) \leftrightarrow (iii)$
Consider the following table:$$\begin{array}{|l|}\hline \textbf {Algorithms} & \textbf{Design Paradigms } & \\\hline \text{P. Kruskal} & \text{i. Divide and Conquer} \...
User Avatar
11 votes
1 answer
13
GATE CSE 1990 | Question: 2-vii
Match the pairs in the following questions: ...
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
7 votes
2 answers
15
ISRO2011-66
Which of the following algorithm design technique is used in merge sort? Greedy method Backtracking Dynamic programming Divide and Conquer
Which of the following algorithm design technique is used in merge sort?Greedy methodBacktrackingDynamic programmingDivide and Conquer
User Avatar
6 votes
3 answers
16
ISRO2007-55
Selection sort algorithm design technique is an example of Greedy method Divide-and-conquer Dynamic Programming Backtracking
Selection sort algorithm design technique is an example ofGreedy methodDivide-and-conquerDynamic ProgrammingBacktracking
User Avatar
25 votes
3 answers
17
GATE CSE 2015 Set 2 | Question: 36
Given below are some algorithms, and some algorithm design paradigms. ... $\text{1-iii, 2-ii, 3-i, 4-iv}$ $\text{1-iii, 2-ii, 3-i, 4-v}$
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{Divide a...
User Avatar
27 votes
4 answers
18
GATE CSE 2015 Set 1 | Question: 6
Match the following: ... $\text{P-ii, Q-iii, R-iv, S-i}$ $\text{P-ii, Q-i, R-iii, S-iv}$
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
21 votes
2 answers
19
GATE CSE 1995 | Question: 1.5
Merge sort uses: Divide and conquer strategy Backtracking approach Heuristic search Greedy approach
Merge sort uses:Divide and conquer strategyBacktracking approachHeuristic searchGreedy approach
User Avatar
21 votes
7 answers
20
GATE CSE 1994 | Question: 1.19, ISRO2016-31
Algorithm design technique used in quicksort algorithm is? Dynamic programming Backtracking Divide and conquer Greedy method
Algorithm design technique used in quicksort algorithm is?Dynamic programmingBacktrackingDivide and conquerGreedy method
User Avatar
21 votes
3 answers
21
GATE CSE 1997 | Question: 1.5
The correct matching for the following pairs is ... $\text{A-3 B-4 C-1 D-2}$ $\text{A-3 B-4 C-2 D-1}$ $\text{A-4 B-1 C-2 D-3}$
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
25 votes
2 answers
22
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 programming Backtracking Greedy Divide and Conquer
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.