Course: CSC120 First Term: 2019 Fall
Final Term: Current
Final Term: 2024 Summer
|
Lec + Lab 4.0 Credit(s) 6.0 Period(s) 6.0 Load
Credit(s) Period(s)
Load
Subject Type: AcademicLoad Formula: T - Lab Load |
MCCCD Official Course Competencies | |||
---|---|---|---|
1. Represent numbers in the binary, octal, hexadecimal, and decimal systems. (I)
2. Perform fundamental arithmetic operations within each number systems. (I) 3. Apply postulates and theorems of Boolean algebra to switching functions. (II) 4. Construct and interpret truth tables. (II) 5. Write switching functions in canonical form. (II) 6. Simplify switching functions through algebraic manipulation, DeMorgan`s theorem, and Karnaugh maps. (II, III) 7. Implement switching circuits with SSI elements (AND gates, OR gates, and inverters), MSI elements (multiplexors, decoders, and bit slices), ROMs and PLAs. (IV) 8. Use synchronous sequential circuits with latches, master-slave, edge-triggered flipflops, and counters. (V) 9. Design synchronous sequential circuits by utilizing Mealy and Moore models for clocked sequential circuits, state transition tables and diagrams, and simplification techniques. (V) 10. Use Register Transfer Logic to describe the information flow between registers. (VI) 11. Develop algorithms for the control of shift registers, counters, and other register transfer-level components. (VI) | |||
MCCCD Official Course Competencies must be coordinated with the content outline so that each major point in the outline serves one or more competencies. MCCCD faculty retains authority in determining the pedagogical approach, methodology, content sequencing, and assessment metrics for student work. Please see individual course syllabi for additional information, including specific course requirements. | |||
MCCCD Official Course Outline | |||
I. Numbering systems
A. Properties of discrete versus continuous systems B. Binary, octal, hexadecimal, and decimal representation C. Conversion between radices D. Signed, one`s, two`s complement representation E. Addition and subtraction II. Boolean and switching algebra A. Huntington`s postulates B. DeMorgan`s theorem C. Truth tables D. Sum of Products (SOP) and Products of Sums (POS) canonical forms III. Simplification of switching functions A. Algebraic manipulation B. Karnaugh maps C. Handling don`t care conditions IV. Implementation of switching circuits A. Random logic in Small Scale Integration (SSI) B. Institute of Electrical and Electronics Engineers (IEEE) standard symbols C. Mixed mode logic D. Use of Medium Scale Integration (MSI) elements: multiplexors, decoders, bit slices E. Synthesis using Read-Only Memory (ROM) and Programmable Logic Array (PLA) V. Synchronous sequential circuits A. Latches, master-slave, and edge-triggered flip-flops B. Counters C. Mealy and Moore models for clocked sequential circuits D. State transition tables and diagrams E. Simplification techniques VI. Register level design A. Shift registers and counters B. Control flow specification C. Control states and control functions | |||
MCCCD Governing Board Approval Date: May 28, 2019 |