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 b
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 th
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 expre
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 pr
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 comp
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 th
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 express
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)
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 exp
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?
Wh
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
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 o
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 impleme
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 connect
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 +
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 o
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
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 pa
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-c
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 sim
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.
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 onl
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 a
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
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). Li
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
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 i
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 mo
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 tw
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 instruct