CS/EE 260 Digital Computers: Organization and Logical Design
Quiz 1
Jon Turner
1/27/04
1. (5 points) Add the six bit unsigned binary numbers 011001 and 101110. What is the six bit
sum?
Does this six bit addition result in an arithmetic error?
Suppose the
CS/EE 260 Digital Computers: Organization and Logical Design
Quiz 2
Jon Turner
1/30/03
1. (5 points) Draw a circuit that directly implements the logic function (A + C)B + D(AB + C). Do not simplify the expression first.
-1-
2. (5 points) Give expressions
CS/EE 260 Digital Computers: Organization and Logical Design
Mid-Term Exam
Jon Turner
3/13/03
1. (6 points) List all the minterms for the expression (B + A)C + AC + BC.
List the maxterms for the expression.
-1-
2. (5 points) Show that the following Boolea
CS/EE 260 Digital Computers: Organization and Logical Design
Quiz 1
Jon Turner
1/17/02
1. (4 points) What is the pattern of bits used to represent the integer 937 in BCD?
2. (6 points) If our basic processor begins execution with the first instruction sho
CS/EE 260 Digital Computers: Organization and Logical Design
Mid-Term Exam
Jon Turner
2/28/02
1. (5 points) Compute the difference: 011011 001101 using six bit binary arithmetic, by taking the 2s complement of the second operand and then adding.
2. (10 po
CS/EE 260 Digital Computers: Organization and Logical Design
Mid-Term Exam Solutions
Jon Turner
2/28/02
1. (5 points) Compute the difference: 011011001101 using six bit binary arithmetic, by taking the 2s complement of the second operand and then adding.
CS/EE 260 Digital Computers: Organization and Logical Design
Mid-Term Exam Solutions
Jon Turner
3/13/03
1. (6 points) List all the minterms for the expression (B + A)C + AC + BC. Expanding the expression gives BC + AC + AC + BC = ABC + ABC + ABC + ABC + A
CS/EE 260 Digital Computers: Organization and Logical Design
Final Exam
Jon Turner
4/30/02
1. (5 points) Simplify the following expression using the basic identities of Boolean algebra. (A + B)C + AB)BD
-1-
2. (14 points) Find a minimum sum of products ex
CS/EE 260 Digital Computers: Organization and Logical Design
Final Exam
Jon Turner
5/6/03
1. (10 points) How many simple gates of each type (and, or, inverter) are needed to directly implement the expression A(B+CD)+(A+CD).
Find the simplest equivalent su
CS/EE 260 Final Exam
May 4, 2001
You may have one sheet of notes. No calculators. Write in the spaces provided. Be neat.
1. (4 points) Assuming 8 bit words, what is the binary representation of 79?
What is the hexadecimal representation of 79?
What is the
CS/EE 260 Final Exam Solutions
May 4, 2001
You may have one sheet of notes. No calculators. Write in the spaces provided. Be neat.
1. (4 points) Assuming 8 bit words, what is the binary representation of 79? 0100 1111 What is the hexadecimal representatio
CS/EE 260 Final Exam
Spring 2000
You may use one page of notes. No calculators. Write in the spaces provided. Be neat. 1. (10 points) Write the machine language instructions needed to implement each of the lines of pseudo-code shown below. The list of mac
CS/EE 260 Digital Computers: Organization and Logical Design
Final Exam Solutions
Jon Turner
5/6/03
1. (10 points) How many simple gates of each type (and, or, inverter) are needed to directly implement the expression A(B+CD)+(A+CD). 3 ANDs, 3 ORs and 2 i
CS/EE 260 - Exam 2
4/23/2001
1. (10 points) Draw a state diagram for the sequential circuit shown below.
W D Q A >C Q D E Clk Q
Y Z
B
>C Q
-1-
2. (10 points) Answer the following questions, in connection with the circuit in problem 1. Assume that the flip
CS/EE 260 Digital Computers: Organization and Logical Design
Final Exam Solutions
Jon Turner
4/30/02
1. (5 points) Simplify the following expression using the basic identities of Boolean algebra. (A + B)C + AB)BD = (AC + BC + AB)BD = ABCD + ABD = ABD(C +
CS/EE 260 - Exam 1 Solutions
3/5/2001
1. (6 points) Using 40 bits, how many different integers can be represented in (a) binary 2 40 (b) BCD 10 10 (c) 8-bit ASCII? 10 5 2. (12 points) The simulation output on the next page is from an execution of the simp
CS/EE 260 - Exam 2 Solutions
4/23/2001
1. (10 points) Draw a state diagram for the sequential circuit shown below.
W D Q A >C Q D E Clk Q
Y Z
B
>C Q
AB 00 01 10 11 00 00 01 01 10 10 11 11
EW D ADB 0x 00 0x 00 0x 00 0x 00 10 01 11 11 10 11 11 01 10 00 11 1
CS/EE 260 - Exam 1
3/5/2001
1. (6 points) Using 40 bits, how many different integers can be represented in (a) binary,
(b) BCD,
(c) 8-bit ASCII?
-1-
2. (12 points) The simulation output on the next page is from an execution of the simple processor introdu
CS/EE 260 Digital Computers: Organization and Logical Design
Quiz 1
Jon Turner
1/24/03
1. (4 points) What is the hexadecimal representation of the decimal value 189?
Express -42 as an eight bit twos-complement value.
-1-
2. (6 points) If our basic process
CS/EE 260 Digital Computers: Organization and Logical Design
Quiz 2
Jon Turner
1/24/02
1. (10 points) How many simple gates of each type are needed to implement the expression shown below (without simplification)? (A + BC)(B + CD) + A(CD + BCD)
Use Boolea
CS/EE 260 Digital Computers: Organization and Logical Design
Quiz 3
Jon Turner 1/31/02
1. (5 points) Find the complement of the expression BC + (A + C)B D and write it in minimal sum-of-products form.
2. (5 points) Simplify the logic function F(A,B,C) = m
CS/EE 260 Digital Computers: Organization and Logical Design
Final Exam
Jon Turner
5/12/04
1. (16 points) Find the simplest sum-of-products equivalent to the expression below using
Boolean algebra only.
(ABD + BCD + BC D + AC )
Show how your simplified ve
CS/EE 260 Digital Computers: Organization and Logical Design
Final Exam Solutions
Jon Turner
5/12/04
1. (16 points) Find the simplest sum-of-products equivalent to the expression below using
Boolean algebra only.
(ABD + BCD + BC D + AC )
= (A+B+D)(B+C +D)
CS/EE 260 Digital Computers: Organization and Logical Design
Midterm Solutions
Jon Turner
3/4/04
1. (8 points) Draw a logic diagram that directly implements the expression
A(B + CD) + (C + (A+B)D)
(do not simplify the expression first).
How many transisto
CSE 260 Digital Computers: Organization and Logical Design
Final Exam Solutions
Jon Turner
5/11/05
1. (8 points) The expression AD + (B + C )(C + D ) has the minterm ABCD and the maxterm
(A+B+C+D). List four more of its minterms and four more of its maxte
CS/EE 260 Digital Computers: Organization and Logical Design
Quiz 9
Jon Turner
4/4/02
1. (10 points) The state transition diagram shown below is for a simpler version of the arbiter circuit discussed in problem set 9. In this version, there is a fixed pri
CS/EE 260 Digital Computers: Organization and Logical Design
Quiz 10
Jon Turner
4/11/02
1. The simulation output below shows the control signals from the basic processor during the execution of five instructions. Each instruction is "boxed" for clarity. F
CS/EE 260 Digital Computers: Organization and Logical Design
Quiz 6
Jon Turner
3/27/03
1. (10 points) Is the sequential circuit defined by the VHDL code shown below a Mealy model circuit or a Moore model circuit (circle one or the other)? Draw a state dia
CS/EE 260 Digital Computers: Organization and Logical Design
Quiz 7
Jon Turner 4/10/03
1. In this problem, you are to complete the VHDL module below, so that it implements a sequential circuit with two states, up and down. If the circuit is in the up stat
CS/EE 260 Digital Computers: Organization and Logical Design
Quiz 8
Jon Turner 4/17/03
1. The simulation output below is from the basic processor running a program. The boxes outline selected instructions. Identify each of these instructions that are bein