1st Round : Basic aptitude questions(calendar,work & time,speed,distance,SI,CI etc). 2nd Round : 2 programming questions(1st -->A string of number is given and you have to find minimum sum after putting + sign in between the two numbers which you got after dividing the string in two parts, 2nd -->program to count minimum no. of steps to convert an array consisting 0 at each index to a given array i.e. a[]={0,0,0,0,0} to b[]={2,5,9,1,0} ,you can use only 2 functions i.e. 1)either use addOne() function to add 1 to particular index . 2).double() function which multiplies each index value by 2) Hint: use geeks for geeks. 3rd Round: Two interviewer are there.My interview was like. Questions on Binary tree(program to check whether 2 BST are equal or not ,tree traversal etc.),program to print first three small numbers from an array,program to print the first smallest alphabet which is not repeated in a given string.Lastly some logical puzzles like ,you have 5 & 3 Litres of jug and you have to measure 4 litres by using 9.5Litres of water available in an unknown capacity. Another puzzle like write a program to climb stairs(Having N steps to cover) within a given number of steps(let it be M) and you can take certain number of steps together (let is be P). 4th Round: Simple introduction ,your family members info she will ask ,then policies ,package,bond etc.

They asked about Java and data statures and dbms 1)what’s is oops 2)difference between selection sort and insertion sort 3)difference between big(0) and big omega 4)what is time complexity 5)how the selection sort will perform