Question

Question 8)

Suppose a program is supposed to merge two files in the following manner: write two lines from the first file, write two lines from the second file, and repeat the process until all of the lines have been written to the new merged file. For example suppose we have the following two input files:

File1.txt	File2.txt
AAA BBB CCC DDD	000 111 222 333

Then the merged output file would be:

File3.txt

AAA BBB 000 111 CCC DDD 222 333

Which of the options below is a correct implementation of the program?

NOTE: Assume the two input files always have the same number of lines

      Assume the number of lines is always even in both files

     Assume both files always have at least two (2) lines

The infile1 variable is associated with the File1.txt file

The infile2 variable is associated with the File2.txt file

The total_lines variable stores the total number of lines in the two files together (8 in the example shown above)

(the options are on the next page)

Which of the options below is a correct implementation of the program?

Group of answer choices

infile1>>file_line1;

infile2>>file_line2;

do {

       outfile<<file_line1<<endl;

       outfile<<file_line2<<endl;

      }

    while(infile1>>file_line1 &&

               infile>>file_line2);

int total_lines = count_lines(filename1) +

                             count_lines(filename2);

for(int i=0; i<(total_lines/2); i++)

{

    if((i % 2) == 0)    

         infile1>>file_line;

    else

         infile2>>file_line;

    

    outfile<<file_line<<endl;

}

int total_lines = count_lines(filename1) +

                              count_lines(filename2);

for(int i=0; i<total_lines; i++)

{

    if((i % 4) <=1)    

         infile1>>file_line;

    else

         infile2>>file_line;

    

    outfile<<file_line<<endl;

}

while(infile1>>file_line1 && infile>>file_line2)

{

   outfile<<file_line1<<endl;

   outfile<<file_line2<<endl;

}

Question 9)

Suppose two players are playing a modified version of the game Battleship on a 10 X 10 game board. In this modified version of the game, there is only ONE (1) battleship that takes up FIVE (5) spaces on the game board.

NOTE: In Battleship, ships can be placed only horizontally or vertically. They CANNOT be placed diagonally.

The current state of the game board for player 1 is shown below. Note the following:

• An empty cell means player 1 has not tried to hit that cell on the game board yet.
• A cell with an “*” means player 1 hit that cell, but they missed (i.e., player 2 did not have part of their ship on that cell)
• A cell with an “X” means player 1 hit that cell and successfully hit part of player 2’s ship

*			*	*		*		*	*
	*							*
*		*	*	*	*				*
			X
*	*					*		*

Player 1’s game board is represented by a 10X10 2D array with the name player1. Based on the game board shown above, all of the following options below would be logical moves for player 1 to make on their next turn EXCEPT:

Group of answer choices

C-) player1[5][4]

D-) player1[6][3]

B-) player1[5][2]

A-) player1[4][3]

Question 10)

There is a close correspondence between the indexes in a 1D array and 2D array of the same size.

For example, suppose a program has the following two array declarations:

const int SIZE = 4, X=2, Y=2;

int arr1[SIZE];

int arr2[X][Y];

Both the 1D array and the 2D array have four indexes (subscripts).

For example, suppose the numbers 11, 22, 33, and 44 are being stored. The 1D array would look like this:

11

22

33

44

And the 2D array would look like this:

11	22
33	44

Assume the variable index is storing an index number from the 1D array. Which of the options below will correctly convert an index from the 1D array into the equivalent index in the 2D array?

Group of answer choices

A-) arr2[index/X][index/Y]

D-) arr2[index/X][index%Y]

B-) arr2[index%X][index%Y]

C-) arr2[index%X][index/Y]

Answer 1

Q8} Correct option: c

int total_lines = count_lines(filename1) + count_lines(filename2);

for(int i=0; i<total_lines; i++){

if((i % 4) <=1)     infile1>>file_line;

else infile2>>file_line;

     outfile<<file_line<<endl;

}

Whenever the remainder is 0 or 1 serially words from file 1 is picked up into file_line and written to output file again when remainder on dividing i by 4 is 2 or 3 then words from file 2 is picked up and written to output file, So this way in the cycle upto the count of total_lines , every consecutive two lines from file 1 corresponding to remainder 0 and 1 is written to output first and then two lines from file 2 corresponding to file 2 is written to output file after that.

Q9} correct option : player1 [4] [3]

Any move which lies between the given ranges below representing possible positions of the ship is logical:

player1[4][3] is not a logical move because this move has already been done earlier and the battleship of player 2 is not over there as the [4][3] cell has " * " marked on it ,

Q 10}correct option: arr2[ index / X ] [ index % Y ]

index value starts from 0 : keeping that in mind. for an element in the 1 D array with a given index ,in order to compute its location on a 2D array , we must find how many elements from start of the 1D array can be placed in the first row of the 2D array this will give us the row number of the element in 2D array , this can be computed using ( index / X ) .
once we get the row number , we must see what is the offset left to place our element in the row which we found by index/X , this can be done by finding the remainder(offset) ie index % Y ,this is the column number