Infineon Technologies Senior Specialist Interview Questions and Answers

Easy questions were there in round 10 . . . . . . .

Q1. Easy questions. . . . . . . . .
Add your answer
Q2. Everything from fundamentals.....
Add your answer

Q1. Questions about memory segments and compiler optimisations
Add your answer
Q2. Question about controller architecture
Add your answer

Q1. Question about memory allocation of variables from a code snippet
Add your answer

Q1. Working of docker
Ans. 
Docker is a platform for developing, shipping, and running applications using containerization.
• Docker allows applications to be packaged into containers, which include all dependencies needed to run.

• Containers are lightweight, portable, and isolated environments that can run on any system with Docker installed.

• Docker uses a client-server architecture with a daemon process managing containers.

• Docker images are used to c...read more
Answered by AI
Add your answer
Q2. Shell scripting
Add your answer

Q1. Write a shell script based on different different scenarios
Ans. 
Shell script to handle different scenarios
• Use conditional statements like if-else to handle different scenarios

• Utilize loops for repetitive tasks

• Implement error handling to address unexpected situations
Answered by AI
Add your answer
Q2. K8s architecture
Add your answer

1. Reverse a singly linked list
2. Kadane Algorithm

Q1. Asked about my previous company and projects I worked on. In depth discussion on my resume. Questions on OS fundamentals.
Add your answer

Q1. In depth discussion on the projects I previously worked on. Write code to explain race condition in OS. Few puzzles and numerical were given to test my analytical skills.
Add your answer

Q1. Final Round with Senior Manager, testing me on all parameters aptitude, tech stack, past experience and interest in the role.
Add your answer

Reverse the string in place I/P : "I love my India" O/P: "I evol ym aidnI"

Q1. Questions about DDR, Memory layout of program, What is L1, L2 cache? how is memory virtualization is been done?
Add your answer

Leetcode questions followed by technical subjects

Practice on hackerrank, they send hackerrank link for screening round.

Q1. C, os, embedded questions
Add your answer

Q1. C, data structures,os
Add your answer

Q1. Previous jobs, salary discussion, relocation
Add your answer

Q1. Find the length of longest common subsequence in given strings.
Ans. 
The length of the longest common subsequence in given strings is found using dynamic programming.
• Use dynamic programming to find the length of the longest common subsequence.

• Compare characters of the strings and build a matrix to store the lengths of common subsequences.

• Traverse the matrix to find the length of the longest common subsequence.
Answered by AI
Add your answer
Q2. A basic DFS based graph question.
Add your answer

Write the algorithm for topological sorting.

Q1. Basic system design questions.
Add your answer
Q2. Explain CAP theorem.
Ans. 
CAP theorem states that in a distributed system, it is impossible to simultaneously guarantee consistency, availability, and partition tolerance.
• Consistency: All nodes in the system have the same data at the same time.

• Availability: Every request gets a response, even if some nodes are down.

• Partition Tolerance: The system continues to operate despite network partitions.

• In a distributed system, you can only achieve two o...read more
Answered by AI
Add your answer

Q1. Explain your previous projects .
Add your answer