Nagarro Paper General - other - 30 November 2003 Paper - 10

1) aptitude duration 90 min
2) technical duration 60 min (for freshers) / 30 min (for exp)

In technical paper, we had a choice of three papers - Java, Vb, & C++. I wrote on C++

In aptitude paper, they have 25 qns on maths and 25 on reasoning. Maths qns level is same as that of CAT. Mensuration, trignometry, interests etc. are asked. they alos provide you with some formulae on the back of the qpaper. pls note that not all the formulas will be used and not all that are needed are provided. there is negative marking in both papers (+3 & -1). I prepared for this section from IMS CAT material.

In C++ paper, prepare C++ well alongwith data structures. I found Robert lafore to be quite a useful book. besides this there is a book by Stephen Prata (although it,s level is considerably higher than that expected in the test). Some of the questions i remember are

can a deconstructor be overloaded
Find the output (4-5 qns on this)
Time complexity
Queue, deque, linked list
We can simulate queue using two stacks. Can we simulate two stacks using a queue? etc..

They will inform abt results in 15 days.

One more thing, there was no checking of call letters as well as icards (although they had asked to bring proof of identification in call letter.

you also have to take 2 copies of your latest resume and fill up a datasheet in the exam hall. Also take a pencil as it was written in paper to darken the oval with pencil, but many ppl did not have one, so they had to use pen.

Whole Testpaper NAGARRO, GURGAON - 6 July 2006 Paper - 7

NAGARRO PAPER AND PATTERN ON 6th JULY 2006 AT NAGARRO, GURGAON

Hi,

This is the latest nagarro pattern i,ve seen in 2006.
They have same two papers:
1. Aptitude ( 50 Questions in 90 mins.) Objective
2.Technical (5 Questions in 60 mins.) Subjective

In Aptitude paper first twenty five from maths aptitude.
The questions which i remeber were like

What is the least vaule of x (integer) for which 5/x is an integer?
ladder sliding question from tenth R.S. AGGARWAL
question on PQxQT = PT2 theorem in circles
What will be the max power of 12 dividing 50! (fifty factorial)?
simple question from chords of a circle
CAT level question on Work, Speed Time Distance.(in total 4 questions)
cyclic quadilateral.
If A is 20% less than B then by how much percent B is more than A?
Simple question on SI,CI
If A and B has salary ratio 3:5 and Expenditure Ratio 2:3 have same savings and total A+B income equals 10000. Calculate B,s Savings?
Angles question in circles.
2 quests from PERMUTATIONS and COMBINATIONS.
What will be the Last Digit of 3458367x9267846?
question on calculating no. of factors.

This much i can help u about maths (25 questions) now the rest 25 were on Analytical Reasoning (15) and Deductive Logic (10)

AR has 3 question each of it has five parts.In total 15 quests.

Deductive Logic was damn simple and 10 quests.

Now comes the technical part.
5 questions in 60 mins.difficult + easy.

Three languages are given C++, Java, VB
You have to choose one out of three.
I,ve chosen C++

Q1. A Class Structure was given with function names only.
Using one dimensional array make the fuctionality of two dimensional array?
We have to write the function body and the main program which calls them.
the function attributes and return type was given.
some already defined variables were also there.

Q2. If employee B is the boss of A and C is the boss of B and D is the boss of C and E is the boss of D.
Then write a program using the Database such that if an employee name is Asked to Display it also display his bosses with his name.
For eg. If C is displayed it should also display D and E with C?

Q3. Arrange Doubly linked list in the ascending order of its integral value and replace integer 5 with 7?

Q4. Three tables were given and we had to link them.

Q5. It was an operator overloading question I don,t remember it much.

General - other - 30 November 2003 Paper - 8

NAGARRO PATTERN - 30 NOV 2003
I attended the Nagarro selection test on the 30th. paper was the same pattern as before. there were two parts

1) aptitude duration 90 min
2) technical duration 60 min (for freshers) / 30 min (for exp)

In technical paper, we had a choice of three papers - Java, Vb, & C++. I wrote on C++

In aptitude paper, they have 25 qns on maths and 25 on reasoning. Maths qns level is same as that of CAT. Mensuration, trignometry, interests etc. are asked. they alos provide you with some formulae on the back of the qpaper. pls note that not all the formulas will be used and not all that are needed are provided. there is negative marking in both papers (+3 & -1). I prepared for this section from IMS CAT material.

In C++ paper, prepare C++ well alongwith data structures. I found Robert lafore to be quite a useful book. besides this there is a book by Stephen Prata (although it,s level is considerably higher than that expected in the test). Some of the questions i remember are

can a deconstructor be overloaded
Find the output (4-5 qns on this)
Time complexity
Queue, deque, linked list
We can simulate queue using two stacks. Can we simulate two stacks using a queue? etc..

Nagarro Paper Whole Testpaper NAGARRO, GURGAON - 6 July 2006 Paper - 9

1. Aptitude ( 50 Questions in 90 mins.) Objective
2.Technical (5 Questions in 60 mins.) Subjective

In Aptitude paper first twenty five from maths aptitude.
The questions which i remeber were like

What is the least vaule of x (integer) for which 5/x is an integer?
ladder sliding question from tenth R.S. AGGARWAL
question on PQxQT = PT2 theorem in circles
What will be the max power of 12 dividing 50! (fifty factorial)?
simple question from chords of a circle
CAT level question on Work, Speed Time Distance.(in total 4 questions)
cyclic quadilateral.
If A is 20% less than B then by how much percent B is more than A?
Simple question on SI,CI
If A and B has salary ratio 3:5 and Expenditure Ratio 2:3 have same savings and total A+B income equals 10000. Calculate B,s Savings?
Angles question in circles.
2 quests from PERMUTATIONS and COMBINATIONS.
What will be the Last Digit of 3458367x9267846?
question on calculating no. of factors.

This much i can help u about maths (25 questions) now the rest 25 were on Analytical Reasoning (15) and Deductive Logic (10)

AR has 3 question each of it has five parts.In total 15 quests.

Deductive Logic was damn simple and 10 quests.

Now comes the technical part.
5 questions in 60 mins.difficult + easy.

Three languages are given C++, Java, VB
You have to choose one out of three.
I,ve chosen C++

Q1. A Class Structure was given with function names only.
Using one dimensional array make the fuctionality of two dimensional array?
We have to write the function body and the main program which calls them.
the function attributes and return type was given.
some already defined variables were also there.

Q2. If employee B is the boss of A and C is the boss of B and D is the boss of C and E is the boss of D.
Then write a program using the Database such that if an employee name is Asked to Display it also display his bosses with his name.
For eg. If C is displayed it should also display D and E with C?

Q3. Arrange Doubly linked list in the ascending order of its integral value and replace integer 5 with 7?

Q4. Three tables were given and we had to link them.

Q5. It was an operator overloading question I don,t remember it much.

Whole Testpaper Gurgaon - 21 July 2007 Paper - 5

NAGARRO PAPER ON 21st JULY AT GURGAON

hi all,
I have attended Nagarro Off Campus Test on july 21 at Gurgaon.
Following is the complete test paper of the test as I remember..

Firstly There was an Aptitute test (90 min) comparising two sections as follows:
1. Mathematical Ability Test - 25 Questions
2. Analytical Ability Test - 25 Questions

Mathematical Test:-
There ws questions from Mensuration (Circle, Rhombus, Square, Cube etc..), Trigonometry( Sin, Cos.. etc..), geometry (Circle,s chord.. etc)
Questions were above average level but they had given the list of formulae. so it was easy to solve..

Analytical Test:
This was comparatively easy one. There was 5 group of questions with instructions given for each...
1. quesions like.. A is father and have to children M & N of opposite sex.. B is the sun of M... etc... easy to solve if you are able to make a graph.
2. Than there was a question which were saying about the arrangement of books...Other questions was work group questions...In short Aptitude was ok..

Technical Ability Test:
This was difficult. three questions to be attempted in 60 min. The Coplete Technical Paper was as follows:
Write the Pseudo code for the following:
1. Wrie a function which returns the most frequent number in a list of integers. Handle the case of more than one number which meets this criterion.
public static int[] GetFrequency(int[] list)
2. Counting in Lojban, an artificial language developed over the last fourty years, is easier than in most languages
The numbers from zero to nine are:
0 no
1 pa
2 re
3 ci
4 vo
5 mk
6 xa
7 ze
8 bi
9 so
Larger numbers are created by gluing the digit togather.
For Examle 123 is pareci
Write a program that reads in a lojban string(representing a no less than or equal to 1,000,000) and output it in numbers.

3. Where now stands that small knot of villages known as the Endians, a mighty forest once stood. Indeed, legand has it that you could have stoodon the edge of the wood and seen it stretch out for miles, were it not for the trees getting in the way.
In one section of the forest, the trees stood in a row and were of hight from 1 to n, each hight occurring once and once only.
A tree was only visible if there were no higher trees before it in the row.
For example, if the heights were 324165, the only visible trees would have been those of height 3,4 & 6.

General - other Delhi University - 5 July 2007 Paper - 6

NAGARRO PAPER ON 5th JULY AT DELHI UNIVERSITY

The written exam consisted of 25 general maths questions on trigonometry, circles, area, perimeter, mensuration, time, work, distance etc ques.
and aptitude consisted of 4 ques with several parts. they wer twisty ques including the puzzle test ques given in R.S.Aggarwal verbal-nonverbal book....

The second written exam included 4 coding ques which wer to be written in C++. It was something like this:
Instructions:
1.The code should emphasize on min time and then min memory requirements.
2.The time limit was 1hr 30min.

Ques1: Given an array containing k nos in the range 1..n and another scratch array of size n. Write an program to remove the duplicates from the array.

Ques2: Given a table of the form:
Product Sold on
A 1/1/1980
B 1/1/1980
C 1/1/1980
A 1/1/1980
B 1/1/1980
C 2/1/1980
A 2/1/1980

There are 30 products and 10,000 records of such type. Also the month period during which sales happened is given to u.

Write the program to display the result as:
Product Month No. of copies
A January 12
A February 15
A March 27
B January 54
B February 15
B March 10
C January 37

Ques3: Definition of priority queue was given. We have to implement the priority queue using array of pointers with the priorities given in the range 1..n.
The array could be accessed using the variable top. The list corresponding to the array elements contains the items having the priority as the array index.
Adding an item would require changing the value of top if it has higher priority than top.
Extracting an item would require deleting the first element from the corresponding queue.
The following class was given:
class PriorityQueue
{
int *Data[100];
int top;
public:
void put(int item, int priority); // inserts the item with the given priority.
int get(int priority); // extract the element with the given priority.
int count(); // returns the total elements in the priority queue.
int isEmpty(); // check whether the priority queue is empty or not.
};
We had to implement all these class functions.

Ques4: An array of size 5X5 is given to us. The elements from 1 to 25 are to be inserted in the array, such that starting from a particular position for an element i, the next element i+1can be inserted only at the mentioned positions (u,v), and if these all positions are occupied then it returns giving a count of how many positions have been occupied in the array:
(u,v) = (x+/-3 , y)
(u,v) = (x , y+/-3)
(u,v) = (x+/-2 , y+/-2).

Example: if the starting element is 1 with the given positions (1,2), then next element 2 can be placed at any one of the positions marked with *.
_ _ _ _ _
1 _ _ _ *
_ _ _ _ _
_ _ * _ _
* _ _ _ _

Function to be implemented is fun(int start, int end) where start and end will give the start and end coordinate of first element i.e. 1.

There wer three interview rounds: 2 tech interviews and one HR.
In the first tech interview ques from C/C++, operating systems and DBMS wer asked. they emphasised on RDBMS.. also some puzzles wer asked.

The second tech interview, we had to explain the codes which we wrote in the written exam and some optimizations to be done with them.
The third HR round was just a formality... every thing about ur life, ur parents, ur success, ur good times, bad times, wat made u happy, ur strengths, weakness, ur life experience and so on....

Aptitude - Numerical Father Agnel School,New Delhi - 9 February 2008 Paper - 3

NAGARRO 9th FEBRUARY AT NEW DELHI

Hello friends, Navneet here from Meerut.I gave Nagarro paper.

APTITUDE:
1.sinx+sin2x=1,then cos2x+xos4x=?
a)1 b)3 c)0 d)none
2.cos 30d/sin 10d + cos 59d/sin 31d =?
a)1 b)2 c)3 d)4
3. x pow (a+b) . x pow(b+c). x pow (c+a)/ (x pow(a). x pow(b) . x pow(c)) pow(2)=?
a)0 b)1 c)8 d) 5
4) length of minute hand is 5.4 cm, area covered by this in 10 min is ?
a)50.97 b)57.23 c)55.45 d)59.14

some related to profit and loss and reasoning-: Only Puzzles.
Programmin section 1.30 hrs 4 question.
1)Seat Planing
Write a function for seat allocate and seat reserved.Seat allocate array and seat reserver array.Seat allocate array is of 10*20 and each row and column represent A1,A2....;B1,B2.....;........J1,J2... and so on i.e row are A to J whereas col starts from 0 to 19.Each cell in the table represent either 0 or 1. 0 rep seat available , 1 repr seat reserved.

Seat allocation starts from highest to lowest.And row j is highest, i is second highest and so on. Max 20 seats can be booked at a time. if seat is available print the seat no like "B2" i.e (2 row, 3 col) and seat is booked." otherwise Print "Seat is not available."

2) A string of charater is given.Find the highest occurance of a character and display that character.
eg.: INPUT: AEGBCNAVNEETGUPTAEDAGPE
OUTPUT:
E
or
I,J(if equal occurance)

3)Remove all the blank spaces between character.Matrix is of 10* 10.
eg: INPUT
------------------------------------
| N | A | | V | |T
-------------------------------------
| |G | U | |P |
--------------------------------------
|T | | | A | |
------------------------------------

OUTPUT:
------------------------------------
| N | A | V | T | |
-------------------------------------
|G |U | P | | |
--------------------------------------
|T | A | | | |
------------------------------------

4)write a function to give demostrate the functionality of 3d in 1d. function prototye:
change(int value,int indexX,int indexY,int indexZ, int [] 1dArray);
value=what is the date; indexX=x-asix indexY=y-axis indexZ=z-axis and 1dArray=in which and where the value is stored.

General - other PCE,Jaipur - 5 September 2007 Paper - 4

NAGARRO PAPER ON 5th SEPTEMBER 2007

Nagarro selection procedure held at PCE,jaipur on 5th,sept 07

1st round:
paper1:40 objective type ques to be completed in 90 minutes
20 general maths
20 reasoning
paper2:5 subjective prog. ques to be completed in 2hrs
(language of implementation:C/C++/Java/.net/pseudo code)
out of round abt 1000 students they selected 18
8 for engineering group(based on paper2 score)
10 for quality group(based on paper1 score)
Interview procedure: held at nagarro office,gurgaon on 20-21,sept 07
there r 4 rounds

Round 2:(for quality group:50 objective type ques to be completed in 90 minutes
25 general maths
25 reasoning)
(For engineering group there r 2 programming questions)

Round 3:Essay writing
3 topics were given
1.India as a superpower
2.opening up of indian economy
3.Descibe abt any 4 global indian(youth icons)
total time:30 min

Round 4:Another HR asked 2 apti ques

Whole Testpaper Pce, Jaipur - 19 February 2008 Paper - 2

NAGARRO 19th FEBRUARY AT JAIPUR

Hello Friend, Ajay Here. i just decribing here at Paper Procedure Which held at PCE, Jaipur on 19 feb.2008, Mainly for nagarro Selecton procedure 3 round conduct

In Round first.
40 Question in 90 minutes.

There Mainly two Section.
Apptitude Section:-
Apptitude Section there was 40 question

This Section divide in two part.
1) Mathematics part:-(20 Question) Trignometry, Profit and loss,Ven disgram,Sphere, Trinagle problems
Some Question in Mathematic was such as

1) if Sec^2 A= 4xy/(x+y)^2
Ans:- This is possible only for x=y;

2)if SecA*SinA=0 then what will be the Value of CosA.
Ans:- CosA=Cos0=1

3) What will be the Max. Value of f(x) = (sinx-cosx)^2
Ans:-1

4) If tan A = 2-(3)^1/2 then what will be the value of tan (90-A)
Ans:- 2+3^1/2

5) if log [log (x+4)-4] =0
7 5 then what will be the value of x.
Ans:-4

6) What will effect on the Area of a triangle if the side of triangle just double from their original Side.

7) Two question based on ven diagram.

8) One Question on profit and loss such as if a shopkeeper sell 960 gm sugar in respect of 1000g at same price then what will there profit .Ans:- 25/6

9) How Many no. Between 1000 to 9900 in which four digits of number are different.

10) if xy = 6 and x^2y+xy^2+x+y = 9 then find out the Value of x^2 + y^2

2) Reasonong Part:- Mainly there was four question and each question divided in 5 Sub Question

1) First Question was base on Blood relation . it was such that if A, B, C, D, E, F, have relation with J as Father, Brother, Daughter, Aunt , Mother, Wife Unorderly and there was given condition such as

1) A and B have not same Sex

2) D, E have Same Sex

3) E born Before A.

Then Find out the following Answer.

2) Second Question was based on A Contract.

These All question from R.S. Agarrwal. So Please refer them for Practice because it is Very time Consuming Part.

Technical Paper:-
Second Paper of Round 1 total Technical. There Was four Question one Quest ion i Remember was such as

Q.1 A string of charater is given.Find the Continous Occurance of a character and display that character.
eg.: INPUT: AAAAAAEGBCNAVNEETGUPTAEDAGPE
OUTPUT:
A or if Same then A and D.

Q.2 One question was base on Hash Table related Teacher, Their topic,in A 20 days Period.

Q.3 Based on link list where one pointer Point the Next Node and Second Show their Sub Node. To write a Fuction Which Return the largest integer Value.

I just like to Say . Nagarro ka to Kevel Appti do Kyonki Maths or Logical Reasoning Ki Practice ho jati hai...

After Exam they Declare that Result Will Declare With in 30 Days.
Their Package between 6000$-6200$

General - other Father angel school, Delhi - 9 February 2008 Paper - 1

NAGARRO 9th FEBRUARY AT NEW DELHI

Nagarro 1st written test consists of the following with the time limit of 2.5 hrs
1. Aptitude (20 Q,s)
2. Analytical Ability (20 Q,s)
3 Coding paper (4 Q,s - 1hr)

APTITUDE:
Aptitude consists of geometry, 1question from trignometry, Mensuration, Profit n loss and distance/speed/time and time and work. This part was easy. Formulas to be used were mailed to us, int prior, but they were not provided with the question paper.

ANALYTICAL ABILITY:
These questions were really easy, and can be done in 15-20 mins.
For above two, books I would recommend you would be Barons and RS aggrawal and good puzzles book.

CODING (Should be Efficient in terms of time and space):
Aptitude and Analytical Ability papers were taken back when this section was given to us. And in each coding question paper, function prototype was given.

Programmin section 1.30 hrs 4 question.
1)Seat Reservation prog for the theatre. Write a function for seat allocation for the movie tickets. Total no of seats available are 200. 20 in each row. Each row is referred by the Character, "A" for the first row and ,J, for the last. And each seat in a row is represented by the no. 1-20. So seat in diffrent rows would be represented as A1,A2....;B1,B2.....;........J1,J2... Each cell in the table represent either 0 or 1. 0 rep would seat is available , 1 would represent seat is reserved.

Booking should start from the last row (J) to the first row(A). At the max 20 seats can be booked at a time. if seats are available, then print all the seat nos like "B2" i.e (2 row, 3 col) otherwise Print "Seats are not available." and we must book consecutive seats only.

2) A string of charaters were given. Find the highest occurance of a character and display that character.
eg.: INPUT: AEGBCNAVNEETGUPTAEDAGPE
OUTPUT: E


3) Int Matrix of certain size was given, We had few values in it like this.

1
4

5
45

3
3
5
4

34
3
3
12

3
3
4
3

3
3

4
4
3



We were supposed to move back all the spaces in it at the end.

Note: If implemented this prog using recursion, would get higher preference.


4)write a function to give demostrate the functionality of 3D matrix in 1D matirx. function prototye: void set (int value,int indexX,int indexY,int indexZ, int [] 1dArray);
void get (int value,int indexX,int indexY,int indexZ, int [] 1dArray);
On 26th Feb, we were called for the interview on the next day. i.e 27th Feb.

There in we had to appear for the written test again of coding, consisting of 4 Q,s and followed by one tech interview and then HR interview. HR is just the formality.. All the candidates went through, all 3 rounds.

CODING Q,s in the 2nd written test.

1. A chessboard was given to us. Where in there was a Knight and King was placed on certain positions. Our aim is to reach the king from the knight in minimum no of counts.As we know, knight can either move 2 steps vertical/horizontal and 1 step horizontal/vertical. same goes here as well. Proper image of the chess board was given in the question paper, and all the positions(max 8) were given that knight can take in the first step. Sol : Most of us implemented using recursive func.

2. Struct person{
char * name;
person[] friends;
};

We were given the networklist of friends. Each has set of friends which was unidirectional i.e, if you are my frnd, then i may or may not be in ur frnds list. okie. Network was like this:

Amit - ->Rahul -> Aman -> kumar
Rahul- ->Vipin->Ankit->Reena->kumar
Kumar- ->Rahul->Reena->Tanmay

We need to identify whether 1st person being passed is a frnd of another person or not. Frnds can be frnd,s friend also and so on. And we need to identify the distance. for example

Input: Amit, Kumar
Output Distance 1
Input Amit, Tanmay
Output: Distance 2
Input: Rahul, Aman
Not frnds.

3) There was a 2D matrix given, we were supposed to sort the all diagnols elements. diagnols of Top left corner and Top right corner were to be sorted in the same matrix in an efficient way.

4. We need to write the function to check the password entered is correct or not based on the following conditions..
a) It must have atleast one lower case character and one digit.
b)It must not have any Upper case characters and any special characters
c) length should be b/w 5-12.
d) It should not have any same immediate patterns like
abcanan1 : not acceptable coz of an an pattern
abc11se: not acceptable, coz of pattern 11
123sd123 : acceptable, as not immediate pattern
adfasdsdf : not acceptable, as no digits
Aasdfasd12: not acceptable, as have uppercase character