• Placement Questions

Placement Papers with Solutions

(#M40032028) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
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?

Option 1 : ?(n^2)
Option 2 : ?(n)
Option 3 : ?(log3(n))
Option 4 : ?(3n)

Asked In AMCAT (11 years ago)

Unsolved Read Solution (11)

Is this Puzzle helpful?   (4)   (3) Submit Your Solution Technical

(#M40032027) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
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):

Option 1 : Code A will execute faster than Code B.
Option 2 : Code B will execute faster than Code A
Option 3 : Code A is logically incorrect.
Option 4 : Code B is logically incorrect.

Asked In AMCAT (11 years ago)

Unsolved Read Solution (7)

Is this Puzzle helpful?   (16)   (7) Submit Your Solution Technical

(#M40032026) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
Tarang writes an efficient program to add two upper triangular 10X10 matrices (elements on diagonal retained). How

many total additions will his program make?

Option 1 : 100
Option 2 : 55
Option 3 : 25
Option 4 : 10

Asked In AMCAT (11 years ago)

Unsolved Read Solution (8)

Is this Puzzle helpful?   (37)   (9) Submit Your Solution Technical

(#M40032025) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
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?

Option 1 : ?(n^2)
Option 2 : ?(n)
Option 3 : ?(n*log(n))
Option 4 : None of these

Asked In AMCAT (11 years ago)

Unsolved Read Solution (13)

Is this Puzzle helpful?   (6)   (3) Submit Your Solution Technical

(#M40032024) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
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?

Option 1 : Code A uses lesser memory and is slower than Code B
Option 2 : Code A uses lesser memory and is faster than Code B
Option 3 : Code A uses more memory and is faster than Code B
Option 4 : Code A uses more memory and is slower than Code B

Asked In AMCAT (11 years ago)

Unsolved Read Solution (11)

Is this Puzzle helpful?   (15)   (6) Submit Your Solution Technical

(#M40032023) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
While calculating time complexity of an algorithm, the designer concerns himself/herself primarily with the run time and

not the compile time. Why?

Option 1 : Run time is always more than compile time.
Option 2 : Compile time is always more than run time.
Option 3 : Compile time is a function of run time.
Option 4 : A program needs to be compiled once but can be run several times.

Asked In AMCAT (11 years ago)

Unsolved Read Solution (8)

Is this Puzzle helpful?   (21)   (2) Submit Your Solution Database

(#M40032022) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
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?

Option 1 : Fixed part
Option 2 : Variable Part
Option 3 : Product of fixed part and variable part
Option 4 : None of these

Asked In AMCAT (11 years ago)

Unsolved Read Solution (5)

Is this Puzzle helpful?   (0)   (3) Submit Your Solution Technical

(#M40032021) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
What is space complexity of a program?

Option 1 : Amount of hard-disk space required to store the program
Option 2 : Amount of hard-disk space required to compile the program
Option 3 : Amount of memory required by the program to run
Option 4 : Amount of memory required for the program to compile

Asked In AMCAT Aashu (11 years ago)

Unsolved Read Solution (9)

Is this Puzzle helpful?   (4)   (0) Submit Your Solution Technical

(#M40032020) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer:
A pseudo-code is used with the following meaning.
"pointer" is a data-type which contains memory address (or pointers)
Statement "a = *b" puts the value at the memory address referenced by b into a.
Statement "a = &b" puts the memory address of b into a.
Statement "*b = a" puts the value a at the memory address referenced by b.
What is the output of the following code statements? The compiler saves the first integer at the memory location 4062.

Integer is one byte long.

integer a
pointer b
a = 20
b = &a
print *b

Option 1 : 4062
Option 2 : 4063
Option 3 : 20
Option 4 : 10

Asked In AMCAT Aashu (11 years ago)

Unsolved Read Solution (10)

Is this Puzzle helpful?   (12)   (4) Submit Your Solution Program

(#M40032019) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
Rajiv wants to make a program which inputs two numbers: a and b (a>b) and computes the number of terms between a

and b (including a and b). What will be code statement to do this:

Option 1 : a - b
Option 2 : a - b + 1
Option 3 : a + b
Option 4 : a - b - 1


-----------------------------------------------------------
Que: Choose the correct answer
I have a problem to solve which takes as input a number n. The problem has a property that given the solution for (n-1),

I can easily solve the problem for n. Which programming technique will I use to solve such a problem?

Option 1 : Iteration
Option 2 : Decision-making
Option 3 : Object Oriented Programming
Option 4 : Recursion

Asked In AMCAT Aashu (11 years ago)

Unsolved Read Solution (7)

Is this Puzzle helpful?   (11)   (5) Submit Your Solution Program