Nagarro Placement Paper General - Other father Agnel School-11 Oct 2009

Posted by FreshersWorld

7 Jan, 2012

Hi guys, The first paper for aptitude was for 1 hour.This was an objective type paper. It had two parts- maths and analytical with 20 questions in each section. Formulae were given at the back for maths section. 2.5 for every correct answer and a (-)1 for every wrong answer. It was a simple paper.

Next was technical section for 1.5 hours.This was subjective.It had 4 qustions.The ones i remember are as follows: 1. there is a matrix N x N .Its elements consist of either value =1 or value=0. If there is a any zero in the row, then the output matrix should have all zeroes in that row. If there is a single zero in any column then that column should have all zeroes n the output matrix. write the function to perform these operations. 2. There are two sorted arrays a1 and a2 of size n1 and size n2 respectively. array a1 is full array a2 has exactly n1(size of array a1) empty space. example a1[]=1234 a2[]=56789_ _ _ _ Write a function to merge these two arrays to form a sorted array without any extra memory use. 3. There is a lucky draw held every day. If there is a winning number eg. 1876, then all possible numbers like 1867 ,1687,1768 etc are the numbers that match irrespective of the position of the digits. Thus all these numbers qualify fr the lucky draw prize. Assume there is no zero digit in any numbers. Write a program to show all the possible winning numbers if a "winningnumber" is passed as an argument to the function.

Ad Blocker Detected

We have noticed that you have an ad blocker enabled which restricts ads served on the site.
Please disable it to continue using Downloadmela.

Hi guys,

The first paper for aptitude was for 1 hour.This was an objective type paper.

It had two parts- maths and analytical with 20 questions in each section.

Formulae were given at the back for maths section.

2.5 for every correct answer and a (-)1 for every wrong answer.

It was a simple paper.

Next was technical section for 1.5 hours.This was subjective.It had 4 qustions.The ones i remember are as follows:

1.

there is a matrix N x N .Its elements consist of either value =1 or value=0.

If there is a any zero in the row, then the output matrix should have all zeroes in that row.

If there is a single zero in any column then that column should have all zeroes n the output matrix.

write the function to perform these operations.

2.

There are two sorted arrays

a1 and a2 of size n1 and size n2 respectively.

array a1 is full

array a2 has exactly n1(size of array a1) empty space.

example

a1[]=1234

a2[]=56789_ _ _ _

Write a function to merge these two arrays to form a sorted array without any extra memory use.

3.

There is a lucky draw held every day.

If there is a winning number eg. 1876, then all possible numbers like 1867 ,1687,1768 etc are the numbers that match irrespective of the position of the digits.

Thus all these numbers qualify fr the lucky draw prize.

Assume there is no zero digit in any numbers.

Write a program to show all the possible winning numbers if a "winningnumber" is passed as an argument to the function.