IFT 211 – Digital Systems Complete Study Note
This study note covers the major concepts in Digital Systems, including number systems,
Boolean algebra, logic gates, combinational circuits, adders, subtractors, multiplexers,
decoders, encoders, and code converters.
1. Introduction to Digital Systems
Definition: A digital system is a system that processes discrete data represented using
binary digits (0 and 1).
Importance: Digital systems are used in computers, phones, calculators, communication
systems, and embedded devices.
Analog vs Digital: Analog systems handle continuous signals while digital systems handle
discrete signals.
Advantages of Digital Systems: High accuracy, easy storage, programmability, reliability,
and noise resistance.
Examples: Computers, digital clocks, calculators, ATMs, smartphones.
Likely Exam Questions
Define a digital system.
Differentiate between analog and digital systems.
State four advantages of digital systems.
2. Number Systems and Codes
Binary Number System: Uses base 2 and digits 0 and 1.
Octal Number System: Uses base 8 and digits 0–7.
Decimal Number System: Uses base 10 and digits 0–9.
Hexadecimal Number System: Uses base 16 and symbols 0–9 and A–F.
Conversions: Conversion can occur between binary, decimal, octal, and hexadecimal
systems.
BCD: Binary Coded Decimal represents decimal digits using binary.
Gray Code: A binary code in which consecutive numbers differ by one bit.
ASCII: American Standard Code for Information Interchange.
Likely Exam Questions
Convert 101101₂ to decimal.
Convert 45₁₀ to binary.
Explain Gray code.
3. Boolean Algebra
Definition: Boolean algebra deals with variables that have two values: 0 and 1.
Basic Operations: AND, OR, and NOT are the basic logical operations.
AND Operation: Produces 1 only when all inputs are 1.
OR Operation: Produces 1 if at least one input is 1.
NOT Operation: Inverts the input value.
De Morgan’s Theorem: Useful for simplifying Boolean expressions.
Boolean Laws: Commutative, Associative, Distributive, Identity, Null, and Idempotent laws.
Truth Tables: Tables showing all possible input-output combinations.
Likely Exam Questions
State De Morgan’s theorem.
Construct the truth table for an AND gate.
Simplify Boolean expressions.
4. Logic Gates
AND Gate: Outputs 1 only when all inputs are 1.
OR Gate: Outputs 1 when at least one input is 1.
NOT Gate: Produces the complement of the input.
NAND Gate: Inverse of the AND gate.
NOR Gate: Inverse of the OR gate.
XOR Gate: Outputs 1 when inputs are different.
XNOR Gate: Outputs 1 when inputs are the same.
Likely Exam Questions
Differentiate between XOR and XNOR gates.
Draw the symbol of a NAND gate.
5. Combinational Logic Circuits
Definition: Circuits whose outputs depend only on present inputs.
Design Process: Includes truth table creation, simplification, and implementation.
Applications: Used in arithmetic operations, data routing, and control systems.
Likely Exam Questions
What is a combinational circuit?
List three applications of combinational circuits.
6. Multiplexers and Demultiplexers
Multiplexer: Selects one input from many inputs and forwards it to a single output.
Demultiplexer: Routes one input to one of many outputs.
Applications: Communication systems and data transmission.
Likely Exam Questions
Explain the operation of a multiplexer.
State one application of a demultiplexer.
7. Encoders and Decoders
Encoder: Converts information into coded form.
Decoder: Converts coded data back into original form.
Applications: Used in keyboards, displays, and communication systems.
Likely Exam Questions
Differentiate between an encoder and decoder.
State two applications of decoders.
8. Adders and Subtractors
Half Adder: Adds two single binary digits.
Full Adder: Adds three binary digits including carry input.
Half Subtractor: Subtracts two binary digits.
Full Subtractor: Performs subtraction with borrow input.
Ripple Carry Adder: Series connection of full adders.
Likely Exam Questions
Differentiate between half adder and full adder.
What is a ripple carry adder?
9. Code Converters
Definition: Converts one type of binary code into another.
Examples: BCD to Excess-3, Binary to Gray, Gray to Binary.
Applications: Digital communication and computer systems.
Likely Exam Questions
What is a code converter?
Give two examples of code converters.
Quick Revision Summary
Digital systems operate using binary values. Boolean algebra and logic gates are the
foundation of digital electronics. Combinational circuits perform arithmetic and logical
operations using gates and coding systems.