Topic: Signed Binary Numbers; Characters, Text, and ASCII; Boolean Logic, and Gates and Circuits
Related Reading: Class notes and Chapter 4
For some of the problems in this assignment we will utilize the Logic Simulator Software. You will need to have an Internet connection to run this software.
Complete Lab 7.1 associated with the Logic Simulator software. This lab walks you through the use of their Logg-O software, which we will be using for this assignment.
Complete Lab 7.2 associated with the Logic Simulator software. This lab lets you start building some interesting circuits.
You are allowed to submit your assignment via email, but if you choose to do so, you must bring a hardcopy of your assignment along with a completed cover sheet to the instructor at the next class. (Note: Do not email the instructor any .zip file attachments, as SLU's email may not deliver these emails, i.e. the instructor may not receive your email.)
Convert the decimal number 57_{10} into its 8-bit signed binary representation.
Show your work.
Convert the decimal number -86_{10} into its 8-bit signed binary representation.
Show your work.
Given the following bitstring: 10111001
What decimal number does it represent if interpreted as an 8-bit unsigned number?
What decimal number does it represent if interpreted as an 8-bit signed number?
Show your work.
The following text is represented in ASCII (characters are in hexadecimal). Translate the ASCII into the corresponding English text.
4E 65 65 64 20 61 73 70
69 72 69 6E 20 79 65 74
3F 00
Draw the circuit diagram for the Boolean logic equation: (AB + C)D
Note: If you wish to use the Windows snipping tool (or similar screen capture tool), you may use the Logic Simulator software to construct the circuit and then include your screen capture of the circuit in your answer. (You have to use a screen capture tool; trying to print the web page unfortunately doesn't work.)
For the Boolean logic equation BC + (C + B):
For the circuit in Exercise #62 at the end of Chapter 4 (p. 115):
Using truth tables, show that the answer for Exercise #12 (on p. 112 at the end of Chapter 4) is TRUE.
In other words, use truth tables to show that (AB) is equivalent to A + B