Skip to main content

Binary to Decimal conversion program

 3. Binary to Decimal conversion program using C language:-

The C program converts binary number to decimal number that is equivalent. A decimal number can be attained by multiplying every digit of binary digit with a power of 2 and totaling each multiplication outcome. The power of the integer starts from 0 and counts to n-1 where n is assumed as the overall number of integers in a binary number.

Ex:-  (101100001) 2 =(353)10

                                                


ALGORITHMS:-

Step 1: Start

Step 3: The user is asked to enter a binary number as an input

Step 4: Store the quotient and remainder of the binary number in the variable rem

Step 5: Multiply every digit of the entered binary number beginning from the last with the powers of 2 correspondingly

Step 6: Repeat the above steps with the quotient obtained until the quotient becomes 0

Step 7: The sum of the numbers will give the decimal number as a result, print the decimal value.

Step 8: Stop.

CODE:-

 #include<stdio.h>
int main()
{

    int Binary_no,Decimal_no = 0,rem , num , base=1;
    printf("Enter Binary no in(0's and 1's):");
    scanf("%d",&Binary_no);// take inpue from user 
    num = Binary_no; // num value updated.
    while(num>0)// while loop for condirtion.
    {   
       rem = num % 10;//calculate the remof any num.
       Decimal_no = Decimal_no + rem*base;
        /*Decimal value calculate using decimal value and base value  */
       num= num/10; // new number value update.
       base= base*2;// base value updated.
    }
    printf("The decimal value is %d ", Decimal_no);// print the value.
    return 0;// return zero.
}

       


OUTPUT:-




FOLLOW THIS WEBPAGE FOR MORE NEW PROGRAMS AND CODING SOLUTIONS.

   

Comments

Popular posts from this blog

Write a C program to find number is Abundant number or not

  Write a C program to find the number is an Abundant number or not:- In this program to find a number is an Abundant number or not. A number n is said to be an Abundant Number to follow these condition the sum of its proper di visors is greater than the number itself. And the difference between these two values is called abundance. Ex:-  Abundant number  12 having a proper divisor is 1,2,3,4,6 the sum of these factors is 16 it is greater than 12 so it is an Abundant number. Some other abundant numbers     18, 20, 24, 30, 36, 66, 70, 72, 78, 80, 84, 88, 90, 96, 100, 102, 104, 108, 112, 114, 120.. ALGORITHMS:- Step 1 - Enter the number, to find the Abundant number. Step 2 - Initialize the loop with c=1 to c<=number and follow the following calculation      (i) check if whether the number is divisible with c and c got a result zero.      (ii) now sum=sum+c, add a digit into a sum and store it in the sum. Step 3 . then the...

How to check if the given number is Even or odd-

1. How to check if the given number is Even or odd- We can determine whether a number is even or odd. This can be tested using different methods. The test can be done using simple methods such as testing the number’s divisibility by 2. If the remainder is zero, the number is even. If the remainder is not zero, then the number is odd. The following algorithm describes how a C program can test if a number is even or odd. CODE:- #include <stdio.h> int   main () { int num;//variable declaration printf("Enter any num: ");// take input from user  scanf("%d",&num);// declare input if(num%2==0) { printf("The num %d is even",num); } else { printf("The num %d is odd",num); } return 0; }     ALGORITHM:- Step 1.   Start Step 2 .   Enter a number. Step 3.   If...

Chakra Vyuh Bhedna, the only answer to how to crack group discussions!

  Chakra Vyuh Bhedna, the only answer to how to crack group discussions! Because of the pandemic, the placement drive was conducted virtually. And to add to the difficulty level, more than 200 students participated in the drive. The selection process consisted of an online test that included the aptitude and technical questions, which was followed by a group discussion. Both were elimination rounds. The shortlisted students were then called for the final round, the personal interview. All about cracking group discussions and interviews My strategy was to be attentive in the pre-placement talks by asking questions to them and even trying to answer their questions. This helped me to boost my self-confidence and made me perform well during the Group Discussion. For cracking group discussion, I practiced a simple and powerful technique called  Chakra Vyuh Bhedna . It's a complete weapon to crack any GD. This technique has 4 parts.  Awareness of the topic Understanding PE...