Process-oriented, insecure superiors
Process-oriented, insecure superiors
Good campus. Lots of activities. Free WP7 mobile phones.
Everybody tries to save their own self. Little blame game. Limited opportunity for mavericks and firefighters. 90% time wasted in meetings and writing emails to superiors so that they understand.
Add some spin to the machinery.
Was this helpful?
Microsoft Interview Questions
Microsoft Interview Experiences
Software Development Engineer
The interviewer was reasonably congenial, and since it was a phone interview, I did not know them. It was not very clear from the interviewer's side what kinds of answers they wanted. I could understand that they were in a hurry, and since it was a t
Software Development Engineer
6 Rounds of interview: 1st round: 15 MCQs of objective type. Got selected. 2nd round: Given a string of a binary number, convert it to a string of base 4. Then, given a linked list of 0s, 1s, and 2s, sort it. Got selected. 3rd round (On-site): Giv
Software Development Engineer
6 rounds of technical interview: 1st Round: * Remove duplicates in an unsorted linked list. Discussed projects, etc. 2nd Round: * Print the matrix helically. * Implement the circular queue using an array. 3rd Round: * Find whether there exists a p
Software Development Engineer
Hyderābād, Telangana, IndiaMarch 1, 2016The interviewer was reasonably congenial, and since it was a phone interview, I did not know them. It was not very clear from the interviewer's side what kinds of answers they wanted. I could understand that they were in a hurry, and since it was a t
Software Development Engineer
Hyderābād, Telangana, IndiaNovember 1, 20126 Rounds of interview: 1st round: 15 MCQs of objective type. Got selected. 2nd round: Given a string of a binary number, convert it to a string of base 4. Then, given a linked list of 0s, 1s, and 2s, sort it. Got selected. 3rd round (On-site): Giv
Software Development Engineer
Hyderābād, Telangana, IndiaJune 1, 20126 rounds of technical interview: 1st Round: * Remove duplicates in an unsorted linked list. Discussed projects, etc. 2nd Round: * Print the matrix helically. * Implement the circular queue using an array. 3rd Round: * Find whether there exists a p
