CSCE 211: DIGITAL LOGIC DESIGN

 

Catalog Description:

211—Digital Logic Design. (3) (Prereq: MATH 141 or 174) Number systems, Boolean algebra, logic design, sequential machines. 

 

Prerequisites By Topic:

Introductory calculus or discrete mathematics

 

Textbook and Other Required Material:

Digital Logic Circuit Analysis & Design, Victor P. Nelson, H. Troy Nagle, Bill D. Carroll, and J. David Irwin, Prentice-Hall, Inc, Englewood Cliffs, New Jersey, 1995.

Prototype board and TTL components

 

Computing Platform: None

 

Course Objectives: {Assessment Methods Shown in Braces}

1.       Represent numbers and perform arithmetic in bases 2, 8, 10, and 16 {tests, homework}.

2.       Encode symbols and numbers in binary codes {tests, homework}.

3.       Add and subtract using 2’s complement code {tests, homework}.

4.       Evaluate and simplify logical functions using Boolean algebra {tests, homework}.

5.       Represent logical functions in Canonical form and with AND, OR, NOT, XOR, NAND, NOR logic gates{tests, homework }.

6.       Analyze and design combinatorial circuits{tests, homework, circuits}.

7.       Simplify combinatorial circuits using Karnaugh maps{tests, homework, circuits}.

8.       Implement functions with NAND-NAND and NOR-NOR logic {circuits}.

9.       Analyze and design modular combinatorial logic circuits containing decoders, multiplexers, demultiplexers, 7-segments display decoders and adders {tests, homework, circuits}.

10.   Use the concepts of state and state transition for analysis and design of sequential circuits {tests, homework}.

11.   Use the functionality of flip-flops for analysis and design of sequential circuits {tests, homework, circuits}.

 

Topics Covered:

1.       Number Systems, unsigned, and signed (two’s complement) arithmetic.

2.       Boolean Algebra

3.       Switching functions, canonical forms in both sum-of-products and product-of-sums

4.       Representation and simplification of switching functions with K-maps

5.       Medium-scale-integrated circuits (decoders, multiplexers, adders, 7-segment displays)

6.       Functional description of flip-flops (J-K, D, and T)

7.       Analysis and design of sequential circuits

 

Laboratory Projects:

Hardware implementation of several logic circuits

 

Syllabus Flexibility: Low.  The Undergraduate Committee approves the choice of textbook and syllabus. 

 


Relationship of Course to Program Outcomes:

The contribution of each course objective to meeting the program outcomes is indicated with the scale:
3 = major contributor, 2 = moderate contributor, 1 = minor contributor.  Blank if not related.










Course Objectives

Program Outcomes

1. Logic & Math

2. Computing Fundamentals

3. Apply Computing Principles

4. Work on teams

5. Communicate Effectively

6. Liberal arts & Soc. Sciences

7. Basic Science and Lab Procedures

8. Learn New Tools & Processes

9. Employed upon Graduation

10. Application Area

11. Electronics and Digital Sys Design

1. Represent numbers

1

3

 

 

 

 

 

 

 

 

 

2. Encode symbols and numbers

1

3

 

 

 

 

 

 

 

 

 

3. Two’s complement system

2

3

 

 

 

 

 

 

 

 

 

4. Evaluate and simplify functions

 

3

 

 

 

 

 

3

2

 

3

5. Represent functions with gates

 

3

 

 

 

 

 

1

1

 

3

6. Analyze and design circuits

 

3

 

 

 

 

1

2

2

 

3

7. Simplify combinational circuits

2

3

 

 

 

 

 

3

2

 

3

8. Implement functions

 

3

 

 

 

 

1

 

3

 

3

9. Design logic circuits with MSI devices

 

3

 

 

 

 

 

 

2

 

3

10. State transition analysis

 

3

 

 

 

 

 

2

1

 

2

11. Flip-flops for sequential design.

 

3

 

 

 

 

 

1

1

 

3

Estimated CSAB Category Content:

Algorithms:                                                         1 hr

Data Structures:                                                  0

Software Design:                                                0

Concepts of Programming Languages                  0

Organization and Architecture                             2 hr

Oral and Written Communication: none

Social and Ethical Issues: none

Theoretical Content:

1.       Number Systems, unsigned, and signed (two’s complement) arithmetic.

2.       Boolean Algebra

3.       Switching functions, canonical forms in both sum-of-products and product-of-sums

Analysis and Design:

1.       Representation and simplification of switching functions with K-maps

2.       Medium-scale-integrated circuits (decoders, multiplexers, adders, 7-segment displays)

3.       Functional description of flip-flops (J-K, D, and T)

4.       Analysis and design of sequential circuits

Class/Laboratory Schedule:

Lecture:                3 periods of 50 minutes or 2 periods of 75 minutes per week

Course Coordinator: Larry Stephens

Modification and Approval History

Initial description, April 1999

Revised January 2001