CS 220: Computer Architecture
Course Description:
The student will learn about the various hardware components of a computer system.
Course topics include: data representation, numbering systems, Boolean algebra,
combinational logic, sequential logic, CPU layout, registers, adders, buses, and
memory devices. Prerequisites: CS 208, CS 219. 3:0:3
Learning Outcomes:
Upon completion of this course, the student should be able to:
-
Solve arithmetic problems involving different computer number systems - binary,
octal, hex, 2's complement.
-
Solve boolean algebra problems involving deMorgan's Laws, truth tables, minterms
& maxterms, Karnaugh maps.
- Design combinational circuits using gates.
- Explain some or all of these items:
- multiplexers, demultiplexers, encoders, decoders
- programmable logic arrays
- VHDL
- latches and flip-flops
- registers and counters
- clocked sequential circuits
- Design circuits using some or all of the above items.
- Explain and analyze CPU design.
- Explain and analyze memory design.
- Explain and analyze I/O device design.
Assessment Measures:
| Assessment Tool |
Linkage to Learning Outcome #: |
| |
|
| Homework Assignments: |
|
| Assign a sufficient amount of homework such that
all of the above objectives are covered. |
All |
| For each homework assignment, include short
answer questions that require the student to apply the above objectives. |
1-8 |
| For certain homework assignments, the student
will be asked to solve a problem(s) by applying mathematical principles. |
1-2 |
| For certain homework assignments, the student
will be asked to solve a problem(s) by analyzing a digital schematic. |
3-8 |
| For certain homework assignments, the student
will be asked to solve a problem(s) by designing a digital circuit. |
3-7 |
Textbooks
To view the approved textbook list, click
here.
