|
May 04, 2024
|
|
|
|
2022-2023 Catalog [ARCHIVED CATALOG]
|
ENGR 272 - Introduction To Digital Logic Design PREREQUISITES: ENGR 251 - Electrical Circuits I . PROGRAM: Engineering CREDIT HOURS MIN: 4 LECTURE HOURS MIN: 3 LAB HOURS MIN: 2 DATE OF LAST REVISION: Spring, 2019
Introduces digital devices and their applications in combinational and sequential circuits. Provides instruction in methods of design of digital circuits and systems. Topics include binary arithmetic, Boolean algebra, K-maps, programmable logic, decoders, displays, encoders, multiplexers, demultiplexers, latches, flip-flops, registers, and finite state machines. Computer-Aided-Design programs are used to design, simulate, and optimize circuits.
MAJOR COURSE LEARNING OBJECTIVES: Upon successful completion of this course the student will be expected to:
- Derive a Boolean expression for a digital circuit.]
- Design a digital circuit given the input, output and description of the system.
- Design sequential logic and combinational logic digital circuits.
- Design digital circuits using various digital logic building blocks such as multiplexers and Flip-Flops.
- Derive a finite state machine, implement it and optimize it, given a description of the target digital system.
- Reverse engineer a digital circuit. That is, given a digital circuit, determine its function.
COURSE CONTENT: Topical areas of study include -
- ntroduction: switches, numbers, binary arithmetic, ICs, TTL & CMOS. (1 class)
- Logic operations; truth tables; logic gates. (2 classes)
- Boolean algebra and canonical forms, DeMorgan’s Theorem. (1 class)
- K-maps; minimization of logic functions. (1 class)
- Multilevel combinational logic. (1 class)
- Multiplexers, Demultiplexers, decoders, encoders. (1 class)
- Time response and hazards. (1 class)
- Programmable logic. (1 class)
- Tri-state and open collector gates; combinational logic case study. (1 class)
- Latches and Flip-Flops (1 class)
- Finite state machines, counters, implementation and optimization (2 classes)
- Arithmetic Unit: Adders/sIubtractors/multipliers. (1 classes)
- Exams/Quizzes. (2 classes)
GRADING POLICY
A |
90-100 |
B |
80-89 |
C |
70-79 |
D |
60-69 |
F |
0-59 |
Course Addendum - Syllabus (Click to expand)
|
|