ISRO

Indian Space Research Organisation Placement Paper Company: Indian Space Research Organisation 26. A simple graph (a graph without parallel edge or loops) with n vertices and k components can have at mosta n edgesb (n-k) edgesc (n-k) (n-k+ 1) edgesd (n-k) (n-k+1)/2 edges.27. Consider the polynomial p(x) = ao + alX + a2x2 + a3x3, […]

Indian Space Research Organisation Placement Paper Company: Indian Space Research Organisation 20. The value of x at which y is minimum for y = x2 -3x + 1 isa -3/2b 3/2c 0d -5/4 21. The formulaa Newton’s backward formulab Gauss forward formulac Gauss backward formulad Stirling’s formula 22. If G is a graph with e […]

Indian Space Research Organisation Placement paper Company: Indian Space Research Organisation 1. A full binary tree with n leaves contains a n nodes b log2 n nodes c 2n-1 d 2nnodes 2. The expression 1 * 2 ^ 3 * 4 ^ 5 * 6 will be evaluated as a 3230 b 16230 c 49152 […]

Indian Space Research Organisation Placement Paper Company: Indian Space Research Organisation 6. Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes of data are stores in a bit serial manner in a sector. The capacity of the disk pack and the number of bits required to […]

Indian Space Research Organisation Placement Paper Company: Indian Space Research Organisation 9. A processor that has c,arry, overflow and sign flag bits as part of its program status word (PSW}performs addition of the following two 2′s complement numbers 01001101 and 11101001. After the execution of this addition operation, the status of the carry, overflow and […]

Indian Space Research Organisation Placement Paper Company: Indian Space Research Organisation 14. A root α of equation f(x)=0 can be computed to any degree of accuracy if a ‘good’ initial approximation X0 is chosen for which a f (x0) > 0b f (x0) f”( x0) > 0c f (x)0 f” (x0) < 0 d f” […]

Indian Space Research Organisation Placement Paper Company: Indian Space Research Organisation 1. A full binary tree with n leaves containsa n nodesb log2 n nodesc 2n-1d 2nnodes2. The expression 1 * 2 ^ 3 * 4 ^ 5 * 6 will be evaluated asa 3230b 16230c 49152d 1734583. The feature in object-oriented programming that allows […]