Explanation
Mathematical Logic and Representation
Algorithms aur unke data structures ke relation ko hum is prakar darsha sakte hain:
1. Breadth-First Search (BFS):
Isme nodes ko visit karne ka order Queue ke through manage hota hai:
Order of Traversal∝Queue(FIFO)
2. Depth-First Search (DFS):
Isme nodes ko visit karne ke liye Stack (ya call stack) ka upyog hota hai:
Order of Traversal∝Stack(LIFO)
3. Heap Sort Complexity:
Heap sort ek balanced approach use karta hai jiski complexity hamesha fixed rehti hai:
Yeh Priority Queue ka perfect implementation hai.
4. Storage on Secondary Devices:
Disk blocks ko efficiently access karne ke liye B-Trees ka use hota hai taaki tree ki height h kam rahe:
Yahan M tree ka order hai aur N total elements hain.
Final Answer:
Sahi matching hai:
(A)−(IV),(B)−(I),(C)−(III),(D)−(II)
