Digital Systems 1 - Study Guide 2018 (Final)
Digital Systems 1 - Study Guide 2018 (Final)
TESTS………………………………………………………..……………………………………………………….. Page 2
1
RULES AND REGULATIONS
The Vaal University of Technology’s rules and regulations regarding student and learner behavior are
applicable. The following rules are of specific importance to note by students using the facilities offered by
the Process Control and Computer Systems Department:
• Do not litter in passages, enclosed areas, and classrooms.
• Classrooms must be kept as tidy as possible.
• Students are not allowed to eat and/or drink in the classrooms and laboratories.
• Do not disturb learners attending lectures by disrupting a lecture in progress or unnecessary
loudness in passages and enclosed areas.
INFORMATION
The Notice Boards are situated on the ground floor between auditoriums T002 and T003, on the top floor
between T205 and T206 and opposite T206. The semester marks and preliminary exam time table, as well as
other computer systems related items such as bursaries, work opportunities, competitions, and new
developments will be displayed on these boards. Visit these boards regularly.
• Secretary to the HOD: room R003.
• Examination rules and regulations: obtainable from the examination offices.
• Library – Goldfields Library Building.
ATTENDANCE OF LECTURERS
Students guilty of bad behavior or disturbing other learners in classes or laboratories, can be requested by
the lecturer to leave the room. Absence from lectures must be kept to a minimum. If absent from lectures,
learners must catch-up work done on their own.
TESTS
Theoretical knowledge should be assessed by at least three compulsory tests of more or less equal
importance. Notification of a test must be given at least 1 week in advance. Absence from tests will only be
granted for medical and legal reasons. Learners must notify the lecturer and hand in the original or certified
copy of the doctor’s certificate or proof of court appearance within 3 days after the expiring date thereof , to
the lecturer or secretary of the HOD (at room R003). No personal reasons (i.e. appointments for bursary
applications, driver’s license, dental appointments, application for work, etc.) will be accepted. Absence
from tests, without an acceptable reason, will result in a mark of 0% for that test. Absentees, with an
acceptable reason, can be asked to write a ‘substitute test’ immediately at the lecturer’s discretion.
It is advised that no rewrites should be allowed, and that each test should carry an equal weight to establish
the mark for theory. Due to circumstances it might be necessary to deviate from these rules and allow a
rewrite or alter the relative weight of each test. Any change, if necessary, must be communicated to learners
in good time (± 1 week).
PRACTICAL MARK
The practical mark is established by the Senior Laboratory Assistant. Full information in this regard can be
obtained from him. Students must achieve a pass-mark (50%) for practical in order to be admitted to the
examination,
2
SEMESTER/YEAR MARK
The semester marks are published on the notice boards during the week following on the last test. The
semester mark is the weighted average of the mark for theory at 75% and the mark for practical at 25%.
When calculating the final semester mark, percentage class attendance could be taken into consideration in
borderline cases.
Once the semester mark is released, it is the learner’s responsibility to check the semester mark and to
report a possible error immediately to the relevant lecturer.
EXAMINATION
Admission to the examination is granted to learners obtaining a semester mark and practical mark of 50% or
more, respectively.
To pass this subject a final mark of at least 50% must be obtained, with a sub-minimum of 40% achieved in
the examination. The final mark is calculated as: (Semester mark + Examination mark) ÷ 2. Both marks
therefore carry a weight of 50%.
3
Module Content
LEARNING UNIT 1 [ FORMATIVEASSESSMENT 1]
4
LEARNINGUNIT 4[FORMATIVE ASSESSMENT 4]
5
Part 2
LEARNING UNITS INFORMATION
LECTURER/LEARNER WORK SCHEDULE
LEARNING UNIT 1
CHAPTER 1
Introductory Concepts
Section 1-1: Digital and Analog Quantities
OUTCOMES
• Define analog
• Define digital
• Explain the difference between digital and analog quantities
• State the advantages of digital over analog
Binary Digits.....................................................................................................19
Logic Levels...................................................................................................20
Digital Waveforms.........................................................................................20
A Digital Waveform Carries Binary Information ..........................................22
Data Tranfer………………………………………………………..........................................23
7
Section 1-3: Basic Logic Functions
OUTCOMES
• List three basic logic functions
• Define the NOT function
• Define the AND function
• Define the OR function
8
LEARNING UNIT 2
CHAPTER 2
Number Systems, Operations and Codes
LESSON 4
Decimal Numbers...........................................................................................66
Example 2-1…...................................................................................................67
Example 2-2……................................................................................................67
9
Section 2-2: Binary Numbers
OUTCOMES
• Count in binary
• Determine the largest decimal number that can be represented by a given number of
bits
• Convert a binary number to a decimal number
LESSON 5
Counting in Binary.........................................................................................68
The Weighting Structure of Binary Numbers….............................................69
Example 2-3…..................................................................................................70
Example 2-4…..................................................................................................70
10
Section 2-3: Decimal-to-Binary Conversion
OUTCOMES
• Convert a decimal number to binary using the sum-to-weight method
• Convert a decimal whole number to binary using the repeated division-by-2 method
• Convert a decimal fraction to binary using the repeated multiplication-by-2 method
LESSON 6
Sum-of-Weight Method...............................................................................71
Example 2-5..................................................................................................71
Repeated Division-by-2 Method.................................................................71
Example 2-6..................................................................................................72
Converting Decimal Fractions to Binary......................................................73
11
Section 2-4: Binary Arithmetic
OUTCOMES
• Add binary numbers
• Subtract binary numbers
• Multiply binary numbers
• Divide binary numbers
12
Section 2-5: Complements of Binary Numbers
OUTCOMES
• Convert a binary number to its 1’s complement
• Convert a binary number to its 2’s complement
LESSON 8
Finding the 1’s Complement........................................................................77
Finding the 2’s Complement........................................................................78
Example 2-12 ................................................................................................78
Example 2-13.................................................................................................78
13
Section 2-6: Signed Numbers
OUTCOMES
• Express positive and negative numbers in sign-magnitude
• Express positive and negative numbers in 1’s complement
• Express positive and negative numbers in 2’s complement
• Determine the decimal value of signed binary numbers
• Express a binary number in floating-point format
LESSON 9
The Sign Bit ……………………….........................................................................79
Sign-Magnitude Form………..........................................................................79
1’s Complement Form .................................................................................80
2’s Complement Form .................................................................................80
Example 2-14 ................................................................................................80
The Decimal Value of Signed Numbers .......................................................80
Example 2-15 ................................................................................................81
Example 2-16 ................................................................................................81
Example 2-17 ................................................................................................82
Range of Signed Integer Numbers ..............................................................82
Example 2-18 ................................................................................................84
14
Section 2-7: Arithmetic Operations with Signed Numbers
OUTCOMES
• Add signed binary numbers
• Define overflow
• Explain how computers add strings of numbers
• Subtract signed binary numbers
• Multiply signed binary numbers using the direct addition method
• Multiply signed binary numbers using the partial products method
• Divide signed binary numbers
LESSON 10
Addition ………………………..............................................................................85
Example 2-19 ................................................................................................86
Subtraction………..........................................................................................86
Example 2-20 ................................................................................................87
Multiplication …………...................................................................................88
Example 2-21 ................................................................................................88
Example 2-22 ................................................................................................89
Division……………………...................................................................................90
Example 2-23 ................................................................................................91
15
Section 2-8: Hexadecimal Numbers
OUTCOMES
• Count in hexadecimal
• Convert from binary to hexadecimal
• Convert from hexadecimal to binary
• Convert from hexadecimal to decimal
• Convert from decimal to hexadecimal
• Add hexadecimal numbers
• Determine the 2’s complement of a hexadecimal number
• Subtract hexadecimal numbers
LESSON 12
Octal-to-Decimal Conversion .....................................................................98
Decimal-to-Octal Conversion………..............................................................98
Octal-to-Binary Conversion ........................................................................99
Example 2-31 ................................................................................................99
Binary-to-Octal Conversion .........................................................................99
Example 2-32 ...............................................................................................100
17
Section 2-10: Binary Coded Decimal (BCD)
OUTCOMES
• Convert each decimal digit to BCD
• Express decimal numbers in BCD
• Convert from BCD to decimal
• Add BCD numbers
LESSON 13
The 8421 BCD Code ...................................................................................100
Example 2-33 ...............................................................................................101
Example 2-34 ...............................................................................................101
BCD Addition ................................................................................................102
Example 2-35 ...............................................................................................102
Example 2-36 ...............................................................................................102
18
Section 2-11: Digital Codes
OUTCOMES
• Explain the advantage of the Gray code
• Convert between Gray code and binary
• Use the ASCII code
• Discuss the Unicode
LESSON 14
19
Section 2-12: Error Codes
OUTCOMES
• Determine if there is an error in a code based on the parity bit
• Assign the proper parity bit to a code
• Explain the cyclic redundancy (CRC) check
• Describe the Hamming code
LESSON 15
20
LEARNING UNIT 3
CHAPTER 3
Logic Gates
21
Section 3-2: The AND Gate
OUTCOMES
• Identify an AND gate by its symbol
• Describe the operation of an AND gate
• Generate the truth table for an AND gate with any number of inputs
• Produce a timing diagram for an AND gate with any specified input waveforms
• Write the logic expression for an AND gate with any number of inputs
• Discuss examples of AND gate applications
LESSON 17
The Operation of an AND Gate ........................................................................129
AND Gate Truth Table .....................................................................................130
Example 3-2 ..................................................................................................130
AND Gate Operation with Waveform Inputs ..............................................131
Example 3-3 ..................................................................................................131
Example 3-4 ..................................................................................................132
Example 3-5 ..................................................................................................132
Logic Expressions for an AND Gate ............................................................133
Applications.................................................................................................134
22
Section 3-3: The OR Gate
OUTCOMES
• Identify an OR gate by its symbol
• Describe the operation of an OR gate
• Generate the truth table for an OR gate with any number of inputs
• Produce a timing diagram for an OR gate with any specified input waveforms
• Write the logic expression for an OR gate with any number of inputs
• Discuss examples of OR gate applications
LESSON 18
The Operation of an OR Gate .........................................................................136
OR Gate Truth Table ......................................................................................137
OR Gate Operation with Waveform Inputs ................................................137
Example 3-7 ..................................................................................................137
Example 3-8 ..................................................................................................138
Example 3-9 ..................................................................................................138
Logic Expressions for an OR Gate ...............................................................139
Applications..................................................................................................139
23
Section 3-4: The NAND Gate
OUTCOMES
• Identify a NAND gate by its symbol
• Describe the operation of a NAND gate
• Generate the truth table for a NAND gate with any number of inputs
• Produce a timing diagram for a NAND gate with any specified input waveforms
• Write the logic expression for a NAND gate with any number of inputs
• Describe NAND gate operation in terms of its negative-OR equivalent
LESSON 19
The Operation of a NAND Gate .......................................................................141
NAND Gate Operation with Waveform Inputs ...........................................141
Example 3-10 ................................................................................................141
Example 3-11 ................................................................................................142
Example 3-12 ................................................................................................142
Example 3-13 ................................................................................................143
Example 3-14 ................................................................................................144
Logic Expressions for a NAND Gate ............................................................144
24
Section 3-5: The NOR Gate
OUTCOMES
• Identify a NOR gate by its symbol
• Describe the operation of a NOR gate
• Generate the truth table for a NOR gate with any number of inputs
• Produce a timing diagram for a NOR gate with any specified input waveforms
• Write the logic expression for a NOR gate with any number of inputs
• Describe NOR gate operation in terms of its negative-AND equivalent
• Discuss examples of NOR gate applications
LESSON 20
The Operation of a NOR Gate .........................................................................145
NOR Gate Operation with Waveform Inputs ..............................................146
Example 3-15 ................................................................................................146
Example 3-16 ................................................................................................146
Example 3-17 ................................................................................................147
Example 3-18 ................................................................................................147
Example 3-19 ................................................................................................148
Logic Expressions for a NOR Gate ...............................................................149
LESSON 20
The Exclusive-OR Gate ....................................................................................149
The Exclusive-NOR Gate ..................................................................................151
Operation with Waveform Inputs ...............................................................151
Example 3-21 .................................................................................................152
An Application ..............................................................................................152
26
Section 3-8: Fixed-Function Logic Gates
OUTCOMES
• List common 74 series gate logic functions
• List the major integrated circuit technologies
• Obtain data sheet information
• Define propagation delay time
• Define power dissipation
• Define unit load and fan-out
• Define speed-power product
LESSON 21
74 Series Logic Gate Function ..........................................................................161
74 Series Logic Circuit Families ........................................................................164
Performance Characteristics and Parameters ............................................164
Example 3-23 .................................................................................................167
Example 3-24 .................................................................................................168
27
LEARNING UNIT 4
CHAPTER 4
Boolean Algebra and Logic Simplification
Section 4-1: Boolean Operations and Expressions
OUTCOMES
• Define variable
• Define literal
• Identify sum and product terms
• Evaluate sum and product terms
• Explain Boolean addition and multiplication
28
Section 4-2: Laws and Rules of Boolean Algebra
OUTCOMES
• Apply the commutative laws of addition and multiplication
• Apply the associative laws of addition and multiplication
• Apply the distributive law
• Apply twelve basic rules of Boolean algebra
29
Section 4-3: DeMorgan’s Theorems
OUTCOMES
• State DeMorgan’s theorems
• Relate DeMorgan’s theorems to the equivalent of NAND and negative-OR gates
• Relate DeMorgan’s theorems to the equivalent of NOR and negative-AND gates
• Apply DeMorgan’s theorems to the simplification of Boolean expressions
30
Section 4-4: Boolean Analysis of Logic Circuits
OUTCOMES
• Determine the Boolean expression for a combination of gates
• Evaluate the logic operation of a circuit from the Boolean expression
• Construct a truth table
31
Section 4-5: Logic Simplification Using Boolean Algebra
OUTCOMES
• Apply the laws, rules, and theorems of Boolean Algebra to simplify general expressions
32
Section 4-6: Standard Form of Boolean Expressions
OUTCOMES
• Identify a sum-of-product expression
• Determine the domain of a Boolean expression
• Convert any sum-of-product expression to a standard form
• Evaluate a standard sum-of-product expression in terms of binary values
• Identify a product-of-sums expression
• Convert any product-of-sums expression to a standard form
• Evaluate a standard product-of-sums expression in terms of binary values
• Convert from one standard form to the other
34
Section 4-8: The Karnaugh Map
OUTCOMES
• Construct a Karnaugh map for three or four variables
• Determine the binary value of each cell in a Karnaugh map
• Determine the standard product term represented by each cell in a Karnaugh map
• Explain cell adjacency and identify adjacent cells
35
Section 4-9: Karnaugh Map SOP Minimization
OUTCOMES
• Map a standard SOP expression on a Karnaugh map
• Combine the 1’s on the map into maximum groups
• Determine the minimum products term to form a minimum SOP expression
• Convert a truth table into a Karnaugh map for simplification
• Use don’t care conditions on a Karnaugh map
36
Section 4-10: Karnaugh Map POS Minimization
OUTCOMES
• Map a standard POS expression on a Karnaugh map
• Combine the 0’s on the map into maximum groups
• Determine the minimum sum term to form a minimum SOP expression
• Combine the minimum sum terms to form a minimum POS expression
• Use the Karnaugh map to convert between POS and SOP
37
LEARNING UNIT 5
CHAPTER 5
Combination Logic Analysis
Section 5-1: Basic Combinational Logic Circuits
OUTCOMES
• Analyze and apply AND-OR circuits
• Analyze and apply AND-OR-Invert circuits
• Analyze and apply exclusive-OR gates
• Analyze and apply exclusive-NOR gates
38
Section 5-2: Implementing Combinational Logic
OUTCOMES
• Implement a logic circuit from a Boolean expression
• Implement a logic circuit from a truth table
• Minimize a logic circuit
39
Section 5-3: The Universal Property of NAND and NOR
Gates
OUTCOMES
• Use NAND gates to implement the inverter, AND, OR and NOR gate
• Use NOR gates to implement the inverter, AND, OR and NOR gate
40
Section 5-4: Combinational Logic Using NAND and NOR
Gates
OUTCOMES
• Use NAND gates to implement a logic function
• Use NOR gates to implement a logic function
• Us the appropriate dual symbol in a logic diagram
41
Section 5-5: Pulse Waveform Operation
OUTCOMES
• Analyze combinational logic with pulse waveform inputs
• Develop a timing diagram for any given combinational logic circuit with specified inputs
• Us the appropriate dual symbol in a logic diagram
42
LEARNING UNIT 6
CHAPTER 6
Functions of Combination Logic
Section 6-1: Half and Full Adders
OUTCOMES
• Describe the function of a half-adder
• Draw a half-adder logic diagram
• Describe the function of a full-adder
• Draw a full-adder logic diagram using half adders
• Implement a full-adder using AND-OR logic
43
Section 6-2: Parallel Binary Adders
OUTCOMES
• Use full-adders to implement a parallel binary adder
• Explain the addition process in a parallel binary adder
• Use the truth table for a 4-bit parallel adder
• Apply two 74HC283 IC’s for the addition of two 8-bit numbers
• Expand the 4-bit adder to accommodate 8-bit or 16-bit addition
44
Section 6-3: Ripple Carry and Look-Ahead Carry Adders
OUTCOMES
• Discuss the difference between a ripple carry adder and a look-ahead carry adder
• State the advantage of look-ahead carry addition
• Define carry generation and carry propagation and explain the difference
• Develop look-ahead carry logic
• Explain why cascaded 74HC283 IC’s exhibit both ripple carry and look-ahead carry
properties
45
Section 6-4: Comparators
OUTCOMES
• Use the exclusive-NOR gate as a basic comparator
• Analyze the internal logic of a magnitude comparator that has both equality and
inequality outputs
• Apply the 74HC85 comparator to compare the magnitudes of two 4-bit numbers
• Cascade 74HC85 IC’s to expand a comparator to eight or more bits
Equality ……………………..................................................................................328
Example 6-5 ..................................................................................................328
Inequality ....................................................................................................329
Example 6-6 ..................................................................................................329
Example 6-7 ..................................................................................................331
46
Section 6-5: Decoders
OUTCOMES
• Define decoder
• Design a logic circuit to decode any combination of bits
• Describe the 74HC154 binary-to-decimal decoder
• Expand decoders to accommodate larger numbers of bits in a code
• Describe the 74HC42 BCD-to-decimal decoder
• Describe the 74HC7 BCD-to-7 segment decoder
• Discuss zero suppression in 7-segment displays
47
Section 6-6: Encoders
OUTCOMES
• Determine the logic for a decimal-to-BCD encoder
• Explain the purpose of the priority feature in encoders
• Describe the 74HC147 Decimal-to-BCD encoder
48
Section 6-7: Code Converters
OUTCOMES
• Explain the process for converting BCD to binary
• Use exclusive-OR gates for conversions between binary and Gray codes
49
Section 6-8: Multiplexers (Data Selectors)
OUTCOMES
• Explain the basic operation of a multiplexer
• Describe the 74HC153 and the 74HC151 multiplexer
• Expand a multiplexer to handle more data inputs
• Use the multiplexer as a logic function generator
50
Section 6-9: Demultiplexers
OUTCOMES
• Explain the basic operation of a demultiplexer
• Describe how a 4-line-to-16-line decoder can be used as a demultiplexer
• Develop the timing diagram for a demultiplexer with specified data and data selection
inputs
Demultiplexers ……………………......................................................................356
Example 6-18 ................................................................................................357
4-Line-to-16-Line Decoder as a Demultiplexor .........................................357
51
Section 6-10: Parity Generators/Checkers
OUTCOMES
• Explain the concept of parity
• Implement a basic parity circuit with exclusive-OR gates
• Describe the operation of basic parity generating and checking logic
• Discuss the 74HC280 9-bit parity generator/checker
52
Part 3
PRACTICALASSIGNMENTS
POLICY FOR PRACTICAL CLASSES
1. Drinking and eating are not allowed in the practical classroom.
2. You will be allocated to a position in the practical classroom which is marked with a number.
You are responsible for the equipment allocated to this position. The technician will make a
note of your position.
3. Every learner must do his own practical, however students are allowed to help one another in
a constructive manner.
4. All learners must have their own practical guide, no second hand book or a copy of the
practical assignment book will be allowed.
5. Practical assignments must be build by the learner him/herself during the practical period. All
Practical assignments must be done on the opposite page of the assignment you are busy with,
in the practical assignments guide.
6. Preparation of practical assignments will be evaluated using the following criteria:
Neatness, Logic circuit layout, Completeness and Initiative.
7. Construction of practical assignment will be evaluated using the following criteria:
Overall neatness
Correct wiring techniques
Correct layout of components
Correct working of circuit
Student’s knowledge of circuit
Correct method for wiring the bus bar
Safety precautions (Supply off when building logic circuit)
Ability to do fault finding
8. Learners must prepare their practical assignments before attempting to build any of the logic
circuits. Due to the limited time available during a practical period this preparations must be
done before entering the practical room.
9. No learners are allowed in the technician’s area at the back of the laboratory.
10. All practical work (preparations etc.) must be done in practical book.
11. Students not obeying to these rules could face disciplinary steps against him/her which can
lead to the expulsion of the practical class.
12. Completed practical assignment book must be handed in at the end of the semester.
13. Students must also contribute to the neatness of the lab.
14. Do not play with the computer, changing background etc.
41
Multisim Circuit Simulation
CHAPTER 7
Section 7.1: Latches
OBJECTIVE:
INSTRUCTIONS:
(Note: If the enable, disable switch does not work while simulating on the scope, first pause
simulation, then switch to enable or disable, then disable pause.)
42
Section 7.2: Flip/Flops
OBJECTIVE:
INSTRUCTIONS:
43
Section 8.1: Bi-directional Shift Register
OBJECTIVE:
INSTRUCTIONS:
44
Section 8.2: Register Counters – Johnson Counter
OBJECTIVE:
INSTRUCTIONS:
45
Section 8.3: Register Counters – Ring Counter
OBJECTIVE:
INSTRUCTIONS:
46
Section 9.1: 4-Bit Asynchronous Counter
OBJECTIVE:
INSTRUCTIONS:
47
Section 9.2: 4-Bit Synchronous Counter
OBJECTIVE:
Testing the operation of a 4-bit synchronous counter with Clear and Loadconnections.
INSTRUCTIONS:
1. Double click on the Multisim Icon located on the desktop.
2. Open the file on the hard disk.
3. Complete the wiring using the circuit below as a guideline.
4. Switch J is connected to the clear (CLR) input of the counter. Use key 1 on the keyboard to
clearthe output. “0" = Clear
5. Switch J6 is connected to the load input of the counter. Use key 1 on the keyboard to change
toa “1" or “0". “0" = Load. “1" = Count
6. Switches J1 (A), J2 (B), J3 © and J4 (D) represent the binary value that will be loaded into the
counter when the load signal is LOW.
7. Press F5 on the keyboard or the simulated switch on the screen to simulate the circuit and also
toterminate the simulation process.
8. Simulate the following conditions: CLR, Load and Counting.
48
Section 9.3: Synchronous Up/Down Counter
OBJECTIVE:
INSTRUCTIONS:
49