Optimal Binary Search Tree Problem | OBST Problem | Dynamic Programming

This video is to solve the Optimal Binary Search Tree problem
For CSE/IT Students - Unit 1(Dynamic Programming and Greedy Technique)
#OBSTProblem #Designandanalysisofalgorithms

[@janakidevi6696]

Ungaloda channel ah thedi pudichu pakara ka semayana explanation

[@anusha6033]

even if i dont understand tamil, i understood ur explanation. u explain so well mam, thankyou

[@michaelpio8258]

Neenga clear ha explain panninga akka ,super and thanks

[@Fila_27]

Thank you so much for ur clear xplantion..👍

[@nikthasahin5705]

Thank u mam. Great explanation 💥

[@rockragulgaming1618]

Velangiduchiii mikka nanriiii❤❤

[@G.O.A.T._.]

Well explained! ❤

[@krishnaindia2004]

Optimal cost miss aaiduche

[@Peanutpaw181]

Explanation 🔥verii

[@saikishore1593]

Super ka good explanation

[@durai1033]

best explanation mam 👌👌👌👌

[@ventacode]

Thank you so much

[@sinekas790]

Thanking you mam vera level mam

[@thedivisionmusiconYT]

thank you maam

[@madhumitaramesh356]

Thank you so much sis🥹❤️helped alot!!

[@jaivikramas]

Super sister ❤

[@anupriyaragunathan6681]

Akka p value q value thaniya kudutha ena ka panrathu

[@Grace_0803]

Optimum cost enna mam

[@realcricket20lover92]

Mistake in finding c(2,3)

[@dhineshk8668]

Yes final ans is correct

[@raghulguru4049]

🔥

[@saraswathyv697]

❤️

[@abinayasrinivasan2064]

Mam what if both the k values are same...

[@4spray92]

K-1,k+1 how will it be same😅

[@kuttykutti4892]

What is optimium cost

[@abrar_abdulla]

Minimum cost

[@user-sl2fw5lk9b]

how to find optimal cost?

[@Butterfly-yg2vz]

Thats easy! You see the tree she drew at end? With C as root node and then B and D on the next level followed by A as the leaf node Now to find the optimal cost You will have to make 1 comparison to search for C, if you come down to B or D to search of B or D you will have to compare with C (1st comparision) then with B or D (2nd comparison) and as you go down the tree the number of comparison increases by 1. Now multiply the number of comparisons and the probability of each node, add them all, this give you the optimal cost In here No. Of comparison x probability C : 1 x 0.4 = 0.4 B : 2 x 0.2 = 0.4 D : 2 x 0.3 = 0.6 A : 3 x 0.1 = 0.3 0.4+0.4+0.6+0.3 = 1.7 (which is the same as the value in cost table in the top right corner)

[@janardhan6825]

Thanks ❤🎉​@@Butterfly-yg2vz

[@pubgsparkers]

Mam please make videos in English mam please your videos are good but wanted in English please

[@gokulakrishnan1870]

akka simplex method ku video poduga plz

[@educationsimplified6069]

Sure

[@gokulakrishnan1870]

@@educationsimplified6069 akka coming friday(1-7-22) xam ,so try soon ka🥺🥺

[@vasanthsmart318]

🤣

[@ck_gamers215]

2-1=1 ❌2-1=2 ✅ 15:03

[@02ajith27]

Optimum cost enna

[@rockragulgaming1618]

solla mudiyadhu poda anguttu

[@bhuvan658]

@@rockragulgaming1618 💀

[@deepakpandi2611]

In cost table the final top value(1, 4) is the optimum cost

[@deepakpandi2611]

@@adventurepanda8114 table oda top right side corner la ena value varutho athan optimum cost, crt ah nu therila thala en sir ipdi tha sonaru

[@adventurepanda8114]

@@deepakpandi2611 kk tq

[@AminKhojah]

Roses are red Violets are blue The title is in English So why aren't you?

[@mohamedthariq625]

Stop spamming this comment on her every video lil nigga

[@realcricket20lover92]

Please improve your handwriting

[@educationsimplified6069]

Sure, will improve!

[@dj_dark_cyber9289]

This handwriting is nice and understandable.

[@mohamedthariq625]

Stfu nigga the handwriting is good

[@user-cs9cb8em5w]

❤