Western Digital Interview Questions, Process, and Tips

Aptitude was 1 hr video monitered.
Standard level C/C++ questions like pointers, structures and constructors.
Other apti questions were easy.

Q1. What is structure padding and why it happens?
Ans. 
Structure padding is the insertion of unused bytes between members of a structure to align the data in memory.
• Padding is added to ensure that each member of the structure is aligned to a memory address that is a multiple of its size.

• Padding can be compiler-dependent and can vary based on the target architecture.

• Padding can affect the size of the structure and the performance of the program.

• Example: struct MyStruct { ch...read more
Answered by AI
Add your answer
Q2. Questions on bit manipulation and other questions were puzzle based question that can be found in geeksforgeeks archive.
Add your answer
Q3. Code for fibonacci series
Ans. 
Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones.
• Declare variables for first, second and next numbers

• Initialize first and second numbers as 0 and 1 respectively

• Loop through the desired number of terms and calculate the next number as the sum of the previous two

• Store the result in an array

• Return the array
Answered by AI
Add your answer

Q1. Indepth questions on memory management like how stack is maintained, questions on heap memory and ways to optimise it.
Add your answer
Q2. Output based questions where interviewer shared his screen.
Add your answer
Q3. Again indepth questions on C. so keep your C theory strong
Add your answer
Q4. In DSA part, 1. Code for merge sort 2. Check if two trees are mirror 3. Find element in rotated sorted array 4. Check if linked list is palindrome 5. Detect a loop in linked list 6. Remove loop in linked list
Ans. 
List of DSA questions including merge sort, tree mirror check, rotated sorted array search, linked list palindrome and loop detection and removal.
• Merge sort is a divide and conquer algorithm that sorts an array in O(nlogn) time complexity.

• To check if two trees are mirror, we need to compare their left and right subtrees recursively.

• To find an element in a rotated sorted array, we can use binary search algorithm.

• To chec...read more
Answered by AI
Add your answer

Q1. Easy to medium questions on electronics and communication like gaussian noise, filters, and subjects like DSP
Add your answer
Q2. Easy to medium puzzle questions from geeksforgeeks
Add your answer

Q1. Standard HR questions, how are you? introduce your self etc
Add your answer
Q2. Situation based questions where you have to incorporate companies policies while answering. To those who dont know western digital principles are: Think big, make it happen, work it together.
Add your answer