CMSC 2100 Logic and Switching Theory
Welcome
Catalog Description
Course Outcomes
Instructor
Text
Grades
Homework
Tests
Cheating
Using AI
Attendance
Disabilties
Title IX
PennWest Policies
Course Outline
Notes
Outcomes
Course Outcomes
Perform numerical conversions of any base.
Identify and convert various non-weighted codes.
Identify and convert various weighted codes.
Perform binary arithmetic operations.
Identify functional components.
Form combinational networks and expressions.
Construct network diagrams.
Convert between normal and standard Boolean forms.
Identify and apply Boolean connectives.
Apply combinational network analysis and synthesis.
Apply the Karnaugh Map minimization technique.
Apply the Quine-McCluskey minimization technique.
Minimize switching functions with don't care states.
Translate networks into all NAND or all NOR logic.
Create timing diagrams for sequential networks.
Form state transition tables and diagrams.
Perform analysis and synthesis of latches and flip-flops.
Perform analysis and synthesis of sequential networks.
Perform analysis and synthesis of asynchronous networks.
Identify encoders, decoders, transcoders, multiplexers, demultiplexers, ROMs and PLAs.
Revised Spring 2006