Questions

 #include<stdio.h>
int main(){
    int num,r,sum=0,temp;

    printf("Enter a number: ");
    scanf("%d",&num);

    temp=num;
    while(num){
         r=num%10;
         num=num/10;
         sum=sum*10+r;
    }
    if(temp==sum)
         printf("%d is a palindrome",temp);
    else
         printf("%d is not a palindrome",temp);

    return 0;
}

Sample output:
Enter a number: 131
131 is a palindrome

In binary representation there are some states that believed to be never occurred due to some particular functionality of a given circuit. If zero output is assigned to such states then it is called minimal risk solution as  we are resetting the formidable states which could be occurred accidentally. Another approach is to assigned a don't care to them so it results in lesser logic and hence is called minimal cost solution.