Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
9 views6 pages

DAA Problems

The document outlines various algorithms and problems related to data structures and algorithms, including sorting methods (bubble, selection, insertion, merge, quick), searching techniques (sequential, binary), and optimization problems (knapsack, traveling salesman). It also covers advanced topics such as dynamic programming, graph algorithms (Dijkstra's, Prim's, Kruskal's), and approximation algorithms. Additionally, it lists specific examples and parameters for each algorithm and problem.

Uploaded by

shashidharummaneni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
9 views6 pages

DAA Problems

The document outlines various algorithms and problems related to data structures and algorithms, including sorting methods (bubble, selection, insertion, merge, quick), searching techniques (sequential, binary), and optimization problems (knapsack, traveling salesman). It also covers advanced topics such as dynamic programming, graph algorithms (Dijkstra's, Prim's, Kruskal's), and approximation algorithms. Additionally, it lists specific examples and parameters for each algorithm and problem.

Uploaded by

shashidharummaneni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 6

DAA Activities

1.Bubble sort for these given numbers 89,45,68,90,29,34,17.

2.selection sort for these given numbers 89,45,68,90,29,34,17

3.Insertion sort for these given numbers 23,1,10,5,2

4.Sequential search for these given numbers 10,20,25,29,37,48,56

5.String matching for these example text=NOBODY NOTICED HIM,


pattern=NOT.

6.Travelling salesman problem

7.Knapsack problem

1.Assignment problem

2.Convex Hull problem

3.Closest pair problem

4.Merge sort for these given numbers 8,3,2,9,7,1,5,4.

5.Quick sort for these given numbers 5,3,1,9,8,2,4,7.

1.Binary search for these given numbers


3,4,27,31,39m42,55,70,74,81,85,93,98 . search element k=70.

2.Multiplication of large integers

3.Strassens matrix multiplication

4.Karatsuba algorithm for multiplication for 20 and 31.


1.Coin changing problem

2.Minimum spanning tree-Krushkal’s algorithm

a->b-3,a->f-5, a->e-6, b->a-3, b->c-1 , b->f-5, c->f-2, c->d-6, d->e-8, d->f-5,e-


>f-2.

1.Prim’s algorithm

a->b-3,a->f-5, a->e-6, b->a-3, b->c-1 , b->f-5, c->f-2, c->d-6, d->e-8, d->f-5,e-


>f-2.

2.Huffman Trees

character A B C D _

probability 0.35 0.1 0.2 0.2 0.15

3.Floyd Warshall - Dynamic programming

1.Dijkstra’s algorithm:
2.Knapsack problem: W=10

Item weight value


1 2 $12
2 1 $10
3 3 $20
4 2 $15

1.Back tracking

*8-queens problem

*Subset problem for given numbers s={3,5,6,7} ,d=15.

*Hamiltonian cycle

1.Optimal binomial coefficient problem

2.Optimal binomial search tree

3.Graph coloring
4.Branch and bound- assignment problem

Job1 Job2 Job3 Job4

Person a 9 2 7 8

Person b 6 4 3 7

Person c 5 8 1 8

Person d 7 6 9 4

5.Knapsack-branch and bound: W=50

item weight value Value\weight

1 4 40 10

2 7 42 6

3 5 25 5

4 3 12 4

1.Knapsack using branch and bound problem:

item weight value Value\weight

1 10 60 6

2 20 100 5

3 30 120 4

4 15 60 4
2.Assignment problem:

Job1 Job2 Job3 Job4

Person a 10 19 8 15

Person b 10 18 7 17

Person c 13 16 9 14

Person d 12 19 8 18

3.Boruvk’s algorithm -MST:

4.Approxiamate bin packing container loading problem:

*online algorithm

*offline algorithm

given sizes 0.2,0.5,0.4,0.7,0.1,0.3,0.5.

5.Knapsack using approximation scheme: W=10,K=2

item weight value Value\weight

1 4 40 10

2 7 42 6

3 5 25 5

4 1 4 4

6.Travelling salesman algorithm-approximation algorithm


1.Bellman ford for single source shortest path algorithm

You might also like