ANTOLIN Senior Product Engineer Interview Questions and Answers

Q1. Basic HR question (tell me about yourself and similar)
Add your answer

Q1. Technical questions related to field
Add your answer

Q1. Interview cum interaction with top management
Add your answer

Q1. Tell us about yourself.
Add your answer
Q2. Why do you want to work for our company?
Add your answer
Q3. What would you do if you'd find another person sitting at your desk, claming to be theirs, since they used that desk five years ago?
Add your answer

Aptitude test of general math with technical mcq of your core branch.

Q1. Was focusing mainly on ec core subjects
Add your answer

Q1. Asked all about cnc processes.
Add your answer

Q1. Programing questions
Add your answer
Q2. Aptitude Communication C programming Embedded Systems
Add your answer

Q1. Stability Learnability Cultural fit Team player skills Adaptability
Add your answer

Q1. Difference between structure and union?
Ans. 
Structure is a collection of variables of different data types while union is a collection of variables of same data type.
• Structure allocates memory for all its variables while union allocates memory for only one variable at a time.

• Structure is used when we want to store different types of data while union is used when we want to store only one type of data.

• Structure is accessed using dot operator while union is access...read more
Answered by AI
View 1 more answer
Q2. How to avoid dangling pointers?
Ans. 
Dangling pointers can be avoided by setting them to NULL after freeing the memory they point to.
• Always initialize pointers to NULL.

• Set pointers to NULL after freeing the memory they point to.

• Avoid accessing memory through a pointer after it has been freed.

• Use smart pointers or garbage collection to automate memory management.
Answered by AI
View 1 more answer
Q3. Write a program to print Fibonacci series using recursion
Ans. 
A program to print Fibonacci series using recursion.
• Define a recursive function that takes an integer n as input

• Base case: if n is 0 or 1, return n

• Recursive case: return the sum of the previous two Fibonacci numbers

• Call the recursive function with the desired number of terms and print the result
Answered by AI
View 2 more answers

Q1. What are your strengths in computer science?
Add your answer