{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Practice Problems

# Practice Problems - Final Exam Practice Problems This is...

This preview shows pages 1–3. Sign up to view the full content.

Final Exam Practice Problems This is not meant to be an exhaustive list of topics for the final exam, or is it intended to representative of the length of the exam. The exam may be longer or shorter. These are questions that I would ask if I were writing the exam. The real exam will be written by the TAs and thus may contain different kinds of questions, which may be harder or easier. You are responsible for all material covered in class, even if it is not mentioned here. Unless otherwise noted, .ORIG and .END pseudo-ops and the HALT or TRAP x25 instructions are not required for any code you write and may be omitted from the code provided. 1. What is the decimal value of 10001111 2 if we consider it to be an unsigned integer? What is the decimal value if we consider it to be a signed two's complement integer? 2. Write AB1D 16 in both decimal and binary. (A calculator might be handy for this one) 3. Given that A = 1, B = 0, C = 0, and (A + B).(C + D) = 1, what is the value of D? 4. The following questions apply to the figure below, a transistor-level diagram of a circuit. a) Complete the truth table for the circuit.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
C A B Q 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 b) Draw a logic gate implementation of the circuit (That is, draw the circuit using the symbols for AND, OR, NOT, NAND, and NOR gates). c) Write the equivalent Boolean algebra expression for the circuit.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 5

Practice Problems - Final Exam Practice Problems This is...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online