Western Digital Embedded Testing Engineer Interview Questions and Answers for Experienced

Q1. Core Java and Spring boot questions
Add your answer
Q2. Hibernate, Spring, Junit, Mockito and Micro service questions
Add your answer
Q3. Difference between String and StringBuffer
Ans. 
String is immutable while StringBuffer is mutable.
• StringBuffer is faster for concatenation operations.

• StringBuffer has methods to modify the string.

• StringBuffer is thread-safe while String is not.

• StringBuffer has a larger memory footprint than String.
Answered by AI
Add your answer

Q1. Internal Structure of hashmap and hashing algorithm
Ans. 
Explanation of internal structure of hashmap and hashing algorithm
• Hashmap is a data structure that stores key-value pairs using a hash function

• Hashing algorithm converts the key into an index in the array

• Collisions can occur when two keys map to the same index

• Chaining and open addressing are two methods to handle collisions

• Load factor determines when to resize the hashmap
Answered by AI
Add your answer
Q2. Difference between predicate and supplier
Ans. 
Predicate is a functional interface that takes an argument and returns a boolean value. Supplier is a functional interface that takes no argument and returns a value.
• Predicate is used for filtering or testing a condition on an object.

• Supplier is used for providing a value or generating a value.

• Predicate takes an argument and returns a boolean value based on the condition.

• Supplier takes no argument and returns a value.

• E...read more
Answered by AI
Add your answer

Graph algorithm questions

Q1. Networking graph sql
Add your answer

It was 1 coding question with 10 test cases. They asked a question based on binary search. I got 3 hrs to clear that test. I went in as a campus fresher. For lateral joinees, it is a much more difficult question that you have to clear in 4hrs.

Q1. What's the best way to find majority element in an array?
Ans. 
The best way to find the majority element in an array is by using the Boyer-Moore Voting Algorithm.
• Initialize a candidate variable and a count variable.

• Iterate through the array and for each element:

• - If the count is 0, set the current element as the candidate.

• - If the current element is the same as the candidate, increment the count.

• - Otherwise, decrement the count.

• After the iteration, the candidate will be the ...read more
Answered by AI
Add your answer
Q2. Reverse a linked list in K groups.
Ans. 
Reverse a linked list in K groups
• Iterate through the linked list in groups of size K

• Reverse each group of nodes using a temporary pointer

• Connect the reversed groups to form the final reversed linked list
Answered by AI
Add your answer