Xilinx Senior Software Engineer Interview Questions and Answers

Duration: 1Hour 30 Minutes, 2 Coding Questions of Total 175 Marks. 1st Question has 75 marks and 2nd Question has 100 marks.

Q1. 1. Find the smallestMissingNumber in given array using Bitwise OR operation alone 2. Based on Array data Manipulation.
Ans. 
Using Bitwise OR operation to find the smallest missing number in an array.
• Iterate through the array and perform Bitwise OR operation with each element to set corresponding bit in a bitmask

• Iterate through the bitmask to find the first unset bit, which represents the smallest missing number

• Example: Array [0, 1, 3, 4, 6] would have a bitmask of 10101, smallest missing number is 2
Answered by AI
Add your answer
Q2. Q2: Customized Data Extraction From Given Dynamic Array & Perform Some Math Operations On the Extracted Data
Ans. 
Extract data from a dynamic array and perform mathematical operations on it.
• Identify the dynamic array structure, e.g., ['12', '15', '20'].

• Convert string elements to integers for mathematical operations.

• Perform operations like sum, average, or product on the extracted data.

• Example: For array ['2', '3', '5'], sum = 2 + 3 + 5 = 10.

• Use built-in functions like map() for conversion and reduce() for aggregation.
Answered by AI
Add your answer

Q1. Write a Pseudo code for given scenario?
Ans. 
Pseudo code for a scenario
• Define variables and data structures needed

• Write the main logic using conditional statements and loops

• Handle edge cases and error conditions

• Test the pseudo code with sample inputs
Answered by AI
Add your answer

Q1. System Design & Design Pattern based questions
Add your answer

Q1. Not Applicable (Yet to be scheduled)
Add your answer

1 easy, 1 medium and 1 hard LC

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...read more
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...read more
Answered by AI
Add your answer

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
Add your answer
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
Add your answer

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
Add your answer
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
Add your answer

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
Add your answer
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
Add your answer

Q1. Tell me about your Protect?
Add your answer
Q2. Questions on C++
Add your answer

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
Add your answer
Q2. Team management questions
Add your answer

Q1. Salary negotiations
Add your answer
Q2. Bahaviour questions
Add your answer

Q1. Given a, b and target x, y , find if we can reach to x,y using a+b or a-b from a,b
Add your answer
Q2. This was a sliding window problem where need to get the max , so you are give a pos in the x axis and there are items kept and you need to collect the max .
Ans. 
Maximize item collection using a sliding window approach on a 1D axis.
• Identify the range of positions on the x-axis where items are located.

• Use two pointers to represent the current window of positions being considered.

• Expand the right pointer to include more items until the window exceeds the desired range.

• Contract the left pointer to reduce the window size while maintaining the maximum sum of items.

• Keep track of the ...read more
Answered by AI
Add your answer

Major questions were around problem solving, strings