Monday, June 30, 2008

Nagarro Interview of Swati Gaur

2 written papers:

1. 1 hr – 2 Sections (+ 2.5, -1)

Section 1: Mathematics + Quant (20 Questions)

Section 2: Aptitude (20 Questions)

2. 1:30 Hrs – 4 questions to code

It’s a checking of programming logic, n is not restricted to DS only…

Topics covered may be DS, Algo, working on bits…

Questions in our paper were:

1. Given a C++ program as input, u have to insert [[ and ]] b4 and after each data type…

You are given a function int CheckIfDataType (char* String) which returns 0 and 1 accordingly.e.g.

Input:

#include
void main()
{
int i = 10; //this is an int data type
char c = ‘a’;
cout<<”here we have used int data type”; } Output: #include
void main ()
{
[[int]] i = 10; //this is an int data type
[[char]] c = ‘a’;
cout<<”here we have used int data type”;
}

Note: here no change is made to the word “int” in double quotes and in comments…And also that there are two types of comments in C++.

The prototype of the required function is char* convert (char* string)

2. Given an n digit binary number, who have to return the count of the numbers which do not have consecutive 1’s. int CountTheBits (int n) E.g. given n = 3, ans is 5 Coz we have 000,001,010,011,100,101,110,111 for n=3.

3. Ques2 continued, but u are given another parameter c, which tells the number of consecutive 1’s who have to count Int CountTheBits (int n, intc) E.g. given n = 3, c=3, ans is 7 coz only 111 has 3 consecutive 1’s

4. Given a 2d array, u need to sort the 2 diagonals independently. And the elements in one diagonal should remain in that diagonal only. The elimination criteria was based on the I written paper and then after the interviews. There was no elimination based on the written coding part.


Technical Interview: (1:20 hrs)

1) All the coding questions were discussed. You have to tell the optimization in terms of time and space, and have to explain your code.

2) Compilers: what is linking?

Diff between static and dynamic linking?

Diff between static and dynamic loading?

3) VC++: how to make rounded buttons?

What do u know about message Loop and if there are more than one windows then how many message queues are required, n how is it sufficient?

(I wud recommend to mention VC++ in ur CV, only if u can handle questions on it.)

4) Virtual functions: how does a base class pointer, points to a derived class virtual function, he wants to have the internal working. He wanted to hear VPtr.

5) Difference b\w new and malloc. How can we call a constructor explicitly, after new gets executed? (its required to call dat constructor)


HR interview: (20 mins)

1. Tell me something abt urself.

2. Abt Ur family.

3. How will u manage going gurgaon daily, when Ur place is too far from there.

4. Would u like to stay in a pg , after joining the job?

5. In what language u wud like to wrk?

6. Do u want to ask nethin from us?


Technical Interview2: (20 mins)

1. Abstraction, encapsulation

2. Which is the best sorting algorithm u wud like to use? I told all, and then told the best among them.

3. Which is your favorite project done so far. Explain that. I explained FSCK n FAT.

4. WAP to print foll. In single loop:

1
1 2 1
1 2 3 2 1
1 2 3 4 3 2 1
so on...

5. Write a Class on Stapler.

I remember only this much. Rest if I remember anything else, I will tell.

No comments:

Post a Comment