Hi, I was interviewed for a Software Engineer role at Juniper Networks, Bangalore.

My Profile: 3.5 years of experience in Java, J2EE, Struts, and 4 months of experience in ExtJs.

I was called by the company HR because she found my resume on the job portal. Initially, they had set up a telephonic round with a Senior Engineering Manager, and below are a few questions I faced.

1. Explain the Data Structure Model. Why did it evolve?
2. Explain Tree.
3. Traversal of Tree Structure. He asked for an in-order traversal of nodes and an example.
4. Write the complete code implementation of the In-order traversal. (Though I explained the pseudo-code, he insisted on the complete code in Java. I was not completely efficient in writing it down and conveying the entire thing on the phone). I explained the recursive algorithm for this.
5. Next came the Puzzles and Problem-solving questions. a. Find the repeating element in a given array and the number of times it is repeated. I gave a good answer (use a hashmap and count the value for the key) for this question, but again he wanted complete code for this explained on the phone. b. 10 bags of gold coins, where 1 bag has defective ones. Find the odd ones using the balance machine only once. (I did not give a good answer here) c. Some question on a double matrix (don't remember it). d. Prove that the number between a prime pair is always divisible by 6. (I did not even give an approach for this)

Overall, it was a good experience. No questions were asked related to the Java language or concepts.

Prepare well for puzzles, data structures, and algorithms, and you can do well in it.

Best of luck, Punith

Explain the Data Structure Model. Why did it evolve?

Explain Tree.

Traversal of Tree Structure. He asked some in-order traversal of nodes and an example.

Write the complete code implementation of the In-order traversal.

Find the repeating element in a given array and the number of times it is repeated. I did give a good answer (use hashmap and counter the value for key).

10 bags of gold coins, where 1 bag has a defective one. Find the odd one using the balance machine only once.

Prove that the number between a prime pair is always divisible by 6.