Summer 2006; CS/SE 4340.

081, Computer Architecture

Class Tuesdays and Thursdays 1:00 - 3:45 PM in ECSS 2.305

Instructor G. R. Dattatreya
Office: ECSS 4.208
Office Hours: Tuesdays and Thursdays 11:30 - 12:30 PM
Phone: 972-883-2189
email: datta@utdallas.edu
Course websites: WebCT and www.utdallas.edu/∼datta/CS4340/su06

TA TBA

Text Book M. M. Mano and C. R. Kime, Logic and Computer Design Fundamen-
tals. Prentice Hall, 2004.

Reference G. R. Dattatreya, “A systematic approach to teaching binary arith-

metic in a first course,” IEEE Trans. Education, vol. 36, pp. 163 -
168, Feb. 1993. Detailed version available in pdf form on course website

Evaluation Midterm: 30%; Thursday June 15, 2006; 1:00 - 3:00 PM; class room
Final: 30%; Thursday, July 20, 2006, 1:00 - 3:00 PM, class room
The Final Exam is not comprehensive.
Design Project/s: 20%
Home work: 20%

Objectives To study topics leading to the understanding and ability to design a

computer, starting from elementary Boolean algebra.

Topics Relevant sections from the text book (and from Course Website notes):
Binary arithmetic: Section 1-2, 1-3, and Course Website notes on Bi-
nary Arithmetic. Most of Chapter 2. Selected topics from Chapters 3
through 12. Topics will be selected to facilitate a systematic develop-
ment of concepts and hardware blocks leading to the design of a simple
computer including a microprogrammed control unit. Topics such as
HDL, Verilog, and other digressions in the text book can be omitted.

Prerequisite CS 2305 Discrete Mathematics for Computing I

The following topics are assumed to be known to students:
 1. Representation of positive integers by Binary, Octal, and Hex-
adecimal numbers.
2. Representation of signed integers in sign-magnitude, 1’s comple-
ment and 2’s complement notation.
3. Addition and subtraction of positive binary integers.
4. Boolean variables and Boolean operations.

Overview This is a first course on Computer Architecture. We will first study rep-
resentation of fixed point fractions with binary numbers and logically
develop procedures for arithmetic operations. We will then take up
Boolean Algebra Logic Gates, Combinational, and Sequential Circuits.
Emphasis will be on Algebraic and Map minimization of Combina-
tional functions and on the design of sequential circuits. We also study
some IC building blocks such as Decoders, Multiplexers, Binary Coun-
ters, Flip-Flops, Registers, Random-Access Memories, and Read-Only
Memories. These building blocks will be frequently used in the design
of computers. We then study elementary Register Transfer and Micro
operations which constitute the steps of all the complex computer op-
erations. Viewed individually, these micro operations are no different
from the combinational and sequential operations. But collectively,
they form a basis for representing any complex computer operation
as a sequence of micro operations. We will then be ready to study
the organization and design of a simple computer and to develop the
concept and details of microprogrammed control unit. We study the
important Stack organization, a variety of powerful instruction formats,
and addressing modes. We conclude the course with a study of some
ways of organizing Input-Output, and the use of Interrupt to achieve
multi-programming.

Important Students should be aware of academic dishonesty policies.