PCC/ CCOG / MT

Course Content and Outcome Guide for MT 121

Course Number:
MT 121
Course Title:
Digital Systems I
Credit Hours:
3
Lecture Hours:
20
Lecture/Lab Hours:
0
Lab Hours:
30
Special Fee:
$12.00

Course Description

Covers combinational logic devices and circuits. Includes basic operation of logic gates, Boolean algebra, and MSI logic devices. Labs emphasize prototyping and testing of combinational logic circuits. Prerequisites: WR 115; MTH 65. Audit available.

Intended Outcomes for the course

  • Construct, analyze and troubleshoot circuits which incorporate logic devices
  • Operate electronic test equipment: multimeters, power supplies, signal generators and oscilloscopes.
  • Read and interpret technical materials e.g. schematic diagrams and device data sheets.
  • Communicate technical information in written and oral form
  • Practice safe operating procedures.

The course will include a variety of learning activities. The lecture portion of the course will include instructor delivered lectures and demonstrations stressing key topics in the course. In preparation for the lecture portion of the course, students will be expected to complete all reading and homework assignments.
The laboratory portion of the course is intended to enhance skill in the operation of basic electronic test instruments, skills in circuit analysis and troubleshooting, skill in teamwork, and skills in oral and written communication. For each lab experiment the students will have to write a formal report.

Outcome Assessment Strategies

Assessment of student performance in this course will be conducted in both the lecture and laboratory portions of the course and may be in the form of written and /or practice-based questions.
 

Course Content (Themes, Concepts, Issues and Skills)

  • REQUIRED STUDENT COMPETENCIES:

    1.0 Number Systems

1.1 Count in the binary and hexadecimal number systems.
1.2 Given a number in the decimal, binary, or hexadecimal number systems, identify the positional weight of each digit in the number.
1.3 Convert a binary and hexadecimal number to its decimal equivalent.
1.4 Convert a decimal number to its binary and hexadecimal equivalent.

2.0 Basic Logic Gates

2.1 Draw and identify the positive logic and the DeMorgan equivalent symbol for each of the basic logic gates: AND, OR, NOT, NAND and NOR gates.
2.2 Construct a truth table for each basic logic gate.
2.3 Write a Boolean expression for the positive logic symbol and for the DeMorgan equivalent symbol for each basic logic gate.
2.4 Given the input signals (static and time-varying), draw the corresponding output signal for each basic logic gate.

3.0 Combinational Logic Circuits Using SSI Devices

3.1 Given a schematic diagram for a combinational logic circuit, write a Boolean expression that describes the function of the circuit.
3.2 Given a schematic diagram using positive logic, analyze the operation of the circuit by determining signals at all intermediate test points and at all circuit outputs.
3.3 Given a schematic diagram, analyze the circuit and describe the circuit's operation in truth table form.
3.4 Given a schematic diagram and an input-output timing diagram, determine the probable cause of the circuit malfunction, isolating the trouble to the gate level.
3.5 Given a schematic diagram, prototype the circuit on a solderless breadboard.
3.6 Test and verify proper operation of a combinational logic circuit made from basic logic gates.

4.0 Boolean Algebra

4.1 Apply the following postulates in evaluating Boolean functions and expressions:

  1. A = 1 if A is not equal to 0
  2. A = 0 if A is not equal to 1
  3. 0 & 0 = 0 0 + 0 = 0
  4. 1 & 1 = 1 1 + 1 = 1
  5. 1 & 0 = 0 1 + 0 = 1
  6. Not 1 = 0 Not 0 = 1

4.2 Apply the following laws in evaluating Boolean functions and expressions:

  1. a. Commutative Law
  2. b. Associate Law
  3. c. Distributive Law
  4. d. DeMorgan's Law

4.3 Apply the following theorems in evaluating Boolean functions and expressions:

  1. A & 0 = 0 A + 0 = A
  2. A & 1 = 1 A + 1 = 1
  3. A & A = A A + A = A
  4. A & Not-A = 0 A + Not-A = 1
  5. A = Not-Not-A Not-Not-A = A
  6. A & (A + B) = A
  7. A + (Not-A & B ) = A + B

4.4 Using the postulates, laws, and theorems of Boolean Algebra, reduce Boolean expressions to simpler and simplest form.
4.5 Using the postulates, laws, and theorems of Boolean Algebra, prove the equivalence or non-equivalence of two Boolean expressions.

5.0 Synthesis of Combinational Logic Circuits

5.1 Draw and label Karnaugh Maps of 2, 3, and 4 variables.
5.2 Apply Karnaugh Mapping techniques to simplify Boolean expressions.
5.3 Given a written problem statement, develop a function table that describes the operation of the circuit.
5.4 Given a function table that describes the operation of a logic circuit, derive a Boolean expression that describes the circuit's operation.
5.5 Translate a Boolean expression into a logic circuit that implements the logic function and draw a corresponding schematic diagram, complete with pin numbers.

6.0 MSI Combinational Logic Device and Circuits

6.1 Describe the function of a multiplexer and a demultiplexer and state the purpose of each pin on the device, e.g. "select" input and "strobe" input.
6.2 Implement a Boolean function using a multiplexer.
6.3 Analyze the operation of a multiplexer-based circuit.
6.4 Describe the function of a decoder and state the purpose of each pin on the device.
6.5 Build and test a display circuit consisting of decoder/drivers and seven segment displays.
6.6 Describe the function of an encoder and state the purpose of each pin on the device.
6.7 Build and test the operation of an encoder-based circuit.