Computer Science · Data Structures and Algorithms
इष्टतम मर्ज पैटर्न (optimal merge pattern) का उपयोग करके पांच क्रमबद्ध (sorted) फाइलों: A (10 रिकॉर्ड), B (20 रिकॉर्ड), C (15 रिकॉर्ड), D (5 रिकॉर्ड) और E (25 रिकॉर्ड) को मर्ज करने के लिए आवश्यक रिकॉर्ड गतिविधियों (record movements) की न्यूनतम संख्या क्या है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 165
- 275
- 390
- 4165✓
सही उत्तर देखें
165
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms