Department of Electrical and Computer Engineering

The University of Alabama in Huntsville

 

Spring 2005

 

EE 202-01 Introduction to Digital Logic Design

 

Course Home Page: http://www.ece.uah.edu/~jovanov/EE202/EE202.html

 

Lectures             Tuesday/Thursday 11:10 – 12:30  PM, EB240.

 

Instructor          Dr. Emil Jovanov

                              213, Engineering Building

                              Phone: 824 6632, e-mail:    jovanov@ece.uah.edu

 

Office hours      Tuesday  3 – 5 PM, Wednesday 10 – 12 AM, and by appointment.

 

Description       Engineering approaches to design and analysis of digital logic circuits. Boolean algebra, Karnaugh maps, design using MSI and LSI components, algorithmic state and machine design of sequential circuits.

 

Prerequisites   CPE112 Introduction to Computer Programming in Engineering

 

Text                     M. Moris Mano, Digital Design, 3rd edition, Prentice Hall, 2002.

 

Grading           Academic misconduct of any type will not be tolerated. Students are expected to conform to the UAH policies concerning academic misconduct as outlined in Section 8.32 of the current UAH Student Handbook. Regular class attendance and participation is expected from all students.

 

                              Homeworks                                         25%

                        Test I                                                   20%

                        Test II                                                  20%

                              Comprehensive Final Exam                   30%

                              Class Participation                                5%

 

Important         Test I:                                 Tuesday, February 8, 2005.

Dates                  Test II:                               Thursday, March 29, 2005.

                        Last day of Class:               Tuesday, April 26, 2005.

                        Final exam:                         Thursday, April 28, 2005, 11:30-2 PM.

 

Course Outline

·        Binary Systems (Chapter 1) (2 lectures 1/10 – 1/13)

·        Boolean Algebra and Logic Gates (Chapter 2) (2 lectures 1/18 – 1/20)

·        Simplification of Boolean Functions (Chapter 3) (4 lectures 1/25 – 2/3)

·        Exam I (2/8)

·        Combinational Logic (Chapter 4) (5 lectures 2/10 – 2/24).

·        Memory and Programmable Logic (Chapter 7) (6 lectures 3/1 – 3/17)

·        Exam II (3/29)

·        Synchronous Sequential Logic (Chapter 5) (4 lectures 3/31 – 4/14)

·        Registers and Counters (Chapter 6) (3 lectures 4/19 – 4/26)

·        Final Exam (4/28)

 

Homeworks and solutions: