# Interview questions in Haifa, Israel

Intel Corporation Interviews in Haifa

www.intel.com / HQ: Santa Clara, CA

50 Interviews in Haifa (of 3,156)

## Interview Questions in Haifa

Implement x^y function in an imaginary proccessor who doesnt have +, /, * operators. change numbers to binary call a func - f(x , x , 1) f (int a , int b , int i) { while i <= y { b = calc a*b with && || of binary nums; i+= 2; iterate with a ,b , i+1 } return answer } not organized but thats the idea... without i+=1... the main idea is to iterate and do the sum mul with && // probably have some mistakes in what i wrote.. without i+=1... the main idea is to iterate and do the sum mul with && // probably have some mistakes in what i wrote.. |

the weekly staff meeting is a set one (the day and hour is set by management and can not be changed). as it happens on the same day you attend university classes. what would you do? |

They asked me, based on function int SQRT(int) build function float SQRT2(int) that will return square root with three digits after the point. |

nothing was really hard, but it was a long day and very tiring one. the questions in the interview was very "standard" |

what do you know about the people you are going to work with? |

Please write a "Bubble-sort" script. |

Given an integer array containing positive and negative numbers, how do you get the maximum sum of its sub-arrays? Continuous numbers form a sub-array of an array. For example, if the input array is {1, -2, 3, 10, -4, 7, 2, -5}, the sub-array with the maximum sum is {3, 10, -4, 7, 2} whose sum 18. |

none rally |

Most difficult is the Pilates Test. |

How works Laser? |

**1**–

**10**of

**204**Interview Questions