Molex SAP MM Associate Interview Questions and Answers for Freshers

Aptitude, technical MCQs and c/c++ questions of medium type

Q1. 1. Given offset, find the indices of multi dimensional array 2. Bitwise operations coding 3. Structure padding 4. Code memory storage
Ans. 
Technical questions related to programming concepts and memory management.
• To find indices of a multi-dimensional array using offset, divide the offset by the size of each element and use the quotient as the index for the first dimension. Repeat this process for each dimension.

• Bitwise operations are used to manipulate individual bits in a binary number. Examples include AND, OR, XOR, and bit shifting.

• Structure padding i...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The Technical interview was held on Zoom and the interview lasts for 1 hour. All the questions were from the skills mentioned in the resume.
Firstly interviewer asked me to give a self-introduction, later asked for a brief explanation of the projects and way of working.
Later series of questions were related to academics.
 

Q1. Technical Questions
1. In detail about the OOPS concepts.
2. Inheritance types.
3. Explain static and dynamic memory allocation?
4. How to identify the head node in the Circular linked list?
5. What is join? Ex...read more
Add your answer
Q2. Add K Nodes
You are given a Singly Linked List of integers and an integer 'K'.
Your task is to modify the linked list by inserting a new node after every 'K' node in the linked list with ...read more
Ans. Naive approach
• We will iterate through the linked list and store the sum of the nodes in a variable 'CURR_SUM' (initialized as zero) and keep a check of the number of nodes traversed since the last insertion with a variable 'NODES_TRAVERSED' (also, initialized as zero).
• As we traverse the list, we add the value to the 'CURR_SUM' and increment the value of 'NODES_TRAVERSED'.
• When the value of 'NODES_TRAVERSED'becomes equal...read more
Answered by CodingNinjas
Add your answer
Q3. Nth Fibonacci Number
Nth term of Fibonacci series F(n), where F(n) is a function, is calculated using the following formula -
    F(n) = F(n-1) + F(n-2), 
    Where, F(1) = F(2) = 1
Provided N you have...read more
Ans. Recursive Approach
• In this approach, we use recursion and uses a basic condition that :
  • If ‘N’ is smaller than ‘1’(N<=1) we return ‘N’
  • Else we call the function again as ninjaJasoos(N-1) + ninjaJasoos(N-2).
• In this way, we reached our answer.
Space Complexity: O(n)Explanation:
O(N),  where ‘N’ is the given number.  
As recursion uses a stack of size ‘N’
Time Complexity: O(2^n)Explanation:
O(2^N), where ‘N’ i...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 50 minutes
Round difficulty - Easy

The interview was held on Zoom and the interview lasts for 50 minutes. 
 

1.Explain how did you evolve yourself in B Tech (1-1 semester to 4-1 semester).
 

2. What do you know about Micron Technology?
 

Lastly discussed the certifications and extra circular activities I have done.

Q1. Technical Questions
1. Explain how to find the distance between the points on the map in general terms?
2. Explain how a stack works?
3. What is normalisation? Briefly explain the normalisation types.
4. List...read more
Add your answer