Nvidia Senior Software Engineer Interview Questions and Answers

Q1. A string contains parenthesis, curly brackets and square brackets. Check if the string is valid or not.
Add your answer

Dsa and pointer and logical .

Tree and LL and graphs.

Q1. How will you solved problems
Ans. 
I approach problems methodically by breaking them down, analyzing root causes, brainstorming solutions, and testing them.
• Break down the problem into smaller, manageable parts

• Analyze the root causes of the problem

• Brainstorm potential solutions

• Test and iterate on the solutions until the problem is resolved
Answered by AI
Add your answer
Q2. How will you manage workload
Ans. 
I will manage workload by prioritizing tasks, setting realistic deadlines, delegating when necessary, and regularly reviewing progress.
• Prioritize tasks based on deadlines and importance

• Set realistic deadlines and milestones

• Delegate tasks to team members when necessary

• Regularly review progress and adjust workload as needed
Answered by AI
Add your answer

Q1. Java basics , oops , spring
Add your answer

Q1. Manger round basics behavior
Add your answer

Q1. Basically related to SIP Protocol. IMS call flows . CLOUD Knowledge
Add your answer
Q2. Deployment Process IMS ARCHITECTURE LTE ARCHITECTURE
Add your answer
Q3. DIAMETER PROTOCOL SDP PROTOCOL
Add your answer

45 mins, 3 coding questions in any language about Data structures

Q1. Basic technical questions
Add your answer

Technical questions, over an hour

Q1. Basic HR questions like your strengths and weakness, they test your leadership skills, extra curricular activities
Add your answer

2 coding questions in c/c++, 1 hr 30 mins - no. of deletions/additions needed to make 1 string equal to another. 2. print frequency of each number in array

Q1. Find the memory of the given structure (Struct padding is the hint)
Ans. 
The question asks to find the memory of a given structure by considering struct padding.
• Struct padding refers to the unused bytes added to align the members of a structure.

• To find the memory of a structure, we need to consider the size of each member and the padding added.

• The total memory of a structure is the sum of the sizes of its members and the padding.
Answered by AI
Add your answer
Q2. Write code to find the position of a number in a BST
Ans. 
Code to find the position of a number in a BST
• Implement a recursive function to traverse the BST

• Compare the target number with the current node value

• If the target is smaller, go to the left subtree; if larger, go to the right subtree

• Repeat until the target is found or the subtree is null
Answered by AI
Add your answer
Q3. Create a Trie data structure and perform insertion and search on it.
Ans. 
A Trie is a tree-like data structure used for efficient retrieval of strings. It supports insertion and search operations.
• A Trie is also known as a prefix tree.

• Each node in the Trie represents a character.

• The root node represents an empty string.

• Each node can have multiple children, each representing a different character.

• Insertion involves traversing the Trie and creating new nodes as needed.

• Search involves traversing...read more
Answered by AI
Add your answer

Q1. Regarding Java memory management
Add your answer

Q1. Regarding RMI process
Add your answer