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
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 🤎
Thank you --- Mmec mullana college 2nd year section c students ❤️❤️❤️❤️❤️❤️ special thanks from Hansraj,B2 ,Racks & Shahri poplu Dickpak
Lots of blessings dosto..Hb2 r s p d
🎯 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
Awesome teaching skill.
following your playlist from the beginning.
Thank you sir.
mai toh bas yahi soch raha sir aap nhi hote toh mera kya hota
thank you so much sir 😃😃😃😃😃😃😃
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
Very specific & very good.
You are the one who upgraded my semister results..keep rocking 💥🛐
play list is not sequentially ordered ....... rest is awesome
Thodi mehnat khud bhi kar le
Really nice sir 👌👌👌👌👍👍👍👍👍
Awesome teaching skill Sir.. Aapke videos sch m bahot helpful hote h
Easy method thnku sir
Superb explanation 👌
Let's say mere pas teen file c
Hinglabi language 😂 jokes apart
Sir aap topic bhot ache se explain krte h ☺
Best teacher forever
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?
Always osm sir. Thnq so much
Best teacher
💯 % clear sir.
Thank you sir
nice explaination
You explains the topic very nice and understandable to us
Thank you sir 😊
thank you so much
Good explanation
Thank you sir..
sir what is difference between huffman tree and optimal merge pattern
No difference. Both have same algorithms.
No difference bro same
But algorithm representation changes
great explaination as always
Thank You Sir 🙂
❤❤❤
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?
Optimal Merge Patter is same as Huffman Coding.
What is the difference between Hoffman and this method then?
is it a min heap or max heap?
❤
👍👍👍👍👍
Sir will u plz solve water connection problems based on greedy algorithm
Question should be add for more convenience!!
Making a min-heap of n elements should cost nlgn time, even with heapify function?
no with heapify it takes O(n) complexity
sir why are you not ad a question about this topic
Please provide videos on compiler design
Yes sir
could you pls help me to understand IDP in computer network?
Sir plz explain with min heap in deep 🙏
Sir please daa ki syllabus puri upload kijiye i am waiting for more daa's videos.
I think it's a max heap not a min heap
But very usefull video❤
dear sir, Prisms Algorithms using Greedy approach ???
👍👌👌
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
❤️❤️
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?
What is Optimal Reliability Allocation Problem ?
lekin ye max heap hua na? kyuki root mei maximum element hai and sab child ke parent child se bade hai?
haan i thought the same
@@goldenshower8210me too! but what why its like this?
Sir ye toh max heap hua n??
Sir how to write algorithms?
why we haven't took the complexity to merge the lists.?
Similar to Huffman encoding
sir total record movements = 66 honge kya -> 2,4,6,8,10 vale question me
PLEASE REPLY
Yes bro it's 66
@@youtubecr3115 thnku
No it's 30
answer of that last question in this video is 66 units
30 minutes ke baad exam hai 😄
What is algorithm for two way merge pattern
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..
Ha ye sir ne galati kar di. There should be a max heap.
@@KumarGolu2001 no he's right but he has not drawn min heap there that's why you're confused😁
Dear sir, Kindly tell me what is the difference between the operation and function of the operating system
⭐⭐⭐⭐⭐
Really sorry sir! But kl Meri presentation Hai aur mny ye topic present krna Hai kindly guide me
Sir ek accha sa example lekar samzate.
99
Back wale kon kon hai 😅
Sir, what was your GATE rank?
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😢
1099 like
bhai concept to btaya kar sseedha udaa raha h
BINA CONCEPT NIKAL LEYGA KYA
Thank you sir ❣️
Thanks so sir ❤️❤️