Answer / susie

Answer :

50

Explanation:

The preprocessor directives can be redefined
anywhere in the program. So the most recently assigned value
will be taken.

Answer / naveen

it will print the most recently processed value .i.e 50
because the preprossed values can be set anywhere in the
program at any time

Write a routine that prints out a 2-D array in spiral order

3 Answers   Microsoft,

---

main() { int c=- -2; printf("c=%d",c); }

1 Answers   TCS,

---

Write a program to implement the motion of a bouncing ball using a downward gravitational force and a ground-plane friction force. Initially the ball is to be projected in to space with a given velocity vector

2 Answers  

---

Given a list of numbers ( fixed list) Now given any other list, how can you efficiently find out if there is any element in the second list that is an element of the first list (fixed list)

3 Answers   Disney, Google, ZS Associates,

---

main ( ) { static char *s[ ] = {“black”, “white”, “yellow”, “violet”}; char **ptr[ ] = {s+3, s+2, s+1, s}, ***p; p = ptr; **++p; printf(“%s”,*--*++p + 3); }

1 Answers  

---

main() { int i=-1,j=-1,k=0,l=2,m; m=i++&&j++&&k++||l++; printf("%d %d %d %d %d",i,j,k,l,m); }

1 Answers  

---

#define DIM( array, type) sizeof(array)/sizeof(type) main() { int arr[10]; printf(“The dimension of the array is %d”, DIM(arr, int)); }

1 Answers  

---

Link list in reverse order.

8 Answers   NetApp,

---

#include<stdio.h> main() { struct xx { int x; struct yy { char s; struct xx *p; }; struct yy *q; }; }

2 Answers  

---

main() { int i=300; char *ptr = &i; *++ptr=2; printf("%d",i); }

4 Answers   CSC,

---

All the combinations of prime numbers whose sum gives 32

1 Answers   HHH,

---

main() { int i=5; printf("%d%d%d%d%d%d",i++,i--,++i,--i,i); }

7 Answers  

---