## AMCAT COMPUTER PROGRAMMING PREVIOUS QUESTIONS (PAPERS) – 11

Ques42. What is the output of the following code statements? The compiler saves the

first integer at the memory location 4165 and the rest at consecutive memory spaces

in order of declaration. Integer is one byte long.

integer a

pointer c, d

a = 30

c = &a

d = c

a = a + 10

print *c

Op 1: 30

Op 2: 4165

Op 3: 40

Op 4: 4166

Op 5:

Correct Op : 3

Ques43. What is space complexity of a program?

Op 1: Amount of hard-disk space required to store the program

Op 2: Amount of hard-disk space required to compile the program

Op 3: Amount of memory required by the program to run

Op 4: Amount of memory required for the program to compile

Op 5:

Correct Op : 3

Ques44. The memory space needed by an algorithm has a fixed part independent of

the problem instance solved and a variable part which changes according to the

problem instance solved. In general, which of these two is of prime concern to an

algorithm designer?

Op 1: Fixed part

Op 2: Variable Part

Op 3: Product of fixed part and variable part

Op 4: None of these

Op 5:

Correct Op : 2

Ques45. While calculating time complexity of an algorithm, the designer concerns

himself/herself primarily with the run time and not the compile time. Why?

Op 1: Run time is always more than compile time.

Op 2: Compile time is always more than run time.

Op 3: Compile time is a function of run time.

Op 4: A program needs to be compiled once but can be run several times.

Op 5:

Correct Op : 4

Ques46. Pankaj and Mythili were both asked to write the code to evaluate the

following expression:

a – b + c/(a-b) + (a-b)2

Pankaj writes the following code statements (Code A):

print (a-b) + c/(a-b) + (a-b)*(a-b)

Mythili writes the following code statements (Code B):

d = (a-b)

print d + c/d + d*d

If the time taken to load a value in a variable, for addition, multiplication or division

between two operands is same, which of the following is true?

Op 1: Code A uses lesser memory and is slower than Code B

Op 2: Code A uses lesser memory and is faster than Code B

Op 3: Code A uses more memory and is faster than Code B

Op 4: Code A uses more memory and is slower than Code B

Op 5:

Correct Op : 1

Ques47. Vrinda writes an efficient program to sum two square diagonal matrices

(matrices with elements only on diagonal). The size of each matrix is nXn. What is the

time complexity of Vrinda’s algorithm?

Op 1: &theta(n^2)

Op 2: &theta(n)

Op 3: &theta(n*log(n))

Op 4: None of these

Op 5:

Correct Op : 2

Ques48. Tarang writes an efficient program to add two upper triangular 10X10 matrices

(elements on diagonal retained). How many total additions will his program make?

Op 1: 100

Op 2: 55

Op 3: 25

Op 4: 10

Op 5:

Correct Op : 2

Ques49. Ravi and Rupali are asked to write a program to sum the rows of a 2X2

matrices stored in the array A.

Ravi writes the following code (Code A):

for n = 0 to 1

sumRow1[n] = A[n][1] + A[n][2]

end

Rupali writes the following code (Code B):

sumRow1[0] = A[0][1] + A[0][2]

sumRow1[1] = A[1][1] + A[1][2]

Comment upon these codes (Assume no loop-unrolling done by compiler):

Op 1: Code A will execute faster than Code B.

Op 2: Code B will execute faster than Code A

Op 3: Code A is logically incorrect.

Op 4: Code B is logically incorrect.

Op 5:

Correct Op : 2

Ques50. There is an array of size n initialized with 0. Akanksha has to write a code

which inserts the value 3k at position 3k in the array, where k=0,1…(till possible).

Akanksha writes an efficient code to do so. What is the time complexity of her code?

Op 1: &theta(n^2)

Op 2: &theta(n)

Op 3: &theta(log3(n))

Op 4: &theta(3n

)

Op 5:

Correct Op : 3

Ques51. There are two matrices A and B of size nXn. The data in both these matrices

resides only at positions where both the indices are a perfect square. Rest all

positions have 0 as the data. Manuj has available a third matrix initialized with 0’s at

all positions. He writes an efficient code to put the sum of A and B in C. What is the

time complexity of Manuj’s program?

Op 1: &theta(n^2)

Op 2: &theta(n)

Op 3: &theta(n1/2)

Op 4: &theta(log(n))

Op 5:

Correct Op : 2

Ques52. Ravi has to add an strictly upper triangular (no elements at diagonal) and a

strictly lower triangular square matrix (no elements at diagonal) and put the result in

a third matrix. What is the time complexity of Ravi’s algorithm? Assume that storing

a value in a memory space takes negligible time, while each addition between values

takes the dominating amount of time.

Op 1: &theta(n^2)

Op 2: &theta(n)

Op 3: &theta(1)

Op 4: None of these

Op 5:

Correct Op : 3

Ques53. We have two 100X3 (rowsXcolumn) matrices containing mid-term exam marks

and end-term exam marks of 100 students. Each row refers to a particular student,

while columns refer to marks in English, Social Sciences and Maths. The end-term

and mid-term marks of each student in each subject have to be added to get his total

score in each subject, to be put in a third matrix (100X3). Parinidhi writes a code

(Code A), where the outer loop iterates over the rows, while the inner loop iterates

over the columns. Shashi writes a code (Code B), where the outer loop iterates over

the columns, while the inner loop iterates over rows. Which of the following is true

with regard to their code ignoring any caching or memory storage effects?

Op 1: Code A is faster than Code B

Op 2: Code B is faster than Code A

Op 3: Code A and Code B will run in the same amount of time

Op 4: The comparison between the speed of the codes cannot be made.

Op 5:

Correct Op : 2