Ask
Login
TAGGED IN

Analysis Of Algorithms

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

ALL TAGS
6
votes
1
answer
122k
views
1
answer
Write an algorithm to find minimum and maximum value using divide and conquer and also drive its complexity.
analysis of algorithms updated 4.1 years ago by teamques10 ★ 64k
11
votes
1
answer
119k
views
1
answer
Find an optimal solution to the knapsack instances
analysis of algorithms updated 4.1 years ago by teamques10 ★ 64k
7
votes
1
answer
60k
views
1
answer
Explain Optimal storage on tape example.
analysis of algorithms updated 4.1 years ago by teamques10 ★ 64k
10
votes
1
answer
58k
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.1 years ago by teamques10 ★ 64k
5
votes
1
answer
54k
views
1
answer
Explain 0/1 Knapsack Problem with example.
analysis of algorithms updated 4.1 years ago by teamques10 ★ 64k
1
vote
1
answer
51k
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.1 years ago by teamques10 ★ 64k
6
votes
1
answer
50k
views
1
answer
Write an algorithm of sum of subsets.
analysis of algorithms updated 4.1 years ago by teamques10 ★ 64k
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.1 years ago by teamques10 ★ 64k
3
votes
1
answer
36k
views
1
answer
Explain flow shop scheduling with example.
analysis of algorithms updated 4.1 years ago by teamques10 ★ 64k
2
votes
1
answer
36k
views
1
answer
Apply Quick Sort Algorithm to sort the list E, X, A, M, P, L, E
analysis of algorithms updated 2.1 years ago by binitamayekar ★ 6.4k
1
vote
1
answer
35k
views
1
answer
Explain all pair shortest path algorithm with suitable example.
analysis of algorithms updated 4.1 years ago by teamques10 ★ 64k
5
votes
1
answer
33k
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.1 years ago by teamques10 ★ 64k
2
votes
1
answer
29k
views
1
answer
Write a short note on Multistage graphs
analysis of algorithms updated 4.1 years ago by teamques10 ★ 64k
5
votes
1
answer
29k
views
1
answer
Write a short note on 8-queen problem
analysis of algorithms updated 2.3 years ago by pedsangini276 • 4.7k
6
votes
1
answer
27k
views
1
answer
Which are the different methods of solving recurrences? Explain with example.
analysis of algorithms updated 4.1 years ago by teamques10 ★ 64k
4
votes
1
answer
25k
views
1
answer
Write short notes on N-Queen Problem.
analysis of algorithms updated 4.1 years ago by teamques10 ★ 64k
1
vote
1
answer
22k
views
1
answer
Write short notes on Job Sequencing with deadlines.
analysis of algorithms updated 4.1 years ago by teamques10 ★ 64k
1
vote
1
answer
20k
views
1
answer
Explain naive string matching algorithm with example.
analysis of algorithms updated 4.1 years ago by teamques10 ★ 64k
0
votes
1
answer
20k
views
1
answer
An algorithm takes 0.5 ms for input size 100. How long it will take for input size 500 if running time is i) Quadratic ii) NLog N
analysis of algorithms updated 2.3 years ago by pedsangini276 • 4.7k
6
votes
1
answer
20k
views
1
answer
Solve the following Job Sequencing with deadlines problem. N = 7 Profits (P1, P2, P3, P4, P5, P6, P7) = {3, 5, 20, 18, 1, 6, 30} Deadlines (D1, D2, D3, D4, D5, D6, D7) = {1, 3, 4, 3, 2, 1, 2}
analysis of algorithms updated 2.3 years ago by sagarkolekar ★ 11k
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.1 years ago by teamques10 ★ 64k
1
vote
1
answer
18k
views
1
answer
Explain 8 Queen Problems.
analysis of algorithms updated 4.1 years ago by teamques10 ★ 64k
8
votes
1
answer
18k
views
1
answer
Write an algorithm to solve the N-Queens problem. Show working for N=4.
analysis of algorithms updated 2.1 years ago by yashbeer ★ 11k
0
votes
1
answer
17k
views
1
answer
Explain the advantages of dynamic programming . How it differs from divide and conquer
analysis of algorithms updated 2.3 years ago by pedsangini276 • 4.7k
1
vote
1
answer
16k
views
1
answer
Write short notes on randomized Algorithm.
analysis of algorithms updated 4.1 years ago by teamques10 ★ 64k
<prev • 153 results • page 1 of 7 • next >