Nvidia Interview Experience for System Software Engineer Internship

ROUND-1 :

Duration: 1 hour
Platform: HackerRank
Pattern: 2 coding questions & 25 MCQs including C/C++ fundamentals, OS, DSA, Probability/Permutations, DBMS.
5 members from our college were shortlisted for the next round (only 1 interview).

ROUND-2 :

• Started with Introduction.
• Questions on projects.
• Took 3 questions from the online test in 1st round, one including pointers: what’s the output of the program and why? 2nd one is based on signed and unsigned int-output of the program and why. and the 3rd one based on probability-explain the logic.
  Hence, Go through questions from the online test for SURE!
• Given a string and a substring. Check if anagram or not. (A Hackerrank link will be given)
  Ex: s = “amazon”, substring = “zamo”. Output: YES.
• Find the maximum depth of a Binary tree.
  https://leetcode.com/problems/maximum-depth-of-binary-tree/
• Given another code. Give the output. Why do we get errors? How to modify to get proper output.
  This is based on pass-by-value and pass-by-reference. And then was asked to give the difference.
• What is stack overflow?
• Where do we use stacks? How does recursion use stack?
• Given a code with a 2D array and sum. It has 2 nested for loops where the first one does row-wise addition and 2nd loop does column-wise addition. Which loop do you prefer? Why?
• What is cache? Choosing which loop increases cache performance.
  Given the following. Modify the code such that first thread A prints A and then thread B prints B.
  (Concept of semaphores)
  Out of 5, 2 were shortlisted.

C++

threadA(){
    while(1){
      cout<<"A";
    }
}

threadB(){
    while(1){
      cout<<"B";
    }
}