answersLogoWhite

0

Decimal of 1111 base 2 is 10001010111

the algorithms for finding decimal number equivalent of binary is as follow:

#include
#include
void main()
{ int i,n,j,b[100];
clrscr();
printf("Enter a Number:");
scanf("%d",&n);
i=0;
while(n>0)
{
b[i]=n%2;
n=n/2;
i++;
}
printf("\n\nBinary Equivalent:");
j=i-1;
for(i=j;j>=0;j--)
printf("%d",b[j]);
getch();
}
using this algorithms... the binary equivalent of any number is taken out...!!! enjoy... have any query... email at :- "devilllcreature@Yahoo.com" thank you....!!!

User Avatar

Wiki User

15y ago

Still curious? Ask our experts.

Chat with our AI personalities

FranFran
I've made my fair share of mistakes, and if I can help you avoid a few, I'd sure like to try.
Chat with Fran
ProfessorProfessor
I will give you the most educated answer.
Chat with Professor
BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake

Add your answer:

Earn +20 pts
Q: Decimal of 1111 base 2
Write your answer...
Submit
Still have questions?
magnify glass
imp