• Placement Questions

Placement Papers with Solutions

(#M40032038) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
Vibhu is given two codes, A and B, to solve a problem, which have complexity O(n4) and ?(n3) respectively. Her client

wants to solve a problem of size k, which is sufficiently large. Which code will Gautam deliver to the client, so that the

execution is faster?

Option 1 : Code A
Option 2 : Code B
Option 3 : Vibhu cannot determine
Option 4 : Both codes have the same execution time, so deliver any.

Asked In AMCAT (11 years ago)

Unsolved Read Solution (4)

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

(#M40032037) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
Surbhi is given two codes, A and B, to solve a problem, which have complexity O(n3) and ?(n4) respectively. Her client

wants to solve a problem of size k, which is sufficiently large. Which code will Surbhi deliver to the client, so that the

execution is faster?

Option 1 : Code A
Option 2 : Code B
Option 3 : Surbhi cannot determine
Option 4 : Both codes have the same execution time, so deliver any.

Asked In AMCAT (11 years ago)

Unsolved Read Solution (4)

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

(#M40032036) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
Gautam is given two codes, A and B, to solve a problem, which have complexity ?(n) and ?(n2) respectively. His client

wants to solve a problem of size k, which Gautam does not know. Which code will Gautam deliver to the client, so that

the execution is faster?

Option 1 : Code A
Option 2 : Code B
Option 3 : Gautam cannot determine
Option 4 : Both codes have the same execution time, so deliver any.

Asked In AMCAT (11 years ago)

Unsolved Read Solution (6)

Is this Puzzle helpful?   (2)   (5) Submit Your Solution Technical

(#M40032035) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
Rajini is given an efficient code for summing two nXn matrices and putting the result in a third matrix. She is asked to

find it's time complexity. She realizes that the number of iterations required is more than n. What can she claim with

regard to the complexity of the code?

Option 1 : It is O(n)
Option 2 : It is O(n2)
Option 3 : It is ?(n)
Option 4 : It is ?(n)

Asked In AMCAT (11 years ago)

Unsolved Read Solution (11)

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

(#M40032034) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
The time complexity of code A is ?(n), while for Code B it is ?(log(n)). Which of the following is true for sufficiently

large n?

Option 1 : Both code have the same time complexity
Option 2 : Code A has higher time complexity
Option 3 : Code B has higher time complexity
Option 4 : No comparison can be made between the time complexity of the two codes.

Asked In AMCAT (11 years ago)

Unsolved Read Solution (4)

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

(#M40032033) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
We have two programs. We know that the first has a time complexity O(n2), while the second has a complexity ?(n2).

For sufficiently large n, which of the following cannot be true?

Option 1 : Both codes have same complexity
Option 2 : The first code has higher time complexity than the second
Option 3 : The second code has lower time complexity than the first code.
Option 4 : Both codes are the same.

Asked In AMCAT (11 years ago)

Unsolved Read Solution (5)

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

(#M40032032) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
A code takes the following code steps (equivalently time unit) to execute: 5*n3 + 6*n2 + 1. Which of the following is not

true about the time complexity of the program?

Option 1 : It has a time complexity of O(n3)
Option 2 : It has a time complexity of O(n4)
Option 3 : It has a time complexity of O(n2)
Option 4 : It has a time complexity of ?(n3)

Asked In AMCAT (11 years ago)

Unsolved Read Solution (11)

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

(#M40032031) AMCAT QUESTION Keep an EYE

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

Option 1 : Code A is faster than Code B
Option 2 : Code B is faster than Code A
Option 3 : Code A and Code B will run in the same amount of time
Option 4 : The comparison between the speed of the codes cannot be made.

Asked In AMCAT (11 years ago)

Unsolved Read Solution (10)

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

(#M40032030) AMCAT QUESTION Keep an EYE

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

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

Asked In AMCAT (11 years ago)

Unsolved Read Solution (10)

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

(#M40032029) AMCAT QUESTION Keep an EYE

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

Option 1 : ?(n^2)
Option 2 : ?(n)
Option 3 : ?(n1/2)
Option 4 : ?(log(n))

Asked In AMCAT (11 years ago)

Unsolved Read Solution (5)

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