State-Space Tree Knapsack Problem | Branch & Bound Technique | L103

State-Space Tree Knapsack Problem | Branch & Bound Technique | L103 | Design & Analysis of Algorithm

Рет қаралды 32,956

CSE Guru

Күн бұрын

Пікірлер

@psycogaming.1725 Ай бұрын

Tq so much madam ❤ got a clarity after a long search

@manum5032 4 ай бұрын

Really useful vedio mam

@irshad5961 5 ай бұрын

I'm grateful

@hrushikesh6040 5 ай бұрын

Tqsm mam I am very grateful

@VICKY_GUNDEBOINA-u1z 9 ай бұрын

Brilliant Medam

@MOHITKUMARRATHOD 3 ай бұрын

good explanation

@Lakshmi-il1vz 4 ай бұрын

Thankyou mam

@rcbchallengersfans1412 4 ай бұрын

Tq mam

@monyraesha1644 4 ай бұрын

the profit value should be 65 right? as we add the value of item 1 and 3. how is it 69

@damnn5492 4 ай бұрын

why do we add the item of 1 and 3?

@HellFir-q5x Ай бұрын

same doubt 🙄 In the end the ub is calculated without 4 right? That means ud = 65...😶

@basavadarshanbs9906 4 ай бұрын

Optimal solution 65 not 69

@teamrdx8091 4 ай бұрын

How bro 65?

@sukhi9065 4 ай бұрын

65+(1)(0) in last without 4th item step =65 @@teamrdx8091

@dheeraj9619 4 ай бұрын

Bro ub value is 69 , optimal solution that is most profit is 65 , mam didn't say clearly that's it , both u should mention

@AnuragSingh-xe1nm 4 ай бұрын

ubber bound is 65.

@teamrdx8091 4 ай бұрын

How it is 65

@littleboy007- 3 ай бұрын

@@teamrdx8091 😂

@shreyam2223 4 ай бұрын

Y can't we continue in without 1

@stalinseif6982 4 ай бұрын

You can

@BharathrajPraveenchandra 4 ай бұрын

Among with 1 and without 1,with 1 has the highest upper bound value so we should continue with 'with 1' and drop the without 1