Dark Mode

Recent questions tagged algorithm-design-technique

2 votes

2 answers

1

NIELIT 2016 DEC Scientist B (CS) - Section B: 7
The Knapsack problem belongs to which domain of problems? Optimization NP complete Linear Solution Sorting

admin asked in Algorithms Mar 31, 2020

by admin

8.5k views

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

go_editor asked in Algorithms Mar 27, 2020

2.3k views

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.)

akash.dinkar12 asked in Algorithms Jun 26, 2019

by akash.dinkar12

212 views

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$.

akash.dinkar12 asked in Algorithms Jun 26, 2019

by akash.dinkar12

366 views

0 votes

2 answers

5

NIELIT 2018-74
Dijkstra’s algorithm is based on Greedy approach Dynamic programming Backtracking paradigm Divide and conquer paradigm

Arjun asked in Algorithms Dec 7, 2018

by Arjun

1.1k views

3 votes

1 answer

6

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$, determine if there is a subset of the given set with sum equal to $K$: Divide and Conquer Dynamic Programming Greedy Algorithm Branch and Bound

Arjun asked in Algorithms Apr 22, 2018

by Arjun

5.0k views

1 vote

0 answers

7

branch and bound
What is branch and bound and how is it using queue datastructure

A_i_$_h asked in Algorithms Oct 9, 2017

582 views

1 vote

1 answer

8

Daa........
What is the ans and give reason

Dharam raj asked in Algorithms Jul 12, 2017

708 views

1 vote

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

sh!va asked in Algorithms Apr 30, 2017

by sh!va

1.3k views

25 votes

7 answers

10

GATE CSE 2017 Set 1 | Question: 05
Consider the following table: ... $(P) \leftrightarrow (i), (Q) \leftrightarrow (ii), (R) \leftrightarrow (iii)$

khushtak asked in Algorithms Feb 14, 2017

7.0k views

0 votes

1 answer

11

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 caught. By some means, the villagers know that their adjacent house is being looted ... ? (a) Brute force (b) Dynamic programming (c) Backtracking (d) Divide and conquer Please provide explanation to your solution :)

Anand Vijayan asked in Algorithms Jan 4, 2017

by Anand Vijayan

2.4k views

13 votes

2 answers

12

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$ ... that part whose sum in smaller at that step. Give an example with $n=5$ for which the solution produced by the greedy algorithm is not optimal.

makhdoom ghaya asked in Algorithms Nov 25, 2016

by makhdoom ghaya

2.6k views

11 votes

1 answer

13

GATE CSE 1990 | Question: 2-vii
Match the pairs in the following questions: ...

makhdoom ghaya asked in Algorithms Nov 19, 2016

by makhdoom ghaya

5.8k views

5 votes

1 answer

14

Optimal Substructure

geet.m asked in Algorithms Jun 29, 2016

by geet.m

666 views

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

go_editor asked in Algorithms Jun 23, 2016

7.8k views

6 votes

3 answers

16

ISRO2007-55
Selection sort algorithm design technique is an example of Greedy method Divide-and-conquer Dynamic Programming Backtracking

go_editor asked in Algorithms Jun 10, 2016

6.5k views

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}$

go_editor asked in Algorithms Feb 12, 2015

6.9k views

26 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}$

makhdoom ghaya asked in Algorithms Feb 12, 2015

by makhdoom ghaya

5.5k views

21 votes

2 answers

19

GATE CSE 1995 | Question: 1.5
Merge sort uses: Divide and conquer strategy Backtracking approach Heuristic search Greedy approach

Kathleen asked in Algorithms Oct 8, 2014

5.0k views

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

Kathleen asked in Algorithms Oct 4, 2014

18.3k views

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}$

Kathleen asked in Algorithms Sep 29, 2014

5.0k views

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

Kathleen asked in Algorithms Sep 25, 2014

9.1k views

To see more, click for the full list of questions or popular tags.

Recent questions tagged algorithm-design-technique