Notice difference with respect to question --> https://gateoverflow.in/1997/gate2014-2-38

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+19 votes

The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with $25$ records) is:

- $165$
- $90$
- $75$
- $65$

+23 votes

Best answer

Arrange files in increasing order of records:

$\overset{\boxed5}{\text{D}}\quad \overset{\boxed{10}}{\text{A}}\quad\overset{\boxed{15}}{\text{C}}\quad\overset{\boxed{20}}{\text{B}}\quad\overset{\boxed{25}}{\text{E}}$

$\qquad\qquad\qquad\qquad\color{blue}{75}$

$\qquad\qquad\quad\color{blue}{30}\qquad\qquad\qquad\color{blue}{45}$

$\qquad\quad\color{blue}{15}\qquad\overset{\boxed{\text{C}}}{15}\qquad\qquad\overset{\boxed{\text{B}}}{20}\qquad\overset{\boxed{\text{E}}}{25}$

$\quad\overset{\boxed{\text{D}}}{5}\qquad\overset{\boxed{\text{A}}} {10}$

No. of movements $=15+30+45+75=165.$

$\overset{\boxed5}{\text{D}}\quad \overset{\boxed{10}}{\text{A}}\quad\overset{\boxed{15}}{\text{C}}\quad\overset{\boxed{20}}{\text{B}}\quad\overset{\boxed{25}}{\text{E}}$

$\qquad\qquad\qquad\qquad\color{blue}{75}$

$\qquad\qquad\quad\color{blue}{30}\qquad\qquad\qquad\color{blue}{45}$

$\qquad\quad\color{blue}{15}\qquad\overset{\boxed{\text{C}}}{15}\qquad\qquad\overset{\boxed{\text{B}}}{20}\qquad\overset{\boxed{\text{E}}}{25}$

$\quad\overset{\boxed{\text{D}}}{5}\qquad\overset{\boxed{\text{A}}} {10}$

No. of movements $=15+30+45+75=165.$

+1

Hi Pooja

I am not able to follow how did you get 45 ?

Could u please explain it for me.

Thanks in advance.

# Update:Understood.! First three files u merged and then u merged last two files and then clubbed u merged the two!

I am not able to follow how did you get 45 ?

Could u please explain it for me.

Thanks in advance.

# Update:Understood.! First three files u merged and then u merged last two files and then clubbed u merged the two!

+4

"This is **different** from another greedy problem in which **we simply merge the files one into another in after arranging them in ascending order**."

In the above solved question, we have used to "MERGE" procedure from merge sort which takes one element of each array compare them and put them in the final or output array.

- Movement of record is analogous to the movement of elements of arrays which we merge and no. of element get moved in MERGE producer are "all" i.e m+n.
- Comparisons would be just m+n-1 as last element remaining does not need any comparison to put it into the output array.

more:-https://gateoverflow.in/1997/gate2014-2-38?show=7132#c7132

+2

Why isn't this like- When we are merging the file with 5 records with another file of 10 records then the least no of records(i.e one with #records=5) among them would be moved to another file. Thus reducing no of movements to just 5? Why there is a need to use another file?

0

@Mamta , what if there is no space in other file to contain these 5 records :P ..Actually given question is an example of optimal merge pattern which follows greedy strategy for optimal solution. For this , Files should be sorted and then we merge these sorted files to make one sorted file...In question , it is not mentioned the word "sorted" but I think we should have to assume it.

+3 votes

- All categories
- General Aptitude 1.5k
- Engineering Mathematics 7.1k
- Digital Logic 2.7k
- Programming & DS 4.9k
- Algorithms 4.2k
- Theory of Computation 5.3k
- Compiler Design 2.1k
- Databases 4k
- CO & Architecture 3.5k
- Computer Networks 4k
- Non GATE 1.4k
- Others 1.5k
- Admissions 556
- Exam Queries 553
- Tier 1 Placement Questions 23
- Job Queries 69
- Projects 18

47,903 questions

52,285 answers

182,209 comments

67,715 users