User: yashshirsath2127

yashshirsath2127

yashshirsath2127 • 20

Reputation:: Level 1
Status:: Active
Last seen:: 2 years, 3 months ago
Joined:: 3 years ago
Profile Strength:: 20%

5
Questions
0
Answers
2
Awards

Computer Science And Engineering

Univeristy Of Michigan

Top contributions by yashshirsath2127

2

votes

1

answer

20k

views

1

answer

Define Knapsack problem. Solve the following 0/1 Knapsack problem using dynamic programming Let n=3 , p={1,2,5), w=(2,3,4) and m=6

analysis of algorithms updated 2.7 years ago by binitamayekar ★ 6.6k

3

votes

1

answer

10.0k

views

1

answer

Let n=4 Profit={1, 2, 5, 6} Weight= {2, 3, 4, 5} M=8 Find solution to 0/1 Knapsack Problem using Dynamic Programming.

analysis of algorithms updated 11 months ago by binitamayekar ★ 6.6k

0

votes

0

answers

851

views

0

answers

(Duplicate) Find Longest Common Subsequence(LCS) for given strings X= ABACABB Y=BABCAB

analysis of algorithms updated 2.7 years ago by yashshirsath2127 • 20

1

vote

0

answers

710

views

0

answers

(Duplicate) Find maximum profit using Fractional Knapsack approach(Greedy Method) n=6, m=13, P={18, 5, 9, 10, 12, 7}, W={7, 2, 3, 5, 3, 2}

analysis of algorithms updated 2.7 years ago by yashshirsath2127 • 20

0

votes

0

answers

564

views

0

answers

(Duplicate) What is Longest Common Subsequence Problem? Find out the longest Common subsequence for the given data String-1:- TATA String-2:- BATA

analysis of algorithms updated 2.7 years ago by yashshirsath2127 • 20

There are no results for this page.

analysis of algorithms × 5

Latest awards to yashshirsath2127

Popular Question × 1

created a question with more than 1,000 views

Trusted × 1

has been around for a while