# Placement Papers - DeShaw

## Why DeShaw Placement Papers?

Learn and practice the placement papers of DeShaw and find out how much you score before you appear for your next interview and written test.

## Where can I get DeShaw Placement Papers with Answers?

IndiaBIX provides you lots of fully solved DeShaw Placement Papers with answers. You can easily solve all kind of placement test papers by practicing the exercises given below.

## How to solve DeShaw Placement Papers?

You can easily solve all kind of questions by practicing the following exercises.

### Deshaw Paper Patern

Posted By : Amit Rating : +15, -3

(PAPER) DESHAW

1) Minimum #of ip addresses requiered for an router
ans) 2

2) The worst case booth complexity for
ans) 101010101010101010

ans) forgot

4) Two binary 8bits are added overflow will come for
a)ones complement
b)twos complement
c)ones complement with signed magnitude
c)twos complement with signed magnitude

5) Two 8 bit nuos are multiplied and the result is stored in an rom the size of the rom is
ans) 64*64 doubt

6) How many no of 4x1 muxs are required for making an 16x1 mux
ans) 5

7) A simple nand gate problem
ans) Simple

8) The shannon hartley therom give the
ans) Channel capacity with no error

9) The bandwidth for 500bps is
ans) 1000bps   doubt

10) A problem with lower triangular matrix
ans) x[i]=b[i]-a[i][j]*x[i]

11) A c program with
if x>y
x=x-y
else
y=y-x
ans) GCD

12) Microwave propogation along the curvature of earth is called
ans) Ductpropogation

13) A simple bit on recurssion

14) CSMA/CD is used in
ans) Ethernet

15) What is used for knowing its own ip address
ans) Rarp

16) No signalling is needded to establish connection in
ans ) IP

17)A simple problem, on newton rapshon method

18) (A-B)U(B-A)U(AnB)=
Ans) AUB

19) If a number is choosen between 100 and 999 includeing these numberrs what is the provbabilty that the number selected does not contain a 7 is
ans) Workitout

20) A packet trabvelling in the internet forever can be controlled by having the field
ans)time to live (ttl)

21) C code with the follwing choices
a)call with value
c)call with value result
ans) Call with value result

22) When the following sequence is inserted in the binary search tree no of nodes int left subtree and right sub tree is
ans )7,4

x(x(5))
ans)17

24) Study about reentrant code reusable code recursive code

25) Given edges nodes and components of a graph find out its rank

26) In a tree a parent is greater than all its children in folling
ans) Heap

27) Question on pcm signal=3khz 8levels are used
ans)18000bps

28) To get the numberr in ascending order the traversal used is
ans) Inorder traversal

29)a problem in multiprocessing ,multithreading ,multiprogramming