Microsoft Interview experience | Set 106

1. Phone Interview

• Tell me about yourself
• Questions related to kernels(difference between linux OS/kernel and windows OS/kernel)
• Difference between Process and thread

// 32 bit architecture
bool isPowerOftwo(int no)
{
    int i = 1;
    int state = 0;
    int k = 0;

    for (int j = 0; j<32; j++)
    {
        if (state == 0)
        {
            k = no & i;
            if (k != 0)
                state = 1;
        }
        else
        {
            k = no & i;
            if (k != 0)
                return false;
        }

        i = i << 1;
    }

    return true;

}

bool isPowerOfTwo(int no)
{

    if (no == 0)
        return true; //this is wrong. it should be false

    if (no < 0)
        return false; // not supported

    if (no & (no-1) == 0)
        return true;

    return false;
}

2. F2F

• How many storage types are there in C.
• How many data types are there in C.
• Given a file with many strings. Find how many unique anagrams exists. (Hash table, BST and finally TRIE approach).
• How will you handle large data in a distributed way for the above question.
• How will you handle large data in one reducer.
• What are the properties of distributed systems.

3. F2F

• Implement map reduce program very similar to word count.
• How will you handle large data in one reducer.
• How will you distribute data across cluster and data centers.
• Internals of hadoop.(saving of intermediate files after map phase)

4. F2F

• Compress a string “aaabbcdddd” to “a3b2c1d4"
• What this program actually does internally

  void fun() {
  
  int a = 5;
  int * b = new int(10);
  
  }

• What is the effect of this program to multiple threads.
• Design distributed file system.

5. Leadership round

• Why you want to change?
• Discussions around azure business model, revenue model, details of job profile, etc.
• Given binary tree’s root and a node, find all the ancestors of the node.

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above