Xilinx Physical Education Teacher Interview Questions and Answers

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

Q1. Basic questions around testing.
Add your answer

Here they asked lots of logical reasoning questions and checked on how you approached different situations

Q1. Explained package and other details
Add your answer

Q1. Reserve Binary Search Tree
Add your answer

Q1. Dsa questions , angular , .net core and SQL
Add your answer

Q1. Work related discussion session.
Add your answer

Q1. Pick one question from 3 given questions and complete it in 7 days. I opted for creating traingle with opengl using shader.
Add your answer

Data structures and algorithms
Problem were from leetcode and geek for geeks.

Q1. Data structures and algorithms
Add your answer

Q1. Design and algorithms
Add your answer

Coding round , questions from leetcode

Situation based questions and thought process

Q1. Managerial round 1, culture fit, behaviour
Add your answer
Q2. Managerial round 2, innovative things done previously, how to face criticism, does experience matters in learning from subordinate
Add your answer

Q1. Explain your recent projects from your resume
Add your answer

Q1. Add a node to the head of linked list
Ans. 
To add a node to the head of a linked list, create a new node, set its next pointer to the current head, and update the head pointer to the new node.
• Create a new node with the desired data

• Set the new node's next pointer to the current head of the linked list

• Update the head pointer to point to the new node
Answered by AI
Add your answer