My experience of Nokia Siemens Networks Selction Process
placement paper and the interview process of NSN
        compiled by,
            Ashok Kumar S
            Chandra bhanu manoj
-----------------------------------
        
interview and written
      The selection process was on 22-9-2008.
Written:
        The selection process consisted of 3 rounds.Don't remember all questions. But, most of them were logical reasoning type like: All dogs are roses. Some roses are red. type. R.S. Aggarwal logical reasoning can be consulted. The technical parts consisted of some general CS questions and predict the o/p type of questions.

First roud was a written round
Then a technical interview:
then an HR interview

First round
The first round consisted of questions mostly based on logical reasoning. There was no questions involving calcluations.
technical question of written round had,
what are the diff. types of OS?
what are threads?

Tech interview
In the second round I was asked these questions
working of threads
Differentiate between Java and C++
what is a semaphore?
WAP to find the length of the string which is capable to accept a string of any length as input.
what is mutex?
Diff between Multithreading and singlethreading
deadlock and resolution techniques
Is a complied language better or a interpreted language?
what is parent process, child process and orphan process.
Working and Use of Java Virtual Machine(JVM).
make a class in c++ which accepts a string of indefinite length and calculate its length.
Which are your strong subjects in MCA?
Which subject you like more Computer Networks or Operating Systems?
Name the protocols used in every layer of the N/w protocol architecture stack.

HRInterview
Why do u want to join NSN?
Eg. of a standalone system in real world..
    
Tell me about yourself.
    
where are you placed? If yes, why do u want to leave that company 4 this one?
when you already have CTS, why NSN?hat are your hobbies?
Why have you scaored less marks in PUC?what have you done apart from your academics?
Why RVCE?do  you want to go 4 higher studies?
Brief your family background..
Why didnt you take up AIEEE or other competitive exams?
Have you organized any fests in your college?
      
 

   Aditi Technologies

Platform : mainly microsoft solution, j2EE.

Award : Best workplace to work in India (2008) and some others.

Revenue : 62M US$ in 2007,   21% compound annual growth in 3 years.  -------------------------------------------------------------

 Total 4 rounds.

1 written. 2 Puzzle/technical.1 HR

-------------------------------------

-------------------------------------

Written- 50 questions in 50 minutes.Not very easy but not difficult !. Objective, no negative marking.The questions are like in R.S.Agarwal:(34 questions ).

Pipe and cistern, Men and work, equation based questions, number series, allegation, interest, percentage, etc.. A passage is given and 6 questions based on that (Normal English paragraph). 10 C and C++ questions on it's basic. I think no sectional cutoff... (Not 100% sure).------------------------------------

------------------------------------------

 Next is puzzle/technical round.Shakuntala devi's puzzle book is better for these rounds. For this round you need to be good at puzzle solving, datastructure, operating system basics( like multiprocessing, semaphore, monitor). Questions to me:  There are 3 arrays with n elements given. 1) sorted in ascending order 2)descending 3)random.Which among the following is better to sort each array: Bubble, merge, quick, selection, insertion ? How many squares a chess board has?

I told : 64 to 'play'.

He : I want total squares.Ans: 1^2 + 2^2 +......+8^2 = (n(n+1)(2n+1))/6 = 204He : did you mugg it up?Me: No, since i play chess, i's interested in it.. Write pseudocode for chess program (don't worry, this was asked since I put palying chess as my hobby).I Wrote something for about 1.5 page ( This is brainstorming question , so don't say no but say i'll try and do..) In a set of (1.....n+1)  numbers only one number is duplicated.. Find it in 3 ways and write efficiencies..Me: Considering array is not sorted,1) Presort it. Now in 1 iteration find whether any consecutive numbers are repeated.. (like to find 'mode' which is in ADA book of Levitin).Efficiency : nlogn+n2)In bubble sort 'loop', check for duplicate .Efficiency : n^23)There are n+1 numbers. so 'n' numbers are unique. a <- Add all the numbers.b <- n(n+1)/2.(a-b) gives duplicate number.Efficiency : n What is efficiency of merge sort?Me: nlognHe: what is the base of log here? why?Me: 2 is the base. Because it's divide and conquer...i.e, divide by 2... etc( This is in Levitin's ADA or use master theorem)      (Understand the concept).             There are 25 horses, u have to find fastest horse. Only 2 horses are allowed to run at a time(this is called one Race).Find minimum no. of Races to find fastest(No timers allowed).Ans:Take 2 at a time, find faster. Now 1 looser is eliminated out of 25.Take the winner and race it with one among rest 23, and so on...Doing so, you will get at last winner by 24 races.. (check it).  He: Anything i left out to ask ?Me: Yes, operating system (since I was good at OS, how can I leave that?).He: what is multiprocessing, multiprogramming, semaphore, monitor, deadlock; Is server hardware or software?I Answered. (Galwin book) Some others were asked about sql, network basics too.--------------------------------------------

------------------------------------------------

 Next is similar round as previous, They called as HM round.

He: There is one lizard and one spider in 2 diagonally opposite corners of a room( or a box). Find minimum distance by which lizard can catch spider.It can not fly (Obviously).Ans:   It is not just sum of a diagonal of a side and length of other side.            Unfold the box and see... 

He: Find missing number in a consecutive million number set.Ans: Similar to duplicate number question of last interview.... He gave two swappings..a=a+b;           |      a=a*b;b=a-b;           |            b=a/b;a=a-b;           |      a=a/b:which is best? Give 3 reasons..Ans:        First one...Reasons:1. Multiplication is addition many times, it takes time.2. The a*b might overflow integer capacity.3. If b=0, then a/b is..... (Info:  Other swappings are:c=a,a=b,b=c;a=a^b; b=a^b;a=a^b;  (or    a^=b^=a^=b;)b= a-b+(a=b);) He: Tell about Aditi. Me: Usual answers. He: Any questions?Me: What languages should i study in this one year to work in aditi? (This depends on you... Ask your questions).He :  Be good in basics and reasoning. We will train you then.. ---------------------------------

----------------------------------------

HR round.. She: Tell me about yourself, about family, hobbies? Qualities of good chess player? When are you frustrated? what did you do to tackle that? She asked about 3rd sem project. How much do you rate yourself in java?Why do you want aditi when you have other company in hand? ( I was into cts at that time).

Ans: CTS is good company in service sector. I always dreamt about product based company. 

(Golden rule heard from others : Never blame other companies or colleges) . ------------------------------------

--------------------------------------

---------------------------------------

Other questions asked:

 A temple has 3 gateways which lead you into the temple, and at the end of each gateway there is an idol and as a devotee passes through the gateway with some flowers the number of flowers 'double'. Ram enters the 1st gateway with some flowers and he puts same number of flowers at each idol and the end he is left with none.What is the no. of flowers he previously had and and how much he puts at each idol?

Ans:  I---I----I----> Let x be initial flowers, y be flowers offered to idol.2(2(2x-y)-y)-y=08x-7y=0x=7y/8So minimum of x is 7 when y=8.  

A pond has a property of doubling flowers in it at each second.

If you put 1 flower, after 60 seconds pond will be full.

If I put 2 flowers at begining what is the time to fill the pond?

Ans : 59 seconds.Because, In first case at each second: 1,2,4,8,16,32,...........In second case : 2,4,8,16,32,...  

4 people have to cross a river with a boat of capacity 2. They can sail with 10 second,  1 sec, 4sec, 3 sec respectively. When two persons sail at a time, the time taken will be the higher of two. So minimum time taken by them to cross the river?

Ans:     

(10,1)-------------->      10  

(1)<----------- 1      

(1,3)---------------->       3      

(1)<----------------       1      

(1,4)------------------>           4 

Total = 10+1+3+1+4=19 second   

What are last 2 digits of 7^146..

Ans:  (Might be)    7^1=7       7^2=49      7^3=343     7^4=  2401        7^5= 168'07'  .

So iteration of 4 gives last digit 01..   126%4 = 2  

 i.e, 7^124= 01

 So, 7^126 = ..........49

How many zeroes are in 1000!

Ans:249. 

When we divide 1000 by 5 using factorization method, sum of quotients = 249.                                    5|1000      -0                                    5|200 -0                                    5|40  -0                                    5|8         -3                                    5|1                                                                           200+40+8+1=249.                                                                                                                                    There is a bulb inside a room and 3 switches are there outside the room. The light in room is not visible from outside. How will youfind the correponding switch for the bulb?

Ans: very simple. Switch on switch1 for 5 min. switch off it and switch on the second. Go to the room, If bulb is glowing then it's switch2, elsetouch the bulb. If it's hot then switch is switch1, otherwise switch3.Crazy old question right!!                         

Find factors of 1111......111 (91 times). 

Ans: 13    (might be ; not sure)                           // 91=13X7

      If I'm not wrong , this was there in 2nd PUC textbook.

      For these type of questions you need to know divisiblity principle from 1 -to 13 And modulus.

 ---------------

Regards.