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.

   

Labels:

Comments

Post a Comment

Popular posts from this blog

Data Structure Multiple Choice Questions and Answers

  Data Structure Multiple Choice Questions and Answers Our 1000+ multiple choice questions and answers (MCQs) on "Data Structure - I" (along with 1000+ MCQs on "Data Structure - II (Algorithms)") focus on all areas of Data Structure covering 200+ topics. One can read MCQs on Data Structure - II (Algorithms)                 Array and Array Operations This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Array and Array Operations”. 1. Which of these best describes an array? a) A data structure that shows a hierarchical behavior b) Container of objects of similar types c) Arrays are immutable once initialised d) Array is not a data structure View Answer Answer: b Explanation: Array contains elements only of the same type. 2. How do you initialize an array in C? a) int arr[3] = (1,2,3); b) int arr(3) = {1,2,3}; c) int arr[3] = {1,2,3}; d) int arr(3) = (1,2,3); View Answer Answer: c Explanation: This is the syntax ...
Post a Comment
Read more

sWAP cASE

  sWAP cASE: You are given a string and your task is to  swap cases . In other words, convert all lowercase letters to uppercase letters and vice versa. For Example: Www.HackerRank.com → wWW.hACKERrANK.COM Pythonist 2 → pYTHONIST 2 Function Description Complete the  swap_case  function in the editor below. swap_case  has the following parameters: string s:  the string to modify Returns string:  the modified string Input Format A single line containing a string  . Sample Input 0 HackerRank.com presents "Pythonist 2". Sample Output 0 hACKERrANK.COM PRESENTS "pYTHONIST 2". def   swap_case ( s ):      result =  s . swapcase ()      return ( result ) if  __ name__  ==  '__main__' :      s  =  input ()      result  =  swap_case ( s )      print ( result )
Post a Comment
Read more

Program to find Smallest element in an array using C

  Program to find Smallest element in an array using C We will find the smallest or minimum element in an array using the C concept. We apply an algorithm that assumes the first element as the smallest element and then compares it with other elements if an element is smaller than it then, it becomes the new smallest element, and this process is repeated till the complete array is scanned. ALGORITHMS:-  STEP 1:-    Initialize the required variables. STEP 2:-  Take the input from the user. STEP 3:-   Assume the smallest element is present at the first position. STEP 4:-    Scan each element with the help of for a loop. STEP 5: -    Check if the element Scanned is new smaller than small. STEP 6:-    If it is smallest than small, change the value of small. STEP 7:-    Print small as it stores the smallest element of the array. CODE:- #include <stdio.h> int  main() {      int  a[ 50 ],p,...
Post a Comment
Read more