3.3 Optimal Merge Pattern using Greedy Method | Design and Analysis of Algorithms

➡ Do not miss our Bestseller Courses:

➡ Contact Us:
📞Call on: [phone]

➡ Our One Shot Semester Exam Videos: 👇

➡ Free Subject-Wise Complete PlayList: 👇
#knowledgegate #GATE #sanchitjain

*********************************************************

[arun]

A good teacher like you is like a candle – it consumes itself to light the way for others

[ayushiydvKG]

10:11 it's 247 as 12+15 resulting in 27 hence followed by the add operations ans comes out to be 247

[akash_assist]

No. of record movements: -
217 for files problem
and
215 for homework question

[mohitmaroliya]

Sir with due respect, at 9:21, 12+15=27 and not 17, hence ans at bottom will be 85 not 75 and total movement will be 247

[abidyousuf]

12+15=27 then two small elements are 19 and 18

[erjavaid]

Time complexity of optimal merge...and huffman

[Nitis_h]

and answer for question no for set 8 files F1 to F8 (i.e.) at time 10:09 will be 85 ANSWER

[Nitis_h]

HomeWork question answer is 215

sir, There was some calculations issues in this videos, if it is possible for you to correct then do make the changes.
thank you sir for your Phenomial tips and tricks for your all YouTube content, it shows how much hardwork you are doing for us.

Thank you so much sir
And at last Happy Diwali sir

[Rajendrajatav-reuf]

Home work problem answere 215

Files problem answere 217

[preetidagar]

Homework wale questions ka answer b. Ta dijiye jisse pta chle questions shi kia h ya galat