L-4.6: Optimal Merge Pattern using Greedy Method in Hindi | Algorithm

Поделиться
HTML-код
  • Опубликовано: 8 сен 2024
  • #optimalMergePattern#GreedyTechniques#algorithm
    👉Subscribe to our new channel: / @varunainashots
    👉Links for DAA Notes:
    🔗File-1: rb.gy/2byrg
    🧑‍🎓Contributed by: Junaid Gazi
    🔗File-2:
    🧑‍🎓Contributed by: Mannu Garg
    When two or more sorted files are to be merged altogether to form a single file, the minimum computations are done to reach this file are known as Optimal Merge Pattern.
    If more than 2 files need to be merged then it can be done in pairs. For example, if need to merge 4 files A, B, C, D. First Merge A with B to get X1, merge X1 with C to get X2, merge X2 with D to get X3 as the output file.
    ► Design and Analysis of algorithms (DAA) (Complete Playlist):
    • Design and Analysis of...
    Other subject-wise playlist Links:
    --------------------------------------------------------------------------------------------------------------------------------------
    ► Operating System :
    • Operating System (Comp...
    ►Database Management System:
    • DBMS (Database Managem...
    ► Theory of Computation
    • TOC(Theory of Computat...
    ►Artificial Intelligence:
    • Artificial Intelligenc...
    ►Computer Networks (Complete Playlist):
    • Computer Networks (Com...
    ►Computer Architecture (Complete Playlist):
    • Computer Organization ...
    ►Structured Query Language (SQL):
    • Structured Query Langu...
    ►Discrete Mathematics:
    • Discrete Mathematics
    ►Compiler Design:
    • Compiler Design (Compl...
    ►Number System:
    • Number system
    ►Cloud Computing & BIG Data:
    • Cloud Computing & BIG ...
    ►Software Engineering:
    • Software Engineering
    ►Data Structure:
    • Data Structure
    ►Graph Theory:
    • Graph Theory
    ►Programming in C:
    • C Programming
    ►Digital Logic:
    • Digital Logic (Complet...
    ---------------------------------------------------------------------------------------------------------------------------------------
    Our social media Links:
    ► Subscribe to us on RUclips: / gatesmashers
    ►Subscribe to our new channel: / @varunainashots
    ► Like our page on Facebook: / gatesmashers
    ► Follow us on Instagram: / gate.smashers
    ► Follow us on Instagram: / varunainashots
    ► Follow us on Telegram: t.me/gatesmash...
    ► Follow us on Threads: www.threads.ne...
    --------------------------------------------------------------------------------------------------------------------------------------
    ►For Any Query, Suggestion or notes contribution:
    Email us at: gatesmashers2018@gmail.com

Комментарии • 89

  • @shivamjain9036
    @shivamjain9036 2 года назад +6

    Thnq thnq so much bhiya🤍🤍... aapki video dekh lo koi bhi subject ki to exam me extra copy lekr likhna padhta 😅👍. Saare topics easily smjh Aaa jaate .
    .
    .
    .
    .
    .
    Kabhi kabhi to lagta h ki clg ki fees bhi yahin de du😂
    .
    .
    Keep glowing bhiya💫
    Love from jabalpur 🤎

  • @unknownboy7131
    @unknownboy7131 2 года назад +10

    Thank you --- Mmec mullana college 2nd year section c students ❤️❤️❤️❤️❤️❤️ special thanks from Hansraj,B2 ,Racks & Shahri poplu Dickpak

    • @GateSmashers
      @GateSmashers  2 года назад +4

      Lots of blessings dosto..Hb2 r s p d

  • @user-pr5oj7vz8y
    @user-pr5oj7vz8y 10 месяцев назад +8

    🎯 Key Takeaways for quick navigation:
    00:00 📋 Introduction to Optimal Merge Pattern
    - Introduction to the concept of Optimal Merge Pattern and its significance.
    00:28 🤔 Understanding the Problem Statement
    - Explanation of the problem statement in Optimal Merge Pattern.
    - Example with 3 files (F1, F2, F3) and their records.
    01:54 📦 Record Movements and Feasible Solution
    - Discussing how to calculate record movements.
    - Explaining what constitutes a feasible solution in the context of optimal merge.
    03:23 🧩 Finding the Optimal Solution
    - Introduction to the concept of finding the optimal solution in Optimal Merge Pattern.
    - Explanation of how to choose the minimum files for merging.
    05:18 ⏱ Reducing Record Movement Time
    - Strategies for reducing the time spent on record movements.
    - The importance of file arrangement in minimizing movement.
    06:46 📉 Time Complexity of Optimal Merge Pattern
    - Explanation of the time complexity for the Optimal Merge Pattern algorithm.
    - Use of the min heap concept in the algorithm.
    08:41 🔢 Details of the Merge Process
    - Step-by-step explanation of the merging and heapifying process in the algorithm.
    - Importance of rearranging elements for maintaining the min heap property.
    09:38 📊 Time Complexity Analysis
    - Analyzing the time complexity of the Optimal Merge Pattern algorithm.
    - Time required for different steps and overall time complexity.
    Made with HARPA AI

  • @AvinashKumar-pb2op
    @AvinashKumar-pb2op 2 года назад +6

    Awesome teaching skill.
    following your playlist from the beginning.
    Thank you sir.

  • @Shivam_Bidha
    @Shivam_Bidha Год назад +2

    mai toh bas yahi soch raha sir aap nhi hote toh mera kya hota
    thank you so much sir 😃😃😃😃😃😃😃

  • @ajaygupta-pu6rx
    @ajaygupta-pu6rx 4 года назад +1

    Thanks to you sir your lucture very nice those lucture will cover big topic in a very short of time and also cover all the point of 4th hat topic so i have eaisly to understand the concept in very less in time your lucture very helpful to me during gate prepation thanks

  • @zenith355
    @zenith355 4 года назад +2

    Very specific & very good.

  • @user-ew5qb2xc7h
    @user-ew5qb2xc7h 9 месяцев назад

    You are the one who upgraded my semister results..keep rocking 💥🛐

  • @arsalanparvaiz4840
    @arsalanparvaiz4840 4 года назад +16

    play list is not sequentially ordered ....... rest is awesome

    • @RahulS-cu1ko
      @RahulS-cu1ko 7 месяцев назад +5

      Thodi mehnat khud bhi kar le

  • @kanaksharma5979
    @kanaksharma5979 3 года назад +1

    Really nice sir 👌👌👌👌👍👍👍👍👍

  • @shubhangineegupta5626
    @shubhangineegupta5626 Год назад

    Awesome teaching skill Sir.. Aapke videos sch m bahot helpful hote h

  • @aineramzan2118
    @aineramzan2118 2 года назад +1

    Easy method thnku sir

  • @nidhiparashar8691
    @nidhiparashar8691 4 года назад +1

    Superb explanation 👌

  • @RajKumar-sq2cj
    @RajKumar-sq2cj 3 года назад +1

    Let's say mere pas teen file c
    Hinglabi language 😂 jokes apart
    Sir aap topic bhot ache se explain krte h ☺

  • @maabakhtar4040
    @maabakhtar4040 6 месяцев назад

    Best teacher forever

  • @manadipaganguly3560
    @manadipaganguly3560 4 года назад +6

    Your teaching skills really good . And I have cleared my conception more for you . Sir kindly give an information. Which book is good for computer algorithm?

  • @yamisharma7226
    @yamisharma7226 4 года назад +1

    Always osm sir. Thnq so much

  • @creationlover2
    @creationlover2 2 года назад

    Best teacher

  • @sandipsarkar1516
    @sandipsarkar1516 4 года назад +1

    💯 % clear sir.

  • @misstopper1
    @misstopper1 5 месяцев назад

    Thank you sir

  • @tusarmondal7068
    @tusarmondal7068 8 месяцев назад

    nice explaination

  • @mridulkhandelwal2265
    @mridulkhandelwal2265 3 года назад

    You explains the topic very nice and understandable to us

  • @ankitakumari2393
    @ankitakumari2393 2 года назад

    Thank you sir 😊

  • @BabliShil
    @BabliShil Год назад

    thank you so much

  • @harshitatiwari4531
    @harshitatiwari4531 3 года назад

    Good explanation

  • @GAU-C--RATNAKANTAHANSE
    @GAU-C--RATNAKANTAHANSE 3 года назад

    Thank you sir..

  • @bharadwajkamepalli3903
    @bharadwajkamepalli3903 3 года назад +10

    sir what is difference between huffman tree and optimal merge pattern

    • @anikettote2001
      @anikettote2001 3 года назад +3

      No difference. Both have same algorithms.

    • @bulliraju5439
      @bulliraju5439 2 года назад +3

      No difference bro same
      But algorithm representation changes

  • @dhruvilsolanki9887
    @dhruvilsolanki9887 Год назад

    great explaination as always

  • @sratnamanjari244
    @sratnamanjari244 4 года назад

    Thank You Sir 🙂

  • @continnum_radhe-radhe
    @continnum_radhe-radhe 2 месяца назад +1

    ❤❤❤

  • @aiza.aziz.03
    @aiza.aziz.03 11 месяцев назад

    Really thanks sir! Sir Meri aik confusion Hai K jb ap Ny min heap wala concept btaya tb ap Ny Kaha pehly wali diagram ko follow Ni krna Hai to phr in Dono ka Kya link Hai?

  • @Himanshu-yb9kz
    @Himanshu-yb9kz Год назад +2

    Optimal Merge Patter is same as Huffman Coding.

  • @sksahinparvej5500
    @sksahinparvej5500 Год назад +1

    What is the difference between Hoffman and this method then?

  • @dkbagdi
    @dkbagdi 2 года назад +4

    is it a min heap or max heap?

  • @motivetion440
    @motivetion440 Год назад

  • @aqsapervaiz9790
    @aqsapervaiz9790 5 месяцев назад

    👍👍👍👍👍

  • @ericMotivation
    @ericMotivation 4 года назад

    Sir will u plz solve water connection problems based on greedy algorithm

  • @duanoor1204
    @duanoor1204 Месяц назад

    Question should be add for more convenience!!

  • @YasirNiazKhan
    @YasirNiazKhan 2 года назад +1

    Making a min-heap of n elements should cost nlgn time, even with heapify function?

  • @Aklodhi749
    @Aklodhi749 4 месяца назад +1

    sir why are you not ad a question about this topic

  • @nidhiparashar8691
    @nidhiparashar8691 4 года назад +1

    Please provide videos on compiler design

  • @anamikashukla4872
    @anamikashukla4872 4 года назад +1

    could you pls help me to understand IDP in computer network?

  • @praveen_kr
    @praveen_kr 3 года назад

    Sir plz explain with min heap in deep 🙏

  • @kad6912
    @kad6912 4 года назад

    Sir please daa ki syllabus puri upload kijiye i am waiting for more daa's videos.

  • @sakshamgupta1812
    @sakshamgupta1812 7 месяцев назад

    I think it's a max heap not a min heap
    But very usefull video❤

  • @shubhankaruttam8975
    @shubhankaruttam8975 4 года назад

    dear sir, Prisms Algorithms using Greedy approach ???

  • @harshvardhan3396
    @harshvardhan3396 2 года назад

    👍👌👌

  • @rowdyyashgupta9785
    @rowdyyashgupta9785 Год назад

    sir third one is not a heap beacuse for min or max heap we have to take it ACBT that is not in your sol

  • @akashbansal5501
    @akashbansal5501 3 года назад

    ❤️❤️

  • @aiza.aziz.03
    @aiza.aziz.03 11 месяцев назад

    And sir agr hm min heap property ko follow krty Hain to hmara is application ka conclusion Kya Hai? O(n log n) yhi hmara end result hoga?

  • @jindal_academy
    @jindal_academy 2 года назад

    What is Optimal Reliability Allocation Problem ?

  • @chiragagrawal7104
    @chiragagrawal7104 3 года назад +2

    lekin ye max heap hua na? kyuki root mei maximum element hai and sab child ke parent child se bade hai?

  • @iCyrus
    @iCyrus 3 года назад +1

    Sir ye toh max heap hua n??

  • @mamoonakausar913
    @mamoonakausar913 Год назад +1

    Sir how to write algorithms?

  • @lord_yzal
    @lord_yzal 2 года назад

  • @bollyjolly483
    @bollyjolly483 3 года назад

    why we haven't took the complexity to merge the lists.?

  • @JyotiKumari-ym5mq
    @JyotiKumari-ym5mq Год назад

    Similar to Huffman encoding

  • @ashishjeena8021
    @ashishjeena8021 3 года назад +1

    sir total record movements = 66 honge kya -> 2,4,6,8,10 vale question me
    PLEASE REPLY

  • @journeyfrom7161
    @journeyfrom7161 Год назад

    answer of that last question in this video is 66 units

  • @romabentadvi3904
    @romabentadvi3904 4 месяца назад +2

    30 minutes ke baad exam hai 😄

  • @rachelmascarenhas9834
    @rachelmascarenhas9834 4 года назад

    What is algorithm for two way merge pattern

  • @reenagoswami
    @reenagoswami 3 года назад +2

    min heap me root node is less than or equal to either of its child node.. bt yaha apne alag btaya.. thoda confusing hai ye . plz clear it 🙏 isse pehle video me max heap btaya ta apne usne apne b kaha ki min heap me root node chhota hota hai child node se..

    • @KumarGolu2001
      @KumarGolu2001 3 года назад

      Ha ye sir ne galati kar di. There should be a max heap.

    • @adhargupta3441
      @adhargupta3441 3 года назад

      @@KumarGolu2001 no he's right but he has not drawn min heap there that's why you're confused😁

  • @fatimaislamicvoice1163
    @fatimaislamicvoice1163 4 года назад

    Dear sir, Kindly tell me what is the difference between the operation and function of the operating system

  • @shubhangihatkar1347
    @shubhangihatkar1347 3 года назад

    ⭐⭐⭐⭐⭐

  • @aiza.aziz.03
    @aiza.aziz.03 11 месяцев назад

    Really sorry sir! But kl Meri presentation Hai aur mny ye topic present krna Hai kindly guide me

  • @vishwanathhosmane3834
    @vishwanathhosmane3834 3 года назад

    Sir ek accha sa example lekar samzate.

  • @BestiebwstKellyClarkson
    @BestiebwstKellyClarkson Месяц назад

    99

  • @ridwanh5133
    @ridwanh5133 Месяц назад +1

    Back wale kon kon hai 😅

  • @bluntfitter
    @bluntfitter 4 года назад

    Sir, what was your GATE rank?

  • @chocolyte1950
    @chocolyte1950 Год назад

    Sir aap ne bola University exam me faida hone bala hai, Lekin kya ghanta faida hoga aap note thodi de rahe hain only concept pe dhyan de rahe hai. Ye concept thodi jyada din yaad rahega, i think aap ko notes pe jara focus karna chahiye😢

  • @Vamsi1810
    @Vamsi1810 3 года назад

    1099 like

  • @I_Luv_Alwar
    @I_Luv_Alwar 3 года назад

    bhai concept to btaya kar sseedha udaa raha h

  • @piyushtripathi5566
    @piyushtripathi5566 2 года назад

    Thank you sir ❣️

  • @rajbannasa7662
    @rajbannasa7662 3 года назад

    Thanks so sir ❤️❤️