CS281 Introduction to Computer Architecture (3 hours)

Course Description

This course provides an introduction to basic digital design with an emphasis on computer architecture. Students that complete the course with a B or better will understand how simple microprocessors can be built from basic electrical components such as resistors, transistors, and diodes. The detailed course outline below shows what topics will be covered.

Prerequisite CS191 Discrete Mathematics I

Instructor

Rohini Lingambhotla
E-mail: rvlhfb@umkc.edu
Office Hours: Tuesday 2:00pm-3:30pm, or by appointment

Textbook

Principles of Digital Design, Daniel D. Gajski, Prentice-Hall, 1997.

Course Outline

• Digital Systems
• Digital Vs. Analog Systems
• Synchronous Vs. Asynchronous Systems
• Data Types and Representations
• Positional Notation
• Number Systems
• Number Systems and Conversions
• Binary to Decimal
• Decimal to Binary
• Binary - Hex - Octal
• Addition and Subtraction
• Base-2
• Base-r
• Representing Negative Numbers
• Signed Magnitude
• One's Complement
• Two's Complement
• Floating Point Numbers
• Binary Coded Decimal (BCD) Numbers
• Digital Design Fundamentals
• Digital Logic
• Truth tables
• Boolean Algebra
• Gates (Introduction)
• Implementation Vs. Representation
• Boolean Algebra
• Theorems of Boolean Algebra
• Algebraic Manipulation
• Forms of Boolean Expressions
• Minterms, Maxterms
• Canonical Forms
• Standard Form
• Sum of Products (SOP), Product of Sums (POS)
• Two-Level Boolean Expression Simplification
• Karnaugh Maps
• Quine-McCluskey Method
• Hazards and Glitches
• Timing Diagrams
• Basic Electrical Components
• Voltage, Current, Resistance
• Resistors, Capacitors, Transistors
• SSI, MSI, LSI, VLSI
• Gates
• Digital Logic Families: TTL, CMOS
• Implementing Boolean Expressions
• Logic Circuit
• Fan-in, Fan-out
• Positive and Negative Logic
• Combinational Logic
• Adders
• ALU
• Multiplexer or Selector
• Demultiplexer or Decoders
• Priority Encoders
• Comparators
• Tri-State and Open-Collector Gates
• Read Only Memories (ROM)
• Shifter
• Programmable Logic
• PALs
• PLAs
• Sequential Logic
• Circuits with Feedback
• State, Clocks, Setup and Hold Time
• R-S Latch
• Edge-Triggered Flip-Flops: J-K, D, T
• Analysis of Sequential Logic Circuits
• Finite-State-Machine Model of Sequential Logic Circuits
• Synthesis of Sequential Logic Circuits
• State Minimization, Optimizations
• Computer Organization
• Registers
• RAM
• Datapaths
• Control Unit Design

Processor Design

Academic Integrity:

Student Conduct

Penalties for academic dishonesty will be severe.
Academic dishonesty includes cheating, plagiarism or sabotage. Cheating includes, but is not limited to:

1. Unauthorized assistance in taking quizzes, tests or examinations;
2. Dependence upon the aid of sources beyond those authorized by the instructor in solving problems or carrying out other assignments;
3. Acquisition or possession without permission of tests or other academic material belonging to a member of the faculty or staff;
4. Knowingly providing any unauthorized assistance to another student on quizzes, tests or examinations.

Plagiarism includes, but is not limited to:

1. Use by paraphrase or direct quotation of the published or unpublished work of another person without fully and properly crediting the author with references;
2. Unacknowledged use of materials prepared by another person or agency engaged in the selling of term papers or other academic materials;
3. Unacknowledged use of original work/material that has been produced through collaboration with others without release in writing from collaborators.

Sabotage includes but is not limited to, the unauthorized interference with, modification of, or destruction of the work or intellectual property of another member of the University community.
Other conduct that is subject to disciplinary action includes the actual or attempted theft or other abuse of computer time, including but not limited to:

1. Unauthorized entry into a file to use, read or change the contents, or for any other purpose;
2. Unauthorized transfer of a file; (iii) unauthorized use of another individual's identification and password;
3. Use of computing facilities to interfere with the work of another student, faculty member or University official;
4. Use of computing facilities to interfere with normal operation of the University computing system;
5. Knowingly causing a computer virus to become installed in a computer system or file.

For this class, work turned in must be original and represent an individual effort unless otherwise indicated.

IF DUPLICATE COPIES OF PROJECTS OR HOMEWORKS ARE RECEIVED, AN AUTOMATIC GRADE OF ZERO WILL BE GIVEN TO ALL PARTIES INVOLVED. Code which is not your own must be referenced (e.g. when using code libraries). Persons observed cheating on tests will forfeit the test and receive a zero for that test. Names of persons involved in any of these incidents will be forwarded to the campus Primary Administrative Officer. Those students will be subject to sanctions as outlined in the general catalog. Sanctions may result in dismissal from the University.

Incompletes:

Incompletes are not given for any reasons.

Your final grade will be based on the results of quizzes and the 3 tests.

TYPE	APPROXIMATE NUMBER	POINTS	PERCENTAGE
Quizzes	10	10	25%
Tests	3, including Final exam	100	75%

Your final grade will be based on a straight scale:

Percentage	Grade	Percentage	Grade	Percentage	Grade
93 - 100	A	80 - 82	B-	67 - 69	D+
90 - 92	A-	77 - 79	C+	63 - 66	D
87 - 89	B+	73 - 76	C	60 - 62	D-
83 - 86	B	70 - 72	C-	0 - 59	F