|
Department and Course Number |
CEG 260 |
Course Coordinator |
Jack Jean |
|
Course Title |
Digital Computer Hardware/Switching Circuits |
Total Credits |
4 |
Topics include switching algebra and switching functions, logic design of combinational and sequential circuits using TTL, combinational logic design with MSI and LSI, busing, storage elements, and instrumentation. 3 hours lecture, 2 hours lab. Prerequisite: CS 142 or 240 or CEG 220 or EGR 153.
Text Books
M. Morris Mano and Charles R. Kime, Logic and Computer Design Fundamentals, 2nd Edition, Prentice-Hall, 2000, ISBN 0-13-012468-0
Home Page
www.cs.wright.edu/people/faculty/jjean/course/260/
The student should have learned the following:
1. Fundamentals
of Boolean algebra: axioms, theorems and their application to the design of
logic circuits.
2. Analysis
of logic circuits.
3. The
design and testing of logic circuits using SSI and MSI components.
4. Optimization
techniques to minimize gate count, IC count, or time delay.
5. The
design and use of simple memory devices and sequential circuits.
6. Decoders,
multiplexors, and bus logic.
The student should be able to apply the concepts above to the following:
1. Analyze
and optimize logic circuits, using an algebraic approach.
2. Implement
logic functions using NAND and NOR gates.
3. Minimize
logic functions through Boolean algebra and/or Karnaugh maps, to either
minimal SOP or POS form.
4. Develop
larger logic designs, refining them from functional block diagrams to an
implementation using standard SSI and MSI components.
5. Analyze basic sequential circuits.
6. Use accepted standards to document logic designs.
1. Structured,
modular algorithm design
2. High-level
programming language implementation of algorithms.
3. Verification
and testing of computer programs.
4. Intermediate Algebra.
|
Week |
Contents |
Read |
|
1 |
Intro to digital design, number systems, gates |
1.1-1.5, 2.1 |
|
2 |
Boolean algebra and combinational circuit design |
2.2-2.3 |
|
3 |
Boolean algebra, Karnaugh maps |
2.4 |
|
4 |
MIDTERM #1; Karnaugh maps |
2.5 |
|
5 |
Karnaugh maps, circuit design and analysis |
2.6-2.8, 3.1-3.4 |
|
6 |
Decoders, encoders, and multiplexers |
3.5-3.7 |
|
7 |
Latches and flip-flops; MIDTERM #2 |
4.1-4.3 |
|
8 |
Flip-flips and IC Counters |
5.4-5.6 |
|
9 |
IC Counters |
5.4-5.6 |
|
10 |
Binary arithmetic, parity, adders, subtractors, and comparators |
3.8-3.10 |
There are seven projects for the course for students to familiarize with the usage of SSI and MSI logic gates, test instruments, a schematics editor, and a simulator. Students need to solve pre-lab and post-lab questions for most of the projects. A student has to pass the laboratory in order to pass the course.
|
|
Core |
Advanced |
|
|
Core |
Advanced |
|
Data Structures |
|
|
|
Concepts of PL |
|
|
|
Algorithms |
|
|
|
Comp Organization + Architecture |
2.0 |
|
|
Software Design |
|
|
|
Other |
2.0 |
|
There are no oral/written presentations.
None.
Boolean Algebra: one week.
For most laboratory projects, in-lab and post-lab questions are raised so as to force students to analyze the experimental results.
For laboratory projects, skeletal solutions of the project, e.g., circuit diagrams, are given in the handout or by the instructor at the conceptual level in the lectures. The student needs to design further details and implement them.