Its very simple ,just divide the decimal number by 2 and note down the remainder(which will be either 1 or 0) ,then again divide the quotient obtained in the first step and note down the remainder..........repeat the step till u get 0 as quotient n write the remainders in reverse order that means the last step remainder will b e the leftmost digit of the binary equivalent of given decimal number.

void main() { int i=20;j=35,x,y; x= y++ + x++; y= ++y + ++x; printf("
%d %d" , x,y); } /* please tell me the value of x and y at each and every moment. i dont need the answer but the explanation of the anamolus behavior of increment expression.*/