Applications Engineer was asked...30 April 2015

↳

Nop Not yet.. Still waiting.. Good luck for you alex.. Let me know if in case you get any response.. Less

↳

I had applied for the position which was posted for munich but during the Interview I was told that the training will be in the UK irrespective of the location you apply for. Less

↳

Ok Guys, I have got a feedback from Altera. They have invited me for a personal Interview to the UK. I think Munich was not feasible for them. I hope you all have got a response too.. Less

Applications Engineer was asked...19 March 2009

↳

I forgot to mention that you have to try to figure out the floor in the least amount of tries. so incase the minimum floor is 100, you shouldn't try all the floors. The solution posted above works, but is the least efficient. Less

↳

With 2 bulbs we can skip 3 floors at a time. 1) Drop bulb #1 at floor x 2) If it breaks then try floor x-1 else try floor x+3 Start with floor 1. Less

↳

The issue with a research-based answer is that parameters of the posed problem is not based in reality, i.e. dropping a light bulb from any floor would almost guarantee it breaking in real life. So the interviewer is really looking for problem solving skills for an hypothetical situation rather your attention to detail in a real world situation. Less

Applications Developer was asked...28 May 2015

↳

I wont give the answer. Hint : know who divides you ;-)

↳

I think 2520 is perfect

↳

Answer is pretty simple: m%10=0 -----case 1 Lets assume n=m-1 Since the remainder is always same , when n is divider by any number from 10 to 1.. n%10 = n%9=.........=1 That means n+1 is completely divisible by all numbers from 10 to 1.. (Since it gives common remainder).. n + 1= Lcm of (1 to 10) = 2520 But we assumed n = m-1, so m -1+1 =m = 2520 Less

Applications Developer was asked...26 February 2016

↳

Hey, did you hear back from them about the final decision? Also, were u coding in Java or Python? If python, why did they ask you questions on java? Could u share those questions because I have been invited too Less

↳

They ask you what language you feel most comfortable with and ask you questions based on that (I said Java). I haven't heard back but I have been contacted by another recruiter from their Manhattan office so maybe better luck on this second try. Good Luck! Less

↳

Thanks man, best wishes to you too.. Nail it this time

Applications Developer was asked...11 September 2011

↳

i got it to be in the 14 th century ...

↳

Sorry it should be 08-31-1380

↳

how can the month no. will be more than 12 i think the answer should be 29-11-1192 :) correct me if i am wrong..... Less

Applications Support Engineer was asked...12 March 2016

↳

How was the phone interview? you didn't have on-site interview?

↳

Phone interview was good. They asked the questions which are there on the blackboard and there a set of mathwork interview questions on scribd.com. You can also refer that Less

↳

can we choose any two language out of 5.?

Applications Developer was asked...11 July 2012

↳

public static void main(String[] args) { int occurrence = 0; Map m = new HashMap(); List nos = new LinkedList(); nos.add(1); nos.add(1); nos.add(2); nos.add(3); nos.add(4); nos.add(3); nos.add(2); nos.add(4); nos.add(5); nos.add(100); Set uniqueNos = new HashSet(nos); for(int temp:uniqueNos) { for(int tempList:nos) { if(temp == tempList) { occurrence++; } } m.put(temp, "Appears "+occurrence +" times"); occurrence = 0; } System.out.println(m); } Less

↳

import java.util.Scanner; public class Occurrence { public static void main(String[] args) { int n, count = 0, i = 0; Scanner s = new Scanner(System.in); System.out.print("Enter no. of elements you want in array:"); n = s.nextInt(); int a[] = new int[n]; int x[] = new int[n]; System.out.println("Enter all the elements:"); for(i = 0; i < n; i++) { a[i] = s.nextInt(); } System.out.print("Enter the element of which you want to count number of occurrences:"); for(i = 0; i < n; i++) { x[i] = a[i]; } for(i = 0; i < n; i++){ count = 0; for(int j = 0; j < n; j++) { if(a[j] == x[i]) { count++; } } System.out.println("Number of Occurrence of the Element:"+a[i]+"is"+count); } } } Less

↳

import java.util.HashMap; import java.util.Map; import java.util.Scanner; public class Test { public static void main(String[] args){ Map map = new HashMap(); Scanner s1 = new Scanner(System.in); int a[] = new int[10]; System.out.println("Please enter the 10 numbers"); for(int i=0;i<10;i++){ a[i]=s1.nextInt(); } for(int j=0;j<10;j++){ int count = 1; for(int k=0;k<10;k++){ if(j!=k){ if(a[j]==a[k]){ count++; } } } map.put(a[j],count); } for(Map.Entry m:map.entrySet()){ System.out.println("The value "+m.getKey()+" occurs "+m.getValue()+" times in the series which u have entered."); } } } Less

Senior Applications Developer was asked...14 February 2011

↳

I struggled with this a bit and got close. I believe answer is: 23:55

↳

The first pond started with 1 bacterium and doubled to 2 in five minutes. Therefore, the second pond will take 5 minutes less than the first to be full. ie: 23:55 Less

↳

This is a clear case of Geometric progression. Find the nth term Tn1 = a*r^(n-1). where n = (24 * 60)/5,a = 1 and r=2. when the initial value (a) = 2, the values become n = ?, a = 2 and r = 2. Since Tn1 = Tn2, Equate the RHS of both the equation. Since the base are equal, equate the powers, doing so will give the n value. When n is convert into minutes one get 23 hrs 55 minutes. Less

Financial Applications Engineer was asked...26 March 2012

↳

Is it 6/27? why is 9?

↳

From a 3x3x3 Cube you can make 27 1x1x1 cubes, Since one face of the cube is painted blue. once face of 9 1x1 cubes will be blue. hence the answer is 9/27 = 1/3 = 33% Less

↳

P= 1/3, or 33%

Applications Support Engineer was asked...9 February 2016

↳

Hi, How long did it take for them to get back with results of the first round?

↳

Hi, How long did it take for them to get back with results of the first round?

↳

Oh... it still says interview process for me... i gave the video round last week, I guess I'll have to wait some more time... thanks for the reply Less

test engineerapplications managerhardware engineerfront end developerproduct engineerelectrical engineerapplications developerapplications scientistjava developerfirmware engineerprocess engineervalidation engineer.net developerpython developersenior program managerfield service engineerpipeline engineerfresher for electronics and communication engineeric engineer