
Concept explainers
Conversion of BCD (8421) numbers 11 0110 0101.0000 0111 to a decimal numbers.

Answer to Problem 21A
Decimal numbers is 365.0710.
Explanation of Solution
Given information:
A BCD (8421) numbers 11 0110 0101.0000 0111.
Calculation:
BCD number system uses 2 symbols: The numbers are 0 and 1.
And a decimal number system uses the number 10 as its base i.e. it has 10 symbols; decimal digits are 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9.
BCD numbers are represented as from decimal number
BCD (8421) | 0000 | 0001 | 0010 | 0011 | 0100 | 0101 | 0110 | 0111 | 1000 | 1001 |
Decimal | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
Each decimal digit consists of 4 BCD digits.
For example decimal number 9 is equal to BCD number 1001.
For converting integer part of BCD numbers into decimal numbers write down the BCD numbers and represent four binary digits from right by its decimal digit from the table.
Then combine all the digits together.
For converting fractional part of BCD numbers into decimal numbers write down the BCD numbers and represent four binary digits from left by its decimal digit from the table.
Then combine all the digits together.
Finally decimal number is combination of both integer and fractional part.
Decimal digits are equal to the summation of 2n where n = 0, 1, 2 and 3 (position from right)
For example 9 = 23+20; in this example 21 and 22 is not exist so at position 1 and 2 binary digit is zero and at position 0 and 3 binary digit is one; for example decimal of BCD 1001 is
The decimal number is equal to the summation of binary digits dn × 2n
Divide the binary number into block of four digits if four digits are not exist the add additional zero in binary number for example 11 is written as 0011 and .11 is written as .1100
Decimal of BCD number 11 0110 0101.0000 0111 is (Starting from right for integer part and starting from left for fractional part)
Want to see more full solutions like this?
Chapter 86 Solutions
Mathematics For Machine Technology
- Theorem 1: A number n ∈ N is divisible by 3 if and only if when n is writtenin base 10 the sum of its digits is divisible by 3. As an example, 132 is divisible by 3 and 1 + 3 + 2 is divisible by 3.1. Prove Theorem 1 2. Using Theorem 1 construct an NFA over the alphabet Σ = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}which recognizes the language {w ∈ Σ^(∗)| w = 3k, k ∈ N}.arrow_forwardRecall the RSA encryption/decryption system. The following questions are based on RSA. Suppose n (=15) is the product of the two prime numbers 3 and 5.1. Find an encryption key e for for the pair (e, n)2. Find a decryption key d for for the pair (d, n)3. Given the plaintext message x = 3, find the ciphertext y = x^(e) (where x^e is the message x encoded with encryption key e)4. Given the ciphertext message y (which you found in previous part), Show that the original message x = 3 can be recovered using (d, n)arrow_forwardFind the sum of products expansion of the function F(x, y, z) = ¯x · y + x · z in two ways: (i) using a table; and (ii) using Boolean identities.arrow_forward
- Give both a machine-level description (i.e., step-by-step description in words) and a state-diagram for a Turing machine that accepts all words over the alphabet {a, b} where the number of a’s is greater than or equal to the number of b’s.arrow_forwardCompute (7^ (25)) mod 11 via the algorithm for modular exponentiation.arrow_forwardProve that the sum of the degrees in the interior angles of any convex polygon with n ≥ 3 sides is (n − 2) · 180. For the base case, you must prove that a triangle has angles summing to 180 degrees. You are permitted to use thefact when two parallel lines are cut by a transversal that corresponding angles are equal.arrow_forward
- Answer the following questions about rational and irrational numbers.1. Prove or disprove: If a and b are rational numbers then a^b is rational.2. Prove or disprove: If a and b are irrational numbers then a^b is irrational.arrow_forwardProve the following using structural induction: For any rooted binary tree T the number of vertices |T| in T satisfies the inequality |T| ≤ (2^ (height(T)+1)) − 1.arrow_forward(a) Prove that if p is a prime number and p|k^2 for some integer k then p|k.(b) Using Part (a), prove or disprove: √3 ∈ Q.arrow_forward
- Provide a context-free grammar for the language {a^ (i) b^ (j) c^ (k) | i, j, k ∈ N, i = j or i = k}. Briefly explain (no formal proof needed) why your context-free grammar is correct and show that it produces the word aaabbccc.arrow_forwardDo College Students With Part-Time Jobs Sleep Less? College students were surveyed about the number of hours they sleep each night.Group A = With part-time jobs | Group B = Without jobs Group A: 6, 5, 7, 6, 5Group B: 8, 7, 9, 8, 7 Instructions: State your hypothesis and perform a two-sample t-test with all formulas. Create histograms for each group. Label axes and add titles. Comment on the distribution shape (e.g., normal, skewed, etc.).Solve on pen and paperarrow_forwardThis is advanced mathematics question that need detailed solutionsarrow_forward
- Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal LittellElementary AlgebraAlgebraISBN:9780998625713Author:Lynn Marecek, MaryAnne Anthony-SmithPublisher:OpenStax - Rice University
- Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGAL




