Skip to content
Related Articles
Open in App
Not now

Related Articles

VMware Interview Experience for Developer | On-Campus

Improve Article
Save Article
  • Difficulty Level : Hard
  • Last Updated : 09 Oct, 2019
Improve Article
Save Article

VMware visited our campus in October. Around 70 students from our college registered for the VMware placement drive.

I went through 5 rounds:

  1. Online Round
  2. Technical Round 1
  3. Technical Round 2
  4. Managerial Round
  5. HR Round

Online Round:

This round was a shortlisting round for the interviews. It was conducted on the HirePro platform.

  1. Aptitude Section: This section consisted of 10 multiple choice questions, for 15 minutes. The questions were based on logical, quantitative and verbal abilities.
  2. Technical Section: This section comprised of 29 multiple choice questions, for 30 minutes. The questions were from core Computer Science subjects, including Data Structures, Algorithms, Operating Systems, Computer Networks, Object-Oriented Programming, and Database Management systems. A few questions also required the debugging of basic C programs.
  3. Coding Section: This section consisted of 1 question, for 30 minutes. Languages offered were C, C++, Java 7 and Java 8. Given two numbers, R and S, find the number of R digit numbers whose sum equals S,
  4. Languages Section: This section required us to solve 5 multiple choice questions each of any 2 languages from C, C++, Java, and Python, for 15 minutes. I chose Java and C. Java questions were predominantly OOP and collections-based. C questions were based on structs and pointers.

Within a couple of days, VMware came to our college for the pre-placement talk. Post the talk, results of the aptitude test were announced. 25 people made it to the interviews.

Technical Round 1:

The interviewer was pretty cool and started by asking me to introduce myself.

  1. He began by giving me a simple puzzle. Given a number n, find a number k such that k % j = j – 1 for j = 2 to n. For example, for n = 3, k = 5; for n = 4, k = 11. The solution is to find LCM of all numbers from 2 to n. He then asked me to write code for the same.
  2. He noticed I’d mentioned various SQL and NoSQL databases on my resume. He then questioned me about the CAP theorem. He gave me various databases and asked me which guarantee of the CAP theorem they provided. I was aware of this so I answered correctly.
  3. He asked me to model a database design for the College Placement system and what choice of database I would make. He asked me about database indexing, and the data structures used for it.
  4. I was asked to explain the balancing of B-trees. The discussion then moved to trees, and he asked me balancing procedures for Red-Black trees and AVL trees.
  5. Further, he questioned me about sorting algorithms. He asked me to compare mergesort and quicksort, on their advantages and disadvantages. He then asked me possible approaches to improve their time complexities.
  6. Next, he gave me a simple chemical reaction and asked me to balance it. He then asked me what data structures I would use and the approach I would take to solve this programmatically.

Overall, the interview was very interactive and interesting. He then asked me if I had any questions for him. I asked him about the projects he worked on and his overall experience. I was taken in for the next round immediately.

Technical Round 2:

The interviewer was very friendly. He asked me to introduce myself and then questioned me on my resume.

  1. I had a few Big Data projects on my resume. He asked me the need for Big Data. He then asked me to explain the entire working of a Map Reduce program. I chose Word Count as an example and explained the entire process.
  2. He asked me what sorting algorithm I would use in the shuffle-and-sort phase of Map Reduce. He then asked me to sort an array using merge sort by hand and model a Map-Reduce algorithm for merge sort.
  3. He then asked me to write code for merging two sorted linked lists. I wrote a simple iterative solution by creating a new linked list. He then asked me to optimize the space and also to write a recursive solution for the same.
  4. I had done a project on Web Crawlers. He asked me how a web crawler works and the discussion became project-specific.
  5. He then moved to networking and asked me to draw the OSI stack and explain the various layers.
  6. He asked me to list all protocols I knew for each of the layers. I was then required to explain HTTP and IP.
  7. Then, he moved to TCP and asked me how the sliding window protocol works. I was not aware of the details so he changed it to an analytical question and asked me to logically design a sliding window protocol of my own, giving me hints wherever required.

The interview was quite refreshing. The key was to be sure of every word you have on your resume. I was then called for the managerial round.

Managerial Round:

The interviewer was very crisp and to the point in his questions.

  1. He started by asking me to introduce myself and provide a family background.
  2. He then asked me about the various projects I had on my resume, and why I chose to do them.
  3. He questioned me about the failures I had faced in my life and how I dealt with them.
  4. Why VMware? Where do you see yourself in two years?
  5. He asked me about my future studies plans and how I would deal with team conflicts.

The interview lasted for half an hour and 4 people made it to the HR round.

A few people were asked to submit their resumes for further scrutiny, they would receive communication on their acceptance status later.

HR Round:

Basic HR questions, short interview of about 10 minutes:

  1. Introduction, family background
  2. Current offers that I was holding
  3. What do my friends think of me?
  4. What if I don’t get the offer?

After the HR round, 1 person was offered an Internship along with a Full-time offer at VMware and 3 people were offered only an Internship with a performance-based PPO.


My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!