10 February 2014
Exam #1a Solutions
CSE 261
NAME:
This is an open-book open-notes exam. Cell phones, computers, or anything that connects you to other
people or on-line resources are prohibited. Write all your answers on these pages. Do all the problems
w
14 April 2014
Exam #3b Solutions
CSE 261
NAME:
This is an open-book open-notes exam. Cell phones, computers, or anything that connects you to other
people or on-line resources are prohibited. Write all your answers on these pages. Do all the problems
with
In-Class Exercise 32 Solution
Class 32: 4 April 2014
HLSM Example: A 16-bit Counter
Consider the HLSM below and its datapath.
A. Devise a state transition table for an FSM controller using the following state assignment for s1s0:
Load = 00, Hold = 01, Inc
7 March 2014
Exam #2a Solutions
CSE 261
NAME:
This is an open-book open-notes exam. Cell phones, computers, or anything that connects you to other
people or on-line resources are prohibited. Write all your answers on these pages. Do all the problems
withi
In-Class Exercise 24 Solution
Class 24: 17 March 2014
1 Representing Negative Numbers: 2s-complement
Consider the following table of binary numbers. Fill in the formula for each column and each row.
Number
unsigned value =
2s-complement value =
000
001
01
In-Class Exercise 28 Solutions
Class 28: 26 March 2014
Controlling Register Transfers
The data path above is an example of a register to memory architecture. Specifically, the inputs to
memory come from a register file with four registers. To keep things
In-Class Exercise 26 Solution
Class 26: 21 March 2014
Counter Design Problem
Implement a 2-bit up-counter using D flip-flops, half adders, and multiplexers. The
Load(t)
Count(t)
Out(t+1)
1
X
In(t)
0
0
Out(t)
0
1
Out(t) + 1
Table 1: Up-counter specificatio
10 February 2014
Exam #1b Solutions
CSE 261
NAME:
This is an open-book open-notes exam. Cell phones, computers, or anything that connects you to other
people or on-line resources are prohibited. Write all your answers on these pages. Do all the problems
w
11 February 2013
Exam #1a
CSE 261
NAME:
This is an open notes and open-book exam. Cell phones, computers, or anything
that connects you to other people or online resources are prohibited. Write all your
answers on these pages. Do all the problems within 5
14 April 2014
Exam #3a Solutions
CSE 261
NAME:
This is an open-book open-notes exam. Cell phones, computers, or anything that connects you to other
people or on-line resources are prohibited. Write all your answers on these pages. Do all the problems
with
CSE 261: Digital Logic Design
Textbook: Digital Design with RTL Design, VHDL, and Verilog, 2nd Edition, Frank Vahid, Wiley, 2011
Course Calendar: SPRING 2014
Note: Subject to Change
Class Week
1
1
Date
Topic
13 Chapter 1 Introduction
January
Introduction
8 March 2013
Exam #2a
CSE 261
NAME:
This is an open notes and open-book exam. Cell phones, computers, or anything
that connects you to other people or online resources are prohibited. Write all your
answers on these pages. Do all the problems within 55 mi
3 May 2013
Final A
CSE 261
Name:
This is an open notes and open-book exam. Cell phones, computers, or
anything that connects you to other people or online resources are prohibited.
Write all your answers on these pages. Do all the problems within 120 minu
7 March 2014
Exam #2b Solutions
CSE 261
NAME:
This is an open-book open-notes exam. Cell phones, computers, or anything that connects you to other
people or on-line resources are prohibited. Write all your answers on these pages. Do all the problems
withi
15 April 2013
Exam #3a
CSE 261
NAME:
This is an open notes and open-book exam. Cell phones, computers, or anything
that connects you to other people or online resources are prohibited. Write all your
answers on these pages. Do all the problems within 55 m
In-Class Exercise 29 Solution
Class 29: 28 March 2014
Controlling Register Transfers
The data path above is an example of a register to memory architecture. Specifically, the inputs to
memory come from a register file with four registers. To keep things s
CSE 261 Digital Logic Design Spring 2014
Homework #5 Solutions with Grading Criteria (100 points)
3.1, 3.5, 3.6, 3.7, 3.10, 3.12, 3.18, 3.22
if all of the timing diagrams have no signal transaction arrow, you will lose 2 points.
3.1 (5 points)
a) 1/50,000
CSE 261 Digital Logic Design Spring 2014
Homework #3 Solutions with Grading Criteria (100 points)
2.24, 2.28, 2.30, 2.31, 2.33, 2.35, 2.45, 2.48, 2.49, 2.54, 2.55
2.24 (6 points)
a) a, b, c, d
b) a, d, a, c, b, c, d,
c) ad, ac, bcd, cd
2.28 (4 points)
F =
In-Class Exercise 35 Solution
Class 33: 11 April 2014
2s-Complement Arithmetic
Consider the base 10 problem 110 410 = -310. Convert 110, -410 and -310 into 4-bit 2s-complement form,
and derive the equivalent result in 2s-complement.
00012 + 11002 = 11012
In-Class Exercise 33 Solution
Class 33: 7 April 2014
More RTL design
Using a timer, design a system with single-bit inputs U and D corresponding to two
buttons, and a 16-bit output Q which is initially 0. Pressing the button for U causes Q to
increment, w
CSE 261 Digital Logic Design Spring 2014
Homework #10 Solutions with Grading Criteria (100 points)
5.1, 5.2, 5.5
5.1 (36 points)
Grading Criteria: 6 points for each
5.2 (30 points)
Grading Criteria: 15 points for correct states
15 points for correct state
Course Grades: Spring 2013 CSE 261
51 Students Total
Grade
Number
Range
A
5
93% - 95%
A-
4
89% - 91%
B+
5
86% - 88%
B
6
83% - 84%
B-
12
76% - 81%
C+
5
70% - 74%
C
4
66 - 68%
C-
4
59% - 63%
D
2
47% - 53%*
F
4
10% - 40%
Note: person who scored 47% average a
In-Class Exercise 31
Class 31: 2 April 2014
Datapaths from High Level State Machines
Consider the high-level state machine shown above. Drawing from the components above, create a
datapath corresponding to the high-level state machine.
1
In-Class Exercise 25 Solution
Class 25: 19 March 2014
1 Arithmetic-Logic Unit (ALU) Design
Consider the following specification for an ALU.
F1
F2
Operation
Sample output for
A = 00001111
B = 00000101
0
0
S = A (Pass A)
00001111
0
1
S = A + B (Addition)
00