Please give a explanation 1. Use the "Decoder Ring" in Figure 3.6.2 to perform the following arithmetic.Indicate whether the result is "right" or "wrong".Figure 3.6.2.signedintegers-3191a. Unsigned integers: 1 + 3b. Unsigned integers: 3 + 4c. Unsigned integers: 5 + 6d. Signed integers: (+1) + (+3)e. Signed integers: (-3) - (+3)f. Signed integers: (+3) - (+4)000CbitpatternsV188812unsignedintegers+3wwwwwwwin-context

For Unsigned integer: In the following you find the detail idea about what you have to when want to…

1. Use the "Decoder Ring" in Figure 3.6.2 to perform the following arithmetic. Indicate whether the result is "right" or "wrong". Figure 3.6.2. signed integers 6110 111 101 a. Unsigned integers: 1 + 3 b. Unsigned integers: 3 + 4 c. Unsigned integers: 5 + 6 d. Signed integers: (+1) + (+3) e. Signed integers: (-3) - (+3) f. Signed integers: (+3) - (+4) 0 000 I C bit patterns V I 100 001 011 unsigned integers 8192 - +2 3 in-context

1. Use the "Decoder Ring" in Figure 3.6.2 to perform the following arithmetic. Indicate whether the result is "right" or "wrong". Figure 3.6.2. signed integers 6110 111 101 a. Unsigned integers: 1 + 3 b. Unsigned integers: 3 + 4 c. Unsigned integers: 5 + 6 d. Signed integers: (+1) + (+3) e. Signed integers: (-3) - (+3) f. Signed integers: (+3) - (+4) 0 000 I C bit patterns V I 100 001 011 unsigned integers 8192 - +2 3 in-context

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter4: Making Decisions

Section: Chapter Questions

Problem 8RQ

See similar textbooks

Similar questions

.Perform octal arithmetic operation to get the sum of this two numbers: (32.1)base 10 + (A1.4)base 12. Express the sum in base 8
Part 2: Sequential Multiplier 1. You are asked to multiply two binary numbers using the sequential multiplier discussed in the class. These two binary numbers are 1101, and 10001. a. Show your work for multiplication, step by step. b. How many bits do you need to store the result?
1. Simplify the follow expression algebraically: F 3D A. B.С + A.В.С + А. В.С + А.В.С 2. Write the Boolean equation directly from the following circuit. A B 3. Create the truth table for the circuit above. 4. Write the Boolean equation from the truth table. 5. Consider the following equation. Z = A.C+ B 6. Create a truth table from the above Z equation. Does the truth table match the answer from question 3? 7. Try to rework equation from question 2 using the Boolean theorems, identities, and laws to get it close to equation from question 4. NOTE: You will probably not get it to match exactly. To do so would involve quite a bit foresight, intuition, and sleights of hand. 8. Answer by true or false for each of the following statements: a. Any logical circuit could be converted to use NAND gates only. b. Any logical circuit could be converted to use NOR gates only. c. Any logical circuit could be converted to use AND gates only.
A. Add the two pairs of binary numbers X = 00101 and Y = 10111and show the results in binary. (Be sure to show the carry as you add.) Let us the call the result Z = X +Y. Carries 0010 1 (X) + 10111 (Y) (Z) B. Convert the binary integer 1010101011 to decimal. C. Convert decimal integer 1393 to binary. Show all your work, quotients, and remainders, and then write down the answer. D. Convert decimal integer 1393 to hexadecimal. You can use the answer from part (C) or could use calculator to do division. Show you work either way.
Example 1: input1: 5 input2: (-2, 3, -1, -4, -2) Output: 8 Explanation: Since Fred can flip consecutive cards only once, he chooses to flip the last three which results in the maximum sum (-2 +3 +1 + 4 +2), i.e., 8. Therefore, 8 is returned as the output. Example 2: put1: 5 input2: (-1, 2, 3, 4, -5} Output: 13 Explanation: Since Fred can flip consecutive cards only once, he chooses to flip the last card, results in the maximum sum (-1 +2 + 3 +4 +5), i.e., 13. Therefore, 13 is returned as the output.
4. Two multiplexers are connected as shown below. The inputs (A, B, C) and the output F are 4-bits and (D and E) are one-bit. The numbers inside the multiplexers correspond to the value of the selectors D and E which will decide which input A, B or C will pass to the output F (For example, If D = 0 and E = 0 then C will be selected to pass to F). C 0 0 B 1 A D E Write a VHDL description of the circuit.
Topic: Boolean Algebra will give high rating if correct answers ty!!
Q2. (a) Convert the following numbers from one base to another. . (111.1011011), = (?)hs (2) ii. (512.5625)10 = (?)h (2) i. (153.47), = (?)1e (2)
Problem 4: Convert the infix expression below into its equivalent prefix expression. a + b/c*d*(e +f) - g/h Note: Use space to separate the tokens in your answer! * Your answer Problem 5: Convert the infix expression below into its equivalent postfix expression. a + b/c*d*(e + f) -g/h Note: Use space to separate the tokens in your answer! * Your answer Problem 6: Given an initially empty stack, what will the resulting stack look like after performing the following: Push 5, Push 6, Push 12, Pop, Pop, Push 2, Pop, Push 8, Push 9, Pop Note: Use space to separate the elements of the stack! * Your answer
To be completed after lecture on Monday or after watching the first Floating Point video: Take the values 12345 x 10-12 and -12345 x 1037 And encode them in a system that uses the format SEEMMMMM with the following biases: Bias of 47, 25, and 32. (you will have six values when you are done)
The table below defines the action of a switch that governs the three lights L, M, N. Design acircuit to implement the switch as a binary device encoding the switch positions in each of the following ways. Minimize the output expressions, using “don’t care” conditions where they help
Q1/ B. Apply Addition and Multiplication: * i. (101)2 with (011)2 ii. (7)10 with (2)10 iii. (1000), with (011)2 iv. (12)10 with (15)10