Version: 3/20/2019 2
Additional Course Information
Topical Outline: Each offering of this course must include the following topics (be sure to include information regarding lab,
practicum, and clinical or other non-lecture instruction).
The following performance will be expected of any student completing this course with a passing grade. There is no
absolute time limit on the performance of these objectives, unless noted, but the grade received by the student will
depend, in part, on the relative speed and precision of the student's performance in these tasks. Where subjective
evaluations are indicated, the instructor will make these judgments based on his or her knowledge of the skills required
to place a graduate with the expectation of successful on-job performance. The student will be expected to perform the
following tasks in written examination or laboratory demonstration:
• Define, give examples of, and clearly differentiate between "digital" and "analog" systems, their advantages and
disadvantages.
• Correctly write the counts from 1 to 64 (decimal) in binary, octal, BCD, and hexadecimal.
• Convert a number of any reasonable size from binary, octal, decimal, hexadecimal, or BCD to any of the other
number systems without using a calculator.
• Convert a number of any reasonable size from binary, octal, decimal, hexadecimal, or BCD to any of the other
number systems using a calculator with appropriate conversion functions.
• Write the reasons for use of octal and hexadecimal number systems.
• Explain the difference between a place-weighted number system and a code.
• List compare and list respective advantages and disadvantages of BCD and binary numbers.
• Perform addition, direct subtraction, multiplication, and division on any two binary numbers of 16 digits.
• Perform subtraction on binary numbers by ones complement and twos complement methods.
• Draw the traditional and IEEE symbols for the inverter, AND, OR, NAND, NOR, and EXCLUSIVE OR gates.
• Write the truth-tables for the three-input AND, OR, NAND, and NOR functions.
• Write the truth-tables for the inverter and the EXCLUSIVE-OR functions.
• Write the Boolean equation for an arbitrary combinational network of 15 gate complexity.
• Use Boolean algebra to simplify an expression of not over five terms in three variables.
• Use Karnaugh maps to simplify a SOP expression of not over four variables.
• Convert to NAND realization an AND-OR Boolean expression in three variables of five terms.
• Demonstrate laboratory competency in the use of the simple logic probe.
• Given a Boolean equation of no more than five terms in four variables, build and prove the TTL or CMOS
implementation of the equation given pinouts for the necessary gates, power supply, protoboard, and necessary
wire.
• Demonstrate laboratory troubleshooting ability by locating a single stuck gate input in the laboratory
implementation of a five-term, four-variable TTL Boolean equation using only the simple logic probe.
• Construct the truth table for a Boolean equation of no more than five terms in four variables.
• Given a stated problem in logic involving no more than four variables in three terms, produce a truth table and
Boolean equation corresponding to the statement of the problem.
• Draw the diagram and write the truth table for the parallel full adder; describe the interconnection of full adders
to produce multi-bit adders.
• Write the definition of combinational logic and the definition of sequential logic.
• Draw the NOR realization of an S-R latch.
• Write the truth-table for an S-R latch.
• Given an arbitrary input timing diagram for an S-R latch, draw the output waveform.
• Write the truth-table for a T flip-flop.
• Given an arbitrary input timing diagram for a T flip-flop, draw the output waveform.
• Write the truth-table for a J-K flip-flop.
• Given an arbitrary input timing diagram for a J-K flip-flop, draw the output waveform.
