Tip 1 : Be confident about your projects and internships. Make sure that you know all the basics about them.
Tip 2 : Revise the basics of FEA and CFD. Also, revise data structure algorithms and their implementation on any programming language.
Tip 3 : Be sure about the kind of work you wanna choose in CAE (Development or Application)
Tip 1 : Only mention the projects and courses that are relevant.
Tip 2 : Make a focused resume not exceeding 2 pages. Don't mention unnecessary or irrelevant information.
Tip 3 : Emphasize more on projects, internship experiences, and lesser on courses.
The questions were based on the projects that I did during my B.tech. Basics were checked and questions related to theoretical as well as application parts were asked. Interviewers ensured that I would stay calm and they tried to make me comfortable by starting with general questions.
Three questions were asked: -
1. What was the problem statement?
2. Why did you choose such algorithms?
3. What was a new and unique approach?
Tip 1 : Don't try to show off.
Tip 2 : Just be clear with the basics of your projects.
This round was also taken in the evening time. It was taken by the CEO of the company and was again focused on the technical questions. He asked questions related to core algorithms and problem-solving approaches that I incorporated in my projects.
Step 1 : Identify the elements and nodes forming the mesh/triangulation
Step 2 : Calculate facet normals
Step 3 : Write the STL file
Step 4 : Perform Delaunay triangulation (existing libraries may be used)
Step 5 : Create or use an existing STL file viewer.
Step 6 : Develop a GUI (Optional)
Two questions were asked: -
1. What is PCA and how does it work?
2. What is an autoencoder?
Tip 1 : Prepare the basics of ML and linear algebra (if you have done projects in these domains)
Tip 2 : Don't try to show off. Speak only what you've actually done.
Tip 3 : Don't hurry take your time

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?