9/11/13

Nagarro Placement Papers.. - Tech-Giant: Jargons for .Net professionals

Tech-Giant: Jargons for .Net professionals

H O ME

H O W -T O -G U IDES

W IN DO W S

Home

Search here....
A BOUT T HE A UT HOR

Nagarro Placement Papers..

Ques.1 :- Seat Reserv ation prog for the theatre. Write a function for seat allocation for the mov ie tickets. Total no of seats av ailable 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 av ailable , 1 would represent seat is reserv ed. 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 av ailable, then print all the seat nos like "B2" i.e (2 row, 3 col) otherwise Print "Seats are not av ailable." and we must book consecutiv e seats only . Ques.2 :- A string of charaters were giv en. Find the highest occurance of a character and display that character. eg.: INPUT: AEGBCNAV NEETGUPTAEDAGPE OUTPUT: E Ques.3 :- Int Matrix of certain size was giv en, We had few v alues in it like this. 1 4 5 45 3354 34 3 3 1 2 3343 33 443 We were supposed to mov e back all the spaces in it at the end. Note: If implemented this prog using recursion, would get higher preference.

SAURABH SINGH

I am Saurabh .working as a Analyst.in Barclays capital.I have done my masters from Jawaharlal Nehru University,New Delhi . I have a keen interest in technical stuff..and @ free time i do some freelancer projects and do googling to explore things . My passions are boxing,food,Programming and travelling to new n natural places.
V i ew my c ompl ete pr ofi l e

LA BE LS
.N E T A RC H I T E C H T U RE (8 ) E N J O Y ..C O D I N G (1 ) C # (3 )

H A P P Y T O C O D E (1 )

BLOG A R C HIV E 2013 (10) 2012 (1) 2010 (22) 2009 (110) December (8) November (1) October (14) September (17) August (31)

Ques.4 :- write a function to giv e demostrate the functionality of 3D matrix in 1 D matirx . function prototy pe :v oid set (int v alue,int index X,int index Y ,int index Z, int [] 1dArray ); v oid get (int v alue,int index X,int index Y ,int index Z, int [] 1dArray ); Ques.5 :- A chessboard was giv en 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 mov e 2 steps v ertical/horizontal and 1 step horizontal/v ertical. same goes here as well. Proper image of the chess board was giv en in the question paper, and all the positions(max 8) were giv en that knight can take in the first step. Sol : I'v e implemented using recursiv e func.I was appreciated by the interv iewer.They will ask for the dry run becz there was 8 recursions.So Be prepare. Ques.6 :Struct person { char * name; person[] friends; }; We were giv en the networklist of friends. Each has set of friends which was unidirectional i.e, if y ou are my frnd, then i may or may not be in ur frnds list. okie. Network was like this: Amit - ->Rahul -> Aman -> kumar Rahul- ->V ipin->Ankit->Reena->kumar Kumar- ->Rahul->Reena->Tanmay We need to identify whether 1 st 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 ex am ple :-

July (24) April (15) Apr 10 (3) Apr 07 (9) Nagarro Placement Papers.. C Aptitude Questions... C code to Check the string has valid identifier or... Code for matrix problem in C++ Implementation of a queue in C++ A linked list program in C++ OOPS Concepts.. OOPS Concepts... 1. What is virtual constructors/destructors? Virt... Apr 06 (3)

tech-giant.blogspot.in/2009/04/nagarro-placement-papers.html

1/6

9/11/13
Input: Amit, Kumar Output Distance 1 Input Amit, Tanmay Output: Distance 2 Input: Rahul, Aman Not frnds.

Nagarro Placement Papers.. - Tech-Giant: Jargons for .Net professionals

Ques.7 :- There was a 2D matrix giv en, 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 . Ques.8 :- We need to write the function to check the password entered is correct or not based on the following conditions.. a) It must hav e atleast one lower case character and one digit. b)It must not hav e any Upper case characters and any special characters c) length should be b/w 5-1 2. d) It should not hav e any same immediate patterns like abcanan1 : not acceptable coz of an an pattern abc1 1 se: not acceptable, coz of pattern 1 1 1 23sd1 23 : acceptable, as not immediate pattern adfasdsdf : not acceptable, as no digits Aasdfasd1 2: not acceptable, as hav e uppercase character Ques.9 :- 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) Ques:10 :- Counting in Lojban, an artificial language dev eloped ov er the last fourty y ears, 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 Ex amle 1 23 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. Ques.11 :- Where now stands that small knot of v illages known as the Endians, a mighty forest once stood.Indeed, legand has it that y ou could hav e 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 . Like:-A tree was only v isible if there were no higher trees before it in the row. For ex ample, if the heights were 3241 65, the only v isible trees would hav e been those of height 3,4 &6. Ques:12 :- Giv en an array containing k nos in the range 1 ..n and another scratch array of size n. Write an program to remov e the duplicates from the array . Written T est Pattern:-The written ex am consisted of 25 general maths questions on trigonometry , circles, area, perimeter,mensuration, time, work, distance etc ques. and aptitude consisted of 1 0 ques with sev eral parts. they wer twisty ques including the puzzle test ques giv en in R.S.Aggarwal v erbal-nonv erbal book.... The second written ex am included 4 coding ques which wer to be written in any programming languages .It was something like this: Instructions: 1 .The code should emphasize on min time and then min memory requirements. 2.The time limit was 1 hr 30min. Ques1: Giv en an array containing k nos in the range 1 ..n and another scratch array of size n. Write an program to remov e the duplicates from the array .

Blogger | Coder | Writer

copyright @ TechGiant 2010. Powered by Blogger.

My Skills
1. C# 2. WPF 3. WCF 4. Threading 5. OOPS 6. ASP.Net 7. WinForms 8. XML/XSLT 9. Ajax 10. LINQ 11. Design Patterns

Recent Posts

Disclaimer
This is my personal blog and i write articles on .Net, WPF, C#, OOPS, Threading and other .Net technologies. This is not related to any of my employer and organizations. This is the result of my personal interest.

Labels
.Net Architechture (8) C# (3) Enjoy..coding (1) Happy to code (1)

Home About Me

Subscribe To
Posts Comments

About Me
This is Saurabh Singh a Microsoft certified developer for C# and windows platform having 4+ years of experience in Microsoft .Net Technology.

tech-giant.blogspot.in/2009/04/nagarro-placement-papers.html

2/6

9/11/13

Nagarro Placement Papers.. - Tech-Giant: Jargons for .Net professionals

I had completed my B.Sc(Maths) from Kanpur

Ques2: Giv en a table of the form: Product Sold on A 1 /1 /1 980 B 1 /1 /1 980 C 1 /1 /1 980 A 1 /1 /1 980 B 1 /1 /1 980 C 2/1 /1 980 A 2/1 /1 980 There are 30 products and 1 0,000 records of such ty pe. Also the month period during which sales happened is giv en to u. Write the program to display the result as: Product Month No. of copies A January 1 2 A February 1 5 A March 27 B January 54 B February 1 5 B March 1 0 C January 37

University and MCA from Jawaharlal Nehru University, New Delhi. I started my career on windows application with Microsoft .Net framework 2.0 and then Asp.Net and currently exploring WPF and WCF. Currently i am working as Analyst in Barclays. Please feel free to contact me for any queries through my email and on mobile. Email: saurabhjnumca@gmail.com Mobile: +91-9561329444

Followers
Join this site
w ith Google Friend Connect

Members (1)

Ques3: Definition of prio rity queue was giv en. We hav e to implement the priority queue using array of pointers with the priorities giv en in the range 1 ..n. The array could be accessed using the v ariable top. The list corresponding to the array elements contains the items hav ing the priority as the array index . Adding an item would require changing the v alue of top if it has higher priority than top. Ex tracting an item would require deleting the first element from the corresponding queue. The following class was giv en: class Priority Queue { int *Data[1 00]; int top; public: v oid put(int item, int priority ); // inserts the item with the giv en priority . int get(int priority ); // ex tract the element with the giv en 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.

Already a member? Sign in

Ques4: An array of size 5X5 is giv en 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 nex t element i+1 can be inserted only at the mentioned positions (u,v ), and if these all positions are occupied then it returns giv ing a count of how many positions hav e been occupied in the array : (u,v ) = (x +/-3 , y ) (u,v ) = (x , y +/-3) (u,v ) = (x +/-2 , y +/-2). Ex ample: if the starting element is 1 with the giv en positions (1 ,2), then nex t 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 giv e the start and end coordinate of first element i.e.

Ques.5 :- suppose u r giv en a 4*3 rectangle like (take these v alues from user) Now u hav e to calculate the no. of squares in this rectangle like: No. of squares of dimension 1 is 1 2 No. of squares of dimension 2 is 6 No. of squares of dimension 3 is 2 No. of squares of dimension 4 is 0 Total no. of squares are 20. b) Suppose y ou are giv en a string. y ou hav e to find the occurance of the characters A-Z in that string.Each character must appear in the string and must appear only once. If It that occurs in string more than one time return 1 showing it is a perfect string otherwise return 0 showing it is not a perfect string.

tech-giant.blogspot.in/2009/04/nagarro-placement-papers.html

3/6

9/11/13

Nagarro Placement Papers.. - Tech-Giant: Jargons for .Net professionals

c) Suppose y ou arr giv en 1 0000 marks. y ou hav e to pick up top 20 top marks from them and display it on the screen.(Use the optimal sorting algorithm) d) Suppose y ou hav e a chess board. y ou hav e to insert 8 queens on the chessboard in the sty le that the queens dont intersect in the diagonals, columns and rows. If they intersect return 1 else return 0.(that is no more than one queen should be present either in row or column or diagonals.) If the queen is inserted at a position in the chessboard, its count is 1 . T hen the nex t round was technical interv iew. T he interv iewer was v ery cool and friendly . He just asked som e general questions and then u hav e to justify the code that u hav e written in the test line by line. If he is satisfied from ur code then HR interv iew is only a form ality . Ques.1 :- A Class Structure was giv en with function names only . Using one dimensional array make the fuctionality of two dimensional array ? We hav e to write the function body and the main program which calls them. the function attributes and return ty pe was giv en. some already defined v ariables were also there. Ques.2 :- If employ ee 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 employ ee name is Asked to Display it also display his bosses with his name. For eg. If C is display ed it should also display D and E with C? Ques.3 :- Arrange Doubly linked list in the ascending order of its integral v alue and replace integer 5 with 7 ? Ques.4 :- Three tables were giv en and we had to link them.

Ques.5 :- Y ou hav e giv en a string containing a binary number and y ou hav e to calculate the decimal number from it. Ques.6 :- It was the password v alidation question mentioned abov e. Ques.7 :- Y ou hav e giv en two list of names containing name first list is v ery large and second one is v ery small, Now y ou hav e to conclude whether names appers in the second list are in same order as in the frist or not. Ex am ple : First: Ram, Mohan, Babu, Shy am, Komal, Rani, Sita Second: Mohan, Komal, Sita. Ans : y es. Questions Asked on 31 May 2008: Ques.1 :- Subset sum problem.
Tw eet 0

You may also like:

{ 9 comments... r ead them below or add one }

saurabh Singh said... Hii..If anyone need any type of help then he or she can contact me at saurabhjnumca@gmail.com and if you will do all the programs in an efficient way then you will crack the exam.
September 24, 2009 at 11:02 PM

Anonymous said... gud afternoon sir, i hv cleared 1st round for Negarro campus recruitment. Now , what should i prepare for cracking next rounds..please suggest..
October 20, 2011 at 1:16 AM

Anonymous said... please post answrs

November 6, 2011 at 4:11 AM

tech-giant.blogspot.in/2009/04/nagarro-placement-papers.html

4/6

9/11/13
Amit Srivastava said... Hello Sir

Nagarro Placement Papers.. - Tech-Giant: Jargons for .Net professionals

Please send me solution of all prog. of 2011 nagarro exam. in java/C++ asap
July 9, 2012 at 7:21 AM

RdNit$ said... plese send me the solutions of all the questions @ nitish22691@gmail.com i m having my exam in 3 days so please send me the solutions
July 15, 2012 at 8:27 PM

Indrasen Singh said... Hello Everyone can you please provide me the answers of some questions like 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.

write a function to give demostrate the functionality of 3D matrix in 1D matirx. function prototype :void set (int value,int indexX,int indexY,int indexZ, int [] 1dArray); void get (int value,int indexX,int indexY,int indexZ, int [] 1dArray);

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. 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 Please provide me the solutions..I have to appear for nagarro Written test on 26th August.
August 13, 2012 at 5:32 AM

Anonymous said... someone can tell me the latest selection procedure for Nagarro... plz tell me as soon as possible i.e. before 14 Dec. Thnx in adv.
December 8, 2012 at 12:44 AM

shikha singhal said... plzz send me the solution of above question at shikhasinghal735@gmail.com I have my paper on 17 feb 2013
February 12, 2013 at 7:54 AM

tech-giant.blogspot.in/2009/04/nagarro-placement-papers.html

5/6

9/11/13
Anonymous said...

Nagarro Placement Papers.. - Tech-Giant: Jargons for .Net professionals

plz send me the solution of above que at maniaghi.mani@gmail.com by today nlyy...pllzzzz
March 29, 2013 at 6:32 AM

Post a Comment
E n t e ry o u rc o m m e n t . . .

Comment as: Google Account Publish Preview

L inks to this post

Create a Link

N ewer Post

O lder Post

Follow

WINDOWS

FAQ

PRESS

TESTIMONIALS

CHANGELOG

SETUP

2013 All Rights Reserved Tech-Giant: Jargons for .Net professionals. Design by Kulvir Singh Distribution by KB Tricks

tech-giant.blogspot.in/2009/04/nagarro-placement-papers.html

6/6