Scribd
Upload
269 views3 pages

Nvidia

The document contains a sample Nvidia placement paper with 10 questions testing various computer science concepts. The questions range from 3 to 8 marks and cover topics such as finite state machines, string operations, logic gates, CPU caches, bitwise operators, memory allocation, and function returns.

Uploaded by

2071245820
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
269 views3 pages

Nvidia

The document contains a sample Nvidia placement paper with 10 questions testing various computer science concepts. The questions range from 3 to 8 marks and cover topics such as finite state machines, string operations, logic gates, CPU caches, bitwise operators, memory allocation, and function returns.

Uploaded by

2071245820
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

Visit prepnode.

com for more placement papers and


interview tips.

Nvidia placement paper


(10 questions in 60 minutes)

Note: The questions 1-4 are for 3 marks each.

1. A room has 100 bulbs and 100 switches. 100 people go in one by one. 1st person
goes in and toggles none of the switches. 2nd person goes in and toggles all switches
other than the multiples of 2 (2,4,6..). 3rd person goes in and toggles all switches
other than the multiples of 3 ( 3,6,9..), and so on ( till 100th person toggling all
switches except 100th switch).
Once this process is finished, which bulbs are in ‘on’ state (assuming all bulbs
to be in ‘off’ state initially)?

2. How would 1/9 be represented in IEEE floating point format? (Assuming 1


sign bit, 3 bits for exponent, 4 bits for mantissa)

3. An escalator has 100 steps. A kid going up also climbs 15 steps during the upward
motion. Another kid runs up in the downward elevator and reaches top along with the
first kid. How many steps are covered by second kid?

4. Write the minimal expression (code line) for a > b, where a= a0a1a2 and
b=b0b1b2. Assuming a and b are three digit numbers and are not equal.

Note: The questions 5-9 are for 6 marks each.

5. Find an FSM (Finite State Automata) for any number which is divisible by 3.

6. Write a C++ function to check if two strings (all alphabets are in uppercase in
both strings) of equal sizes are mirror images of each other. (e.g. HAM and MAH are
mirror images of each other)

7.
The given circuit is assembled using only NAND gates. Draw a truth table, including
the intermediate points E, F and G, and state which single gate the output H
represents.

8. The hit to miss ratio of a CPU cache is 19:1. It takes 0.5 millisecond for a single
access of cache and 0.25 second for main memory access.
a) Find the average time taken for single data access.
b) What is the probability that implementing CPU cache is inefficient as compared to
using only main memory?

Note: The question is for 8


marks. 9.
a) The output of an exclusive-OR (XOR) gate is 1 only when the inputs are different.
(True/False)

b) The exclusive-NOR (XNOR) gate is simply an OR gate followed by a NOT gate.


(True/False)

c) Are the expression *ptr++ and ++*ptr are same? (True/False)

d) Bitwise & and | are unary operators (True/False)


e) Even if integer/float arguments are supplied at command prompt they
are treated as strings. (True/False)

f) malloc() returns a NULL if it fails to allocate the requested memory. (True/False)

g) Functions cannot return more than one value at a time (True/False)

h) A function may have any number of return statements each returning different
values. (True/False)

You might also like