0% found this document useful (0 votes)
1K views3 pages

NVIDIA Interview

The document outlines the interview experience of Jatin Khandelwal for an NVIDIA system software position, detailing the test conducted on HackerRank and the subsequent interview process. It includes specific questions asked during the interview, covering topics such as memory addresses, loops, linked lists, compilers, and binary trees. Additionally, it provides links to resources for preparation and emphasizes the importance of basic C and C++ knowledge for the interview.

Uploaded by

Samyak Rote
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
1K views3 pages

NVIDIA Interview

The document outlines the interview experience of Jatin Khandelwal for an NVIDIA system software position, detailing the test conducted on HackerRank and the subsequent interview process. It includes specific questions asked during the interview, covering topics such as memory addresses, loops, linked lists, compilers, and binary trees. Additionally, it provides links to resources for preparation and emphasizes the importance of basic C and C++ knowledge for the interview.

Uploaded by

Samyak Rote
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

NVIDIA (SYSTEM SOFTWARE EXP) : JATIN KHANDELWAL (2024 season)

Test Date: 11th August


-test conducted on hackerrank ,
- aptitude (easy)
- basic c and c++
- two coding ques. ( very easy )

INTERVIEW:
shortlist for interview based on cg and the paper.
12. August
A panel of 3 people took the online interview
-basic intro

DISCLAIMER – students in the first slots of interviews were asked the questions and the mistakes of their
test again in the interviews . Prepare them If you remember. I would suggest you to screen record the
paper so that you can try those question afterwards. I had mine in the last slot so I wasn’t asked.

- Q1. When we declare “int a = 5” in the program , and then we print &a, so the address which we get is
of which memory. -Physical or logical
I answered logical address and the mapping of address from logical to physical is taken care by page
table. (they wanted to hear the term “page table” although I was not sure of whether this is correct or
not.

-Q2. Is there some problem in this loop


for(unsigned int i=6;i>=0;i--)
Yes, it never terminates , Because at i=0, when i- - takes place the unsigned int takes 2^32 -1 value which
is >0 so loop continues again
Q3. How do we represent negatives in computer. What is the range of int . If we take the integer to be of
8 bits , then what will be the range of signed int.
2’s comp,,, -2^31 to 2^31 -1 ,,, same analogy – - 2^7 to 2^7 -1.

Q4.Suppose two linked list intersect, will they be of X form or Y form ( basically can the intersect and
then diverge or not. How to determine the How to reverse a Linked List.
standard ques , and if they meet once they can never intersect

Q5. What are DLL in compilers (had no idea)

Q6. Compiler and Linker anf basic difference in their roles. If a function is declared below the main why
does it throw error and how to remove it . ( again based on compiling and linking) (. This same concept
was also used in one of the Test questions.
Ans. the declaration promises the compiler to compile and the linker then links it.

watching cherno c++ youtube for compiler and linker is the best option – watch as much as you can the
whole c++ playlist – highly recommended.

Q7. A SORTED stream of integers is coming and you have to create a Binary tree. How would you
do(store it) it in a BST ?

Since If we do it normally (attaching the integers as they come to the right. The search on that tree
would be inefficient (due to O(n) height of tree) , so we rotate and balance the tree again and again
(they just wanted to know whether I know the concept of AVL tree and rotation)

Q8. Exchange the 4th and 5th bit of and integer

Simple – store both (if they are different xor then curr num with ..00110000)
Q9. How would to create adder circuit by gates to construct 2 bit adder.
A xor B for ans bit, and A&B for the carry bit .

Q10.IN a c/c++ program , what all spaces does it use

https://www.geeksforgeeks.org/memory-layout-of-c-program/

I answered stack and heap , was not able to recall the others.

Q11. In heap , we use delete to free memory but in a normal program we declare int a = .. but don’t use
delete. Why? (basic stack vs heap ) (see cherno stack and heap, its enough)

they are on stack and gets freed once the scope of main function ends.

IMP LINKS: (A FEW DAYS BEFORE)

FOR OS ONE SHOT:

https://www.youtube.com/watch?v=8XBtAjKwCm4&t=485s&pp=ygUab3BlcmF0aW5nIHN5c3RlbXMgb25
lIHNob3Q%3D
https://www.youtube.com/watch?v=p9yZNLeOj4s&t=1s&pp=ygUoc2VnbWVudGVkIG1lbW9ydCBhbmQg
cGFnaW5nIDggbWluIHZpZGVvXA%3D%3D

THE QUESTIONS WERE IN THE OA WERE MAJORLY FROM C. (basic knowledge of c is important – printf
and all.

C++

Some Imp topics: – refer cherno playlist- on C++ for polymorphism, virtual function, encapsulation….and
cannot rem more. Watch as much as you can (they are short videos , and very well explained)

Vtable and vpointer-


https://www.youtube.com/watch?v=Z_FiER8aAqM&pp=ygUWdnRhYmxlIGFuZCB2cHRyIGluIGNwcA%3D
%3D

ONE NIGHT BEFORE: - shortlist for interview came at 2 am and interview was at 8 am so I didn’t had
much time .

https://www.geeksforgeeks.org/nvidia-software-interview-experience-internship/ I just thoroughly went


through this, and went for the interview.

You might also like