Nvidia interview Questions: The most important part of preparing for an interview is practice. Knowing what job interview questions you might be asked is essential – that way, you can craft your answers well in advance, and feel confident in your responses when the pressure is on.
Wouldn’t it be great if you knew exactly what interview questions are asked for the Test Engineer, QA for Manual & Automation Positions, We can’t read minds, unfortunately, but we’ll give you the next best thing: a list of previously asked Nvidia interview questions and answers.
We have tried to share some of the manual testing interview questions, selenium interview questions & testing interview questions also, but we are recommending spending some quality time to get comfortable with what might be asked when you go for the Nvidia interview.
Still, we need you are love and support to make this platform more helpful to our fellow testers. So it would be great if you will share your recent interview questions and experience with us. You Can share those details by connecting us at email@example.com.
Nvidia Pune Interview Questions
- Define Software Testing life cycle
- How will you test the mobile application
- What are the parameters you will measure while testing the Chrome browser for mobile?
- Tell me more about SeeTest Manual
- If you open multiple chrome browsers, what will you do to reduce slow down of Mobile
- How you will start Automation Testing
- Define testing strategies for the website on mobile
- Do you know Linux, hardware testing
- Performance Testing Question – Basic level
- How you perform in a difficult situation in life.
Nvidia Graphics Developer interview Experience
Aptitude Test: Aptitude test consisted of 4 sections:
- The first section includes basic languages like C, C++.
- The second section includes questions on Operating System.
- The third section includes questions on Data Structures.
- And the last section includes logical questions or puzzles.
Here are the Interview Questions & Marks:
- C & C++ [20 Q’s 20Marks]
- OS [20 Q’s 20Marks]
- DSA [15 Q’s 15Marks]
- Analytical [15 Q’s 15Marks]
No negative Marking, No time limit for separate sections (all sections combined) and No sectional cut-offs C/C++:
The interviewer started with the same open-minded question ”Tell me about your self.” You have to be prepared for such type of question and mainly focus on your skills what the company needs. Then he removed the aptitude paper and asked why I scored fewer marks in OS. Be frank as much as possible and say what went wrong during that section. He then asked me on my resume (each and every project listed in the resume). He asked me questions on OS one after the other such as:
- What are various synchronization techniques in os?
- What is semaphore, mutex, monitor?
- Difference between the above three. I explained each and every concept with an example.
- Write a function to reverse a string in C. I first took time to think and then explained to him what I was thinking about the problem and then wrote the code for that and then explained the code.
- According to you, how much did you score in each section of the aptitude? Which was your best section?
- (Here maybe they were trying to find whether we cleared the aptitude just by guessing or we knew the answers)
- A lot of questions on C concepts. sizeof, malloc, calloc, small and big-endian, pointers.
- What does volatile int I declaration mean?
- Swapping two variables:
Using XOR operator- Best method
• Using assignment op- 2nd best method but uses a temp variable
• Using addition and subtraction
• Using multiplication and division
( Last two methods like the first one doesn’t‟t use a temp variable but won’t work in all cases)
- Projects you have worked on. Explain it. And what have you learned from it
- OS concepts. Semaphores, binary semaphores, mutex, mutual exclusion, consumer-producer problem, monitors, deadlock, threads, processes, inter-thread communication, their difference, paging, segmentation, fragmentation, physical memory, virtual memory.
- Interrupts interrupt handling.
- There are 8 bits. Swap the 8th bit with the 7th, 6th with the 5th, 4th with the 3rd, and so on.
- OOPs, concepts.
- Given a linked list, using only one iteration find the middle node
- There are 25 horses. Find the top 5 fastest horses. Condition- allowed only 5 horses in a race.. in how many minimum numbers of races can you do so?
Round 2 :
This was another 45 min interview. He started with a technical puzzle.
- There are two threads T1 and T2. T1 prints even numbers such as 0,2,4…… and T2 prints odd numbers such as 1,3,5….. Write a program such that the output is 1,2,3,4,5.
- He asked what comes to mind when you hear “Memory management”?
- How is the process allocated in memory?
- What if there is a uge program?
- What is virtual memory?
- How will you implement virtual memory in phones where there is no big memory available? And many questions on OS.
- What comes to mind when you hear “image.”
- Convolution in image processing. The interviewer asked if I want to ask some questions? You should ask questions mainly about the company.
A puzzle was given to me:
Once upon a time, the electricity on the north and south sides of the campus was completely unconnected. In those days, there was an enormous mountain, ThompsonPeak, where College Hill Road is now. Travel between the two sides of campus took weeks, and many brave students lost their lives traversing the great range. In those days, each student had to come to campus with his or her work-mule to carry supplies for the great trek between the library on the north side of campus and the dorms on the south.
Before Thompson peak was leveled, then-president Johanne Chamberlain declared that the electricity on the two sides of campus should be connected. The heroic men and women of the physical plant took two years to dig a small conduit and inserted 501 identical wires between the two sides. Unfortunately, they neglected to leave any indication of which wire ends on the north side corresponded to which ends on the south side.
The mountain settled on top of the tunnel, and there was no way to remove the wires. A new tunnel would take another two years to dig. And, since this was in the days before telephones or helicopters, the only way to figure out which south-side ends corresponded to which north-side ends were to send an electrical signal through wires on one side, and then travel to the other side to see which wires were live on the other end.
Your challenge is to travel back in time to help the workers identify the ends of the wires on each side. You must minimize the number of trips required across Thompson peak to label each wire, from 1 to 501, with matching numbers on each side. You are permitted to connect wires on one side or the other. Connected wires will conduct electricity through the connection. But, you have only one voltage source. You can connect or disconnect as many wires, and as often, as you please. Solutions must contain complete instructions and the minimum number of trips.
Question: What would be the minimum number of trips be if there were “n” wires?
- I was asked to fill a form. This was just a casual talk
- How was the day?
- How were the interviews?
- What are your interests and passion?
- Tell me about your family
- What do you think Nvidia does?
- Do you have a specific domain to work in?
- Why Nvidia?
- Do you have any plans for further studies?
- What about shifting to Pune?
Thanks, Vikas (Bitian), for contributing this article.