Upload Button Icon Add office photos

Filter interviews by

Xilinx Software Engineer Interview Questions and Answers

Updated 28 Sep 2021

Xilinx Software Engineer Interview Experiences

1 interview found

I applied via Referral and was interviewed before Sep 2020. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. Basic c programming
  • Q2. Previous experience questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be honest. And prepare well in data structures

Interview questions from similar companies

I applied via Naukri.com and was interviewed in May 2020. There were 7 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Angular and JavaScript basic questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected
Round 1 - Technical 

(1 Question)

  • Q1. Reserve Binary Search Tree
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed in Sep 2023. There were 2 interview rounds.

Round 1 - Coding Test 

1 easy, 1 medium and 1 hard LC

Round 2 - Technical 

(1 Question)

  • Q1. 1. How will access files in a different server? 2. There are several files all containing similar key value pairs. The values differ in all files. How will you identify all the values that are same and ot...
  • Ans. 

    To access files in a different server, use protocols like FTP or SSH. To identify similar key value pairs in multiple files, compare values using a script or tool.

    • Use FTP or SSH protocols to access files in a different server

    • Write a script or use a tool to compare key value pairs in multiple files

    • Identify values that are the same and different across files

    • Example: Use Python script to read files and compare key value p

  • Answered by AI
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Jun 2023. There were 3 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Tell me about your Protect?
  • Q2. Questions on C++
Round 2 - Technical 

(2 Questions)

  • Q1. Day to day tasks
  • Ans. 

    Day to day tasks involve coding, debugging, testing, and collaborating with team members.

    • Writing code for new features or fixing bugs

    • Debugging and troubleshooting issues

    • Testing code to ensure quality and functionality

    • Collaborating with team members on projects

    • Participating in code reviews and providing feedback

  • Answered by AI
  • Q2. Team management questions
Round 3 - HR 

(2 Questions)

  • Q1. Salary negotiations
  • Q2. Bahaviour questions
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Major questions were around problem solving, strings

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Add two linked list
  • Ans. 

    To add two linked lists, iterate through both lists simultaneously and add corresponding nodes, considering carry from previous addition.

    • Create a dummy node to hold the result.

    • Initialize current node to dummy node.

    • Iterate through both lists, adding values and carry from previous addition.

    • Move to next nodes in both lists.

    • Handle cases where one list is longer than the other.

    • Handle final carry if present.

  • Answered by AI
  • Q2. Find shortest path in graph
  • Ans. 

    Use Dijkstra's algorithm to find the shortest path in a graph

    • Implement Dijkstra's algorithm to find the shortest path between two nodes in a graph

    • Maintain a priority queue to keep track of the shortest distance to each node

    • Update the shortest distance to each node as you traverse the graph

    • Track the path by storing the previous node for each node visited

  • Answered by AI
Round 2 - Technical 

(2 Questions)

  • Q1. Check tree is BST
  • Ans. 

    Check if a binary tree is a Binary Search Tree (BST)

    • Perform an in-order traversal of the tree and check if the resulting array is sorted

    • Keep track of the previous node value during traversal to compare with the current node value

    • Ensure that each node's value is greater than the previous node's value in the in-order traversal

  • Answered by AI
  • Q2. Check substring palindrome or not
  • Ans. 

    Check if a substring in an array of strings is a palindrome or not.

    • Iterate through each string in the array

    • For each string, check if any of its substrings are palindromes

    • Return true if a palindrome substring is found, false otherwise

  • Answered by AI

Skills evaluated in this interview

Interview experience
1
Bad
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed in Feb 2024. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Reverse linked list recursively
  • Ans. 

    Reverse a linked list recursively

    • Create a recursive function to reverse the linked list

    • Pass the current node and its next node as parameters

    • Update the next pointer of the current node to point to the previous node

  • Answered by AI
  • Q2. Check if two stacks are equal
  • Ans. 

    Check if two stacks are equal by comparing each element in the stacks

    • Pop elements from both stacks and compare them one by one

    • If the sizes of the stacks are different, they are not equal

    • If any element in the stacks is different, they are not equal

  • Answered by AI

Skills evaluated in this interview

I applied via LinkedIn and was interviewed in Nov 2021. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Hashmap working.
  • Ans. 

    Hashmap is a data structure that stores key-value pairs and allows constant time access to values.

    • Hashmap uses a hash function to map keys to indices in an array.

    • Collisions can occur when multiple keys map to the same index, which can be resolved using techniques like chaining or open addressing.

    • Hashmap operations like insertion, deletion, and lookup have an average time complexity of O(1).

  • Answered by AI
  • Q2. Problem solving. Minimum absolute difference pairs

Interview Preparation Tips

Interview preparation tips for other job seekers - There were two people one hiring manager and one person who asked technical.
This person was so rude.I hardly understood what he was speaking his accent was so bad.I don't understand how a standard company like Applied Materials even hired this person who is lacking at a basic level of Communication.

One should make the person comfortable before the interview to even get the best from the candidate.

First question in discussion was what is your salary expectations and what offer do u already have that's pathetic to ask this question in the beginning itself.

They don't pay well yet they expect the candidate to be perfect.
Worst interview experience I have ever had .
Please be nice to candidates.Have some standards for your hiring process don't be rude and arrogant.if you want to hire a potential candidate be nice to the person at the first place that's when you can check the knowledge and technical capabilites of a person not just simply ask same set of questions.

Skills evaluated in this interview

I applied via Company Website and was interviewed in Jan 2022. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Write your own stack?
  • Ans. 

    A stack is a linear data structure that follows the Last In First Out (LIFO) principle.

    • Implement using an array or linked list

    • Push operation adds element to top of stack

    • Pop operation removes element from top of stack

    • Peek operation returns top element without removing it

  • Answered by AI
  • Q2. How to find intersection happened between two linked list?
  • Ans. 

    To find intersection of two linked lists, traverse both lists and compare each node.

    • Traverse both linked lists and compare each node

    • Use two pointers, one for each linked list

    • If a node is common, return the node

    • If both pointers reach the end, return null

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Applied Materials Senior Software Engineer interview:
  • Data Structures
Interview preparation tips for other job seekers - Basic should be good, interview is easy to medium type only

Skills evaluated in this interview

Xilinx Interview FAQs

How to prepare for Xilinx Software Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Xilinx. The most common topics and skills that interviewers at Xilinx expect are C++, Xilinx, Python, Linux and Debugging.

Tell us how to improve this page.

Xilinx Software Engineer Salary
based on 25 salaries
₹5.6 L/yr - ₹20.5 L/yr
38% more than the average Software Engineer Salary in India
View more details

Xilinx Software Engineer Reviews and Ratings

based on 2 reviews

3.7/5

Rating in categories

2.5

Skill development

4.5

Work-life balance

5.0

Salary

4.7

Job security

4.5

Company culture

2.5

Promotions

2.5

Work satisfaction

Explore 2 Reviews and Ratings
Design Engineer
30 salaries
unlock blur

₹10.1 L/yr - ₹18 L/yr

Senior Software Engineer
28 salaries
unlock blur

₹9.7 L/yr - ₹42 L/yr

Software Engineer
25 salaries
unlock blur

₹5.6 L/yr - ₹20.5 L/yr

Product Application Engineer
16 salaries
unlock blur

₹4 L/yr - ₹15 L/yr

Senior Software Engineer 2
14 salaries
unlock blur

₹28.9 L/yr - ₹44 L/yr

Explore more salaries
Compare Xilinx with

Qualcomm

3.8
Compare

Intel

4.2
Compare

TDK India Private Limited

3.8
Compare

Molex

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview