Ask
Login
TAGGED IN

Analysis Of Algorithms

Follow this tag to get notifications whenever a new post is added

ALL TAGS
0
votes
1
answer
2.1k
views
1
answer
To generate the Huffman code for given set of frequencies.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
2
votes
1
answer
10k
views
1
answer
Explain different string matching algorithms.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
2
votes
1
answer
4.8k
views
1
answer
To implement the knuth Morris Pratt, string matching algorithm.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
3
votes
1
answer
15k
views
1
answer
Explain the longest common subsequence with example.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
2
votes
1
answer
8.2k
views
1
answer
Branch and bound strategy.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
0
votes
1
answer
3.3k
views
1
answer
Find the path of travelling sales person problem of given graph.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
3
votes
1
answer
29k
views
1
answer
Write a short note on Multistage graphs
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
2
votes
1
answer
7.8k
views
1
answer
What is backtracking method? How it is used in graph coloring problem
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
1
vote
1
answer
4.7k
views
1
answer
Solve sum of subsets problem for following N=6 W={3,5,7,8,9,15} & M=20 Also write the Algorithm for it.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
10
votes
1
answer
62k
views
1
answer
Write an algorithm for sum of subsets. Solve the following problem. M=30 W={5, 10, 12, 13, 15, 18}
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
0
votes
1
answer
7.3k
views
1
answer
Explain sum of subset problem
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
1
vote
1
answer
19k
views
1
answer
Explain 8 Queen Problems.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
4
votes
1
answer
26k
views
1
answer
Write short notes on N-Queen Problem.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
6
votes
1
answer
54k
views
1
answer
Write an algorithm of sum of subsets.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
0
votes
1
answer
4.0k
views
1
answer
Find a minimum cost path from 3 to 2 in the given graph using dynamic programming.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
5
votes
1
answer
15k
views
1
answer
Compare Prims and Kruskals method for finding Minimum spanning Tree find MST for following using prims method.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
2
votes
1
answer
39k
views
1
answer
Compare Greedy and dynamic programming approach for algorithm design. Example how both can be used to solve Knapsack problem
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
2
votes
1
answer
54k
views
1
answer
Solve the following Job sequencing with deadlines problem n=7, Profits(p1, p2, p7)={3, 5, 20, 18, 1, 6, 30}Deadlines(d1, d2, d7)={1, 3, 4, 3, 2, 1, 2}
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
0
votes
1
answer
9.8k
views
1
answer
Find feasible solutions, using job sequencing with deadlines.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
0
votes
1
answer
19k
views
1
answer
Explain optimal storage on tapes and find the optimal order for given instance.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
1
vote
1
answer
5.2k
views
1
answer
Explain 0/1 knapsack problem using dynamic programming.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
5
votes
1
answer
37k
views
1
answer
Explain Job sequencing with deadliner for the given instance. n=5, {P1, P2, P3, P4, P 5} = {20, 15, 10, 5, 3} & {d1, d2, d3, d4, d5} = {2, 2, 1, 3, 3}
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
0
votes
1
answer
7.0k
views
1
answer
Write abstract algorithm for greedy design method.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
11
votes
1
answer
130k
views
1
answer
Find an optimal solution to the knapsack instances
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
0
votes
1
answer
4.8k
views
1
answer
To find MST of following graph using prims Algorithm.
analysis of algorithms updated 4.6 years ago by teamques10 ★ 68k
<prev • 153 results • page 3 of 7 • next >