CONVERSION INTO BINARY FROM DECIMAL, HEXA, OCTAL NUMBERS

HEY I AM GOING TO SHOW SOME IDEAS ABOUT BINARY  CONVERSION

1. DECIMAL TO BINARY.


LET US TAKE EXAMPLE:-  (a) 5 IN DECIMAL  (in decimal digits <=9).

                                                       Step1. Devide 5 from 2 then we get 2 as remainder and 1 as quot.
                                                       Step2. Devide 2 (i.e remainder of above) from 2 then we get 1 as                                                                       remainder and 0 as quot. 
                                                       Step3. Now we get 1 which not divisible by 2. Here we stop.
                                                                   If we see in quotient portion from above we get 101.

   ans.:-  we write quot. right to left.   i.e. 101 which is binary of decimal 5.
   

2. OCTAL TO BINARY.

                                                (b) 523  IN OCTAL FORM   (in octal digit <= 7).
                                                       
                                                    Step1. Convert 3 into binary  i.e.  = 011 (always write binary in                                                                        group of three ).
                                                    Step2. Convert 2 into binary  i.e.  = 010 (always write binary in                                                                        group of three ).
                                                    Step3. Convert 5 into binary  i.e.  = 101 (always write binary in                                                                         group of three ).
                                                    Step4. Rewrite all above in serial way i.e (step3step2step1)
                                                                101010011.
                                                      
  ans.:- we write 101010011 in binary.

3. HEXA TO BINARY.

                                               (C) 9A2 IN HEXA FORM (in hexa digits <=15 (10=A, 11=B, 12=C,                                                          13=D, 14=E, 15=F))

                                                   Step1. Convert 2 into binary  i.e.  = 0010 (always write binary in                                                                        group of four ).

                                                   Step2. Convert A into binary  i.e.  = 1010 (always write binary in                                                                        group of four ).

                                                   Step3. Convert 9 into binary  i.e.  = 1001 (always write binary in                                                                        group of four ).

                                                   Step4. Rewrite all above in serial way i.e (step3step2step1)
                                                                100110100010.

      ans.:- we write 100110100010 in binary.
        
THANK YOU FOR VISIT.

FOR ADD, SUB etc.  GO THROUGH MY BLOG

WHICH IS UNDER PROCESS
                                         
https://amazon.in/gp/join-and-earn?encoding=UTF8&ref=mrp_refl_cp_clbd_ind_snp_lnd&refcust=37OGBBWDRFFZR2BQ5OYODHCIK4

Comments

Post a Comment

Popular posts from this blog

Design a Calculator Using C# code.

Image
Design a Calculator  What you will need: A computer running Windows 7 or higher Visual Studio: Any version               Download: http://www.visualstudio.com                 I will be using the 2010 version of Visual Studio in this tutorial, but every version is pretty similar. Step 1: Creating a New Project Step 2: Designing the Application         Step 3: Creating Event Handlers 3.1. Double click a button.  This will bring you to the "Form1.cs" tab.  This is where all of your code will be written.  Notice a section has been pre-written for you based off of the "Click" event.  This section of code will be executed when that specific button is clicked.  For the sake of this project, we will call these Event Handlers. 3.2. Double click all of your buttons so you have an event handler for ea...
Read more

Insertion Sorting in C Language.

Keep in mind:- 1. Take one element at a time for sorting (i.e. one by one). 2.  Useful for sorting small data set (not used this sorting for large data sets). 3. Time complexity is Worst case =O(n2).. 4. Time complexity depend on number of compare + number of movement. 5. Sometime calls as In-Place Algorithm. 6. It may be ascending or descending orders. Basic Idea:- If you have 4 cards (numbering 4,3,7,1).           Before sorting :- 4,3,7,1.            After sorting :-   1,3,4,7. Process:- 1. Take first card (i.e. 4). 2.  Take another card 3 compare with first one, we got 4>3. So move 3 before 4. 3. Take 3rd card 7 compare with previous one 4, we got 7>4. So no need to sorting, 4. Take 4th card 1 compare with previous one 7, we got 1<7. So move one place left, again 1<4 move      left, again 1<3 move left. Therefore 1 comes at their position. Sorting Done. Alg...
Read more