1st round: HR interview (over phone). Basic questions on time management, priorities, college life, etc.

2nd round: Technical phone interview. Questions on C keywords (static, volatile, const, typedef). Questions on power optimization techniques. OS questions (deadlock, priority inversion, types of scheduling, etc.). A coding question: Write a function that counts the number of set bits in an integer. Why is debugging memory leaks difficult? How is it done?

Onsite: 6 rounds of interviews (1 HR, 5 technical) for the whole day. Onsite questions follow.

A and B are 32-bit numbers. The first 16 bits are valid in A, and the next 16 bits are valid in B. (The non-valid bits aren't necessarily 0.) Write a program that adds A and B without using arithmetic operators.

What are the different power optimization techniques used in a processor/chipset? Discuss limitations and challenges in power debugging.

Write a program to count the number of set bits where the number of iterations must be less than or equal to the number of bits in the number.

1. Write a program to count the number of set bits where the number of iterations must be equal to the number of set bits, irrespective of the total number of bits. Now make this number of iterations 1/8th.

2. Write a program for the ceiling function of two numbers. For example, Ceiling(5/3) should return 3.

3. Write a program to store the integer 11 at the memory location 0x013DAFF2.

4. Write a macro called MAX that returns max(a, b).