Concept explainers
To express:
A binary number into a hexadecimal number.

Answer to Problem 18A
Hexadecimal number is 749.A4416.
Explanation of Solution
Given information:
A binary number 11101001001.10100100012.
Calculation:
Binary number system uses the number 2 as its base. Therefore, it has 2 symbols: The numbers are 0 and 1.
And a hexadecimal number system uses the number 16 as its base i.e. it has 16 symbols, hexadecimal digits are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E and F.
Binary numbers are represented as from hexadecimal number
Binary | 0000 | 0001 | 0010 | 0011 | 0100 | 0101 | 0110 | 0111 |
Decimal | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
Hexadecimal | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
Binary | 1000 | 1001 | 1010 | 1011 | 1100 | 1101 | 1110 | 1111 |
Decimal | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 |
Hexadecimal | 8 | 9 | A | B | C | D | E | F |
Each hexadecimal digit consists of 4 binary digits.
For example, hexadecimal number 9 is equal to binary number 1001.
For converting integer part of binary number into hexadecimal number, write down the binary number and represent four binary digits from right by its hexadecimal digit from the table.
Then combine all the digits together.
For converting fractional part of binary number into hexadecimal number, write down the binary number and represent four binary digits from left by its hexadecimal digit from the table.
Then combine all the digits together.
Finally, hexadecimal number is combination of both integer and fractional part.
Hexadecimal 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 22are not there. So, at position 1 and 2, binary digit is zero, and at position 0 and 3, binary digit is one. Therefore, hexadecimal of binary 1001 is
The hexadecimal 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 there, then add additional zero in binary number. For example, 11 is written as 0011 and .11 is written as .1100.
Hexadecimal of binary number 1100100101001011.10010010012 is (Starting from right for integer part and starting from left for fractional part)
Want to see more full solutions like this?
Chapter 85 Solutions
EBK MATHEMATICS FOR MACHINE TECHNOLOGY
- 1. Let W, U, and S be graphs defined as follows: • V(W) is the set of countries in the world; • V(U) is the set of countries in the European Union; V(S) is the set of countries in the Schengen Area; ● for X = {W,U,S}, E(X) is the set of pairs of countries in V(X) that share a land border. Recall that land borders between countries in the Schengen Area are special in that they can be crossed without a passport. (a) The notions of a country and a land border are somewhat ambiguous. Explain the notions you will use to get a precise definition of the graphs W, U, and S. (b) Is S a subgraph of U? Is U an induced subgraph of W? Justify your answers. (c) Using non-mathematical language, explain what it means for a country x if VEV(S) and dw (v) = 0. Give all such countries. Let A = {v Є V(W) \V(S) such that |Nw(v)| > 0 and Nw (v) ≤ V(S)}. (d) Using non-mathematical language, explain what the set A represents in terms of countries and land borders. Give a specific element of A or explain why A…arrow_forward3. A spreadsheet consists of cells indexed by a row and a column. Each cell contains either a value or a formula that depends on the values of other cells. (a) Describe a graph, digraph, or network that models an arbitrary spreadsheet and allows you to answer the remaining parts of this question. (b) Explain, by referring to the graph, digraph, or network, when it is possible to change the value of cell x without changing the value of cell y. (c) Explain, by referring to the graph, digraph, or network, when it is possible to calculate the values of all cells in the spreadsheet. Consider the following spreadsheet with 5 rows, 7 columns, and 35 cells. For exam- ple, cell el contains a value, whereas cell al contains a formula that depends on the values cells el and 95. a b с d e f g 1 el+g5 al-c5 110 al+cl 180 f5-el c1+c2 2 al+bl a2+c4 240 a2+c2 120 f5-e2 e3+e5 3 a2+b2 a3-c3 100 a3+c1 200 f5-e3 f1+f2 4 a3+b3 a4+c2 220 a4+c2 100 f5-e4 f3+f4 5 a4+b4 a5-c1 130 a5+c5 120 g3+g4 gl+g2 (d) Can…arrow_forwardSolution: Solution: 7.2 2x²+5x-3. Diagram: till sh one The Steps the same technique as in 4 and 5) above to factor the following Show all the Steps. "Diagram, (2) 03) But (be Wha x+2 3arrow_forward
- Q/ solving Laplace equation on Rectangular Rejon a xx+uyy = o u (x, 0) = u(x,2) = 0 u (o,y) = y (1,y) = 27arrow_forwardQ / solving ha place equation a x x + u y y = 0 u (x, 0)=0 u ( x, 2) = 10 u (o,y) = 4 (119)=0 и on Rectangular Rejonarrow_forwardConjecture Let x and y be integers. If x is even and y is odd, then xy is even. Try some examples. Does the conjecture seem to be true or false?arrow_forward
- SOLVE ONLY FOR (L) (M) AND (O)arrow_forwardFile Preview A gardener has ten different potted plants, and they are spraying the plants with doses of Tertizers. Plants can receive zero or more doses in a session. In the following, we count each possible number of doses the ten plants can receive (the order of spraying in a session does not matter). (a) How many ways are there if there were twelve total doses of a single type of fertilizer? (b) How many ways are there if there are six total doses of a single type of fertilizer, each plant receives no more than one dose? (c) How many ways are there if is was one dose of each of six types of fertilizers? (d) How many ways are there if there are four doses of fertilizer #1 and eight doses of fertilizer #2? (e) How many ways are there if there are four doses of fertilizer #1 and eight doses of fertilizer #2, and each plant receives no more than one dose of fertilizer #1? (f) How many ways are there to do two sessions of spraying, where each plant receives at most two doses total?arrow_forwarda) x(t) = rect(t − 3) b) x(t) = −3t rect(t) . c) x(t) = 2te 3u1(t) d) x(t) = e−2|t| 2. Sketch the magnitude and phase spectrum for the four signals in Problem (1).arrow_forward
- Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,
