Answer / ashu

divide the given no by two n store the remainder in stack
and divide again by 2 to quotent the process gong on....
n store all the remainder in the same stack....
n in last pop all the element from stack n print it.

Answer / siddiqui mohd. faisal

It's very simple.
Firstly, the binary no. of 0 is 0000.
After that if you want to know the binary no. of 1 then
jaust add 1 to binary no. of 0 i.e. 0000.So, now the ans
will be 0001.But,remember here 1+1=10.So, now if you want
binary no. of 2 then add 1 to binary no. of 1 i.e. 0001.So,
the binary no. of 2 will be 0010.
I hope you got your question answer.

Answer / vaibhav

divide no. by 2 till 1 is not coming in quotient, then it
write from bottom to top

Answer / santhi perumal

#include<stdio.h>
#include<conio.h>

int main()
{
int i,number;
printf("Enter the Number\n");
scanf("%d",&number);

for(i=7;i>=0;i--)
{
if((1<<i) & number)
printf("1");
else
printf("0");
}
}

Answer / alle balraj

void main()
{
int i,n,p=0,j;
int a[10];
clrscr();
printf("Enter the value of n:\n");
scanf("%d",&n);
i=n;
while(i!=1)
{
if(n==1)
{
a[p]=1;
break;
}
if(n%2==0)
{
a[p]=n%2;
}
else
{
a[p]=n%2;
}
n=n/2;
i=n+2;
i--;
p++;
}
for(j=p;j>=0;j--)
{
printf("%d",a[j]);
}

getch();
}

Answer / bertilla

#include<conio.h>
#include<stdio.h>
void main()
{
int i,n,arr[15];
for(i=0;i<=14;i++){arr[i]=0;}
do
{
arr[i]=n%2;
n=n/2;
i--;
if(n==1){arr[i]=1;}
}while(n>1);
for(i=0;i<=15;i++)
{
printf("%d",arr[i]);
}
getch();
}

Answer / naresh m

main()
{
int a[12],n,m,i=0;
printf("enter the no to find binary no's");
scanf("%d",&n);
while(n!=0)
{
m=i++;
a[i]=n%2;
n=n/2;
}
printf("binary value is");
for(i=m;i>=0;i--)
{
printf("%d",a[i]);
}

Answer / kk

let the number be n
int bin(int n)
{
static int sum=0;

if(n>1)
{
rem=n%2;
sum = sum *10 +rem;
n=n/2;
bin(n);
}
else
{
sum=sum*10+1;
}
return sum;
}

Answer / a.balraj

void main()
{
int i,n,p=0,temp,z;
int a[3];
clrscr();
printf("Enter the value of n:\n");
scanf("%d",&n);
i=n;
while(i!=1)
{
if(n%2==0)
{
temp=n%2;
}
else
{
temp=n%2;
}
a[p]=temp;
n=n/2;
i=n+2;
i--;
p++;
}
for(z=sizeof(a)/sizeof(int);z>=0;z--)
{
printf("%d",a[z]);
}
getch();
}

Answer / subhashini

#include<stdio.h>
#include<conio.h>
{
clrscr();
int i,sum,n;
printf("enter the number");
scanf("%d",&n);
while(n>=1)
{
i=n%2;
sum=sum*10+i;
n=n/2;
getch();
}
printf("the binary number is: %d",i)

How can we allocate array or structure bigger than 64kb?

2 Answers   CSC,

an expression contains relational operators, assignment operators, and arithmatic operstors. In the absence of parentheses, they will be evaluated in which of the following order a) assignment, relational, arithematic b) arithematic, relational, assignment c) relational, arithematic, assignment d) assignment, arithematic, relational

0 Answers  

What are different types of pointers?

0 Answers  

How can I rethow can I return a sequence of random numbers which dont repeat at all?

0 Answers  

What does c mean in basketball?

0 Answers  

Which built-in library function can be used to match a patter from the string?

0 Answers  

wap in c to accept n number display the highest and lowest value

2 Answers  

Can you mix old-style and new-style function syntax?

0 Answers  

What is call by reference in functions?

1 Answers  

Can a binary search tree be used as an index? If yes, how? Explain

0 Answers   TCS,

What is function definition in c?

0 Answers  

Explain the term printf() and scanf() used in c language?

0 Answers