intergraph

1. find(int x,int y)
{ return ((xcall find(a,find(a,b)) use to find
? maximum of a,b
(b) minimum of a,b
(c) positive difference of a,b
(d) sum of a,b

2. integer needs 2bytes , maximum value of an unsigned integer is
? { 2 power 16 } -1
(b) {2 power 15}-1
(c) {2 power16}
(d) {2 power 15}

3.y is of integer type then expression
3*(y-8)/9 and (y-8)/9*3 yields same value if
?must yields same value
(b)must yields different value
(c)may or may not yields same value
(d) none of the above

4. 5-2-3*5-2 will give 18 if
?- is left associative,* has precedence over -
(b) - is right associative,* has precedence over -
(c) - is right associative,- has precedence over *
(d)- is left associative,- has precedence over *

5. printf("%f", 9/5);
prints
? 1.8,
(b) 1.0,
(c) 2.0,
(d) none
.
6. if (a=7)
printf(" a is 7 ");
else
printf("a is not 7");
prints
? a is 7,
(b) a is not 7,
(c) nothing,
(d) garbage.

7. if (a>b)
if(b>c)
s1;
else s2;
s2 will be executed if
? a<= b,
(b) b>c,
(c) b<=c and a<=b,
(d) a>b and b<=c.

8. main()
{
inc(); ,inc(); , inc();
}
inc()
{ static int x;
printf("%d", ++x);
}
prints
? 012,
(b) 123,
(c) 3 consecutive unappreciable numbers
(d) 111.

9.preprocessing is done

? either before or at beginning of compilation process
(b) after compilation before execution
(c) after loading
(d) none of the above.

10. printf("%d", sizeof(""));
prints
? error
(b)0
(c) garbage
(d) 1.

11.main()
{
int a=5,b=2;
printf("%d", a+++b);
}

? results in syntax,
(b) print 7,
(c) print 8,
(d) none,

12. process by which one bit pattern in to another by bit wise operation is
? masking,
(b) pruning,
(c) biting,
(d) chopping,

13.value of automatic variable that is declared but not initialized
will be
? 0,
(b) -1,
(c) unpredictable,
(d) none,

14. int v=3, *pv=&v;
printf(" %d %d ", v,*pv);
output will be
? error
(b) 3 address of v,
(c) 3 3
(d) none.

15. declaration
enum cities{bethlehem,jericho,nazareth=1,jerusalem}
assian value 1 to
? bethlehem
(b) nazareth
(c)bethlehem & nazareth
(d)jerich
11:33:18 AM