Optimal Binary Search Trees with Example in Hindi #1 | Dynamic Programming

#AOA #algorithm #computerscience #aoa #lastmomenttuitions #LMT
To get the study materials for final yeat(Notes, video lectures, previous years, semesters question papers)

Branches Available: Comps, IT, Mechanical, EXTC, Electrical, Civil, Production, Instrumentation

Other Second Year Engineering Courses :

Semester 03 -

Semester 04 -

First Year Engineering Courses :

Exclusive Courses :

Other Engineering Courses :

Technical & Placement Preparation :

[Morris]

General formula for calculating the minimum cost is:

C[i, j] = min{c[i, k-1] + c[k, j]} + w(i, j)

[mfaraday]

Thank you bhai
play in 3X speed same voice like(rohit - koi mil gaya)

[rahulpawar]

The most easy video on you tube for OBST. The formula is the most confusing part of OBST, whose usage n explaination is made most easy in this video.

[Rohan-uwjr]

Kal mera exam hai Aur Aj Raat ko mai ye vidoe Dekh rha hu Ty sir your vidoe made my day

[self_official]

From Your Language we understand that you are from Maharashtra 😂
Apneko😅

[amold-hs]

what is about the case if, main, of like conditions ?

[tv_duniya]

Bhai ya kangan utar liya karo jab aap padaya karo😂😂

[SonuYadav-ubzx]

Mistake in c (1, 4) calculate it again

[Chouhanz]

you sound like Hritik Roshan From Krishh movie

[boysrocky]

How to write key n Frequency in terms of P & Q??
Which is given in prblm

[miXxX]

Explain dynamic programming approach and apply it to construct optimal binary search tree using Huffman coding for weights given below
(2, 3, 5, 7, 9, 13)
Sir yeh kaise hoga plz btao

[RITHVIKKANTHA]

It's a binary search tree is not a binary tree!

[sreelekhajyothitatavarthy]

how to calculate the frequency of 5, 10, 15???

[sohanpatil]

Bhai kal exam a aur tu bol raha hai last min tution hai ye tere video last minute ke liye nahi bane hai😢📈🥲

[shaiksohail]

ur hand bracelet sound is very annoying

[AIREBELLIONMUSIC]

hello guys mera naam bhi rahul hai😂😂😂😂😂😂