Class 1 Intro Boolean Algebra Problem Completed

2020-07-06
C SC 355
Summer 2020
LillAnne Jackson
Introduction
CSC 355 Summer 2020 Jackson These slides are designed for discussion & editing. See textbook for complete descriptions.
Today’s Overview:
• Course Introduction & Outline
• Digital systems
• Intro Boolean Algebra
1
2020-07-06
Course Information
https://heat.csc.uvic.ca/coview/outline/2020/Summer/CSC/355
Email: lillanne at uvic.ca

Phone Number: < Please E-mail >
Office Hours:
Monday, Wednesday & Thursday :
4:30-5 (After Class in our Zoom Room)
Textbook: Fundamentals of Logic Design , 7th Edition, Charles H.

Roth, Jr.; Larry L. Kinney
Assignments: MindTap Engineering for Roth/Kinney's Fundamentals
of Logic Design
Learning Management System: CourseSpaces
Course Objectives:
At the end of the course, you will be able to:
• design combinational logical circuits.
• simulate the building of combinational logic circuits
• demonstrate testing skills on combinational logic circuits.
• analyze and design sequential logical circuits.
• simulate the building of sequential logic circuits.
• design and simulate logic circuits using VHDL.
• design a microprocessor using combinational and
sequential logical circuits as components.
• explain how to design a full computer architecture, using
logical circuits.
• explain the structure of hardware components in
microprocessor systems.
2
2020-07-06
Course Topics:
• Boolean algebra, logic gates, combinational circuits
• Simplification and design algorithms
• Registers, memory organization and buses
• Mealy and Moore finite state machines, bubble graphs,
ASM charts
• Sequential machines analysis and synthesis, counters
• Arithmetic logic units and control units
• Testing of circuits
• Computer organization / architecture
• Design of a microprocessor
• Memory organization
• VHDL programming
Schedule (Draft: Subject to Change)
3
2020-07-06
Grading
Administrivia
• The "Best of 20" grade will include the best 20 of
21 quizzes, labs and FSM game activity, adjusted
by the learning assessment.
• The learning assessment will occur each week in
a one or two on one appointment with a Teaching
Assistant, who will assess your learning of the
week's activities.
• To pass the course, you must obtain pass:
the course overall; and
the final exam; and
• Web site: coursespaces.uvic.ca
Use your UVic NetLink ID to log in
4
2020-07-06
Please find your Course Outline:

• www.csc.uvic.ca
– Current students
– Undergraduate And now for
– Undergraduate Courses some Digital
– CSC 355 Logic !!
– Summer 2020 Outline
QUESTIONS?
A Digital System
Converts a set inputs (information) into a set of
outputs (information)
Discrete
Inputs Information
Outputs
Processing
System
System State
5
2020-07-06
AKA: A Switching Network

switching? Were once based on switches,
open and closed
COMBINATIONAL:
current output of the network depends entirely
on current inputs ==> no memory
SEQUENTIAL:
network with memory of any type
==> output depends on current inputs plus
previous state of inputs
A Sequential Network
a combinational network
Inputs Outputs
memory
6
2020-07-06
For now, lets focus on

Combinational Logic
GATES :
• AND
• OR
• NOT
• NAND (NOT AND)
• NOR (NOT OR)
Signal:
A variable that represents a physical quantity. Two discrete

levels, or binary values, are the usual in digital systems.
Binary values are represented by:

– binary digits: 0 and 1
– labels: False (F) and True (T)
– heights: Low (L) and High (H)
– Switch values: Off and On
7
2020-07-06
Example #1
IF the garage door is open
AND the car is running
THEN the car can be backed out of the garage
Is garage door Is the car Can the car be

open? running? backed out?
false (0) false (0) false (0)
false (0) true (1) false (0)
true (1) false (0) false (0)
true (1) true (1) true (1)
Boolean Algebra and Logical

Operators
Algebra: a branch of mathematics in which symbols
(as letters and numbers) are combined according to the
rules of arithmetic. (Merriam-Webster Dictionary)
Boolean Algebra: the branch of algebra in which the

values of the variables are the truth values true and
false, usually denoted 1 and 0 respectively. (Wikipedia)
Values used: 0 and 1

Operators: AND, OR, NOT
8
2020-07-06
AND, OR, NOT

A B AND A B OR A NOT
0 0 0 0 0 0 0 1
0 1 0 0 1 1 1 0
1 0 0 1 0 1
1 1 1 1 1 1
Truth Table: a table of all possible

𝐴∙𝐵 input
𝐴 +combinations
𝐵 and output𝐴 or 𝐴′
values
𝑨 𝑨
𝑨
𝑩 𝑩
Example #2
Turn on the furnace if, the internal temperature
is less than 20oC and the door and the window
are both closed.
A B C Furnace
0 0 0 0
A: internal temperature <20 0 0 1 0
B: door closed 0 1 0
0
0 1 1 0
C: window closed
1 0 0 0
𝑨 1 0 1 0
𝐴∙𝐵∙𝐶 𝑩
1 1 0 0
𝑪
1 1 1 1
9
2020-07-06
Example #1
What is this expression?
B C
A
F(light on) = A AND [(B AND C) OR D]

= 𝐴∙ 𝐵∙𝐶 +𝐷 = 𝐴 𝐵𝐶 + 𝐷
Example #2: A Boolean Expression

𝑨𝑩+𝑪
Build the truth table
3
3 variables  2 = 8 rows
A B C B 𝑨𝑩 𝑨𝑩 + 𝑪
Build the circuit:
0 0 0 1 0 0
0 0 1 1 0 1
0 1 0 0 0 0
0 1 1 0 0 1
1 0 0 1 1 1
1 0 1 1 1 1
1 1 0 0 0 0
1 1 1 0 0 1
10
2020-07-06
Boolean Algebra: The Rules

Precedence: For an expression with
1. brackets n inputs:
2. NOT
How many rows in its
3. AND
truth table? 2𝑛
4. OR
How many possible
𝑛
functions? 22
CSC 355 Summer 2020 Jackson These slides are designed for discussion & editing. See textbook for complete
descriptions.
Boolean Algebra
• The set of elements, B, that contains at least two elements, a, b where a  b
• The binary operations {AND, OR}, also written as {, +}
• The unary operation {NOT}, also written as { }
11
2020-07-06
Participation Break:
• Please Simplify:
𝐹 = 𝐴𝐵 + 𝐶 𝐴𝐶 + 𝐶
• You should show ALL the steps and indicate

which Boolean Algebra rule was used at each
step.
• Draw the circuit, before & after simplification.
F = 𝐴𝐵 + 𝐶 𝐴𝐶 + 𝐶 A
C
= 𝐴𝐵 + 𝐶 𝐶 , Absorption or Simplification
Original
= 𝐴𝐵𝐶 + 𝐶𝐶 , Distributive Circuit
= 𝐴𝐵𝐶 + 𝐶 , Idempotent
= 𝐶, Absorption or Simplification
Final
Circuit
CSC 355 Spring 2019 Jackson Slides

designed for discussion & editing. Textbook
has complete descriptions.
12

Class 1 Intro Boolean Algebra Problem Completed

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Class 1 Intro Boolean Algebra Problem Completed

Uploaded by

Copyright:

Available Formats

2020-07-06

Email: lillanne at uvic.ca

Textbook: Fundamentals of Logic Design , 7th Edition, Charles H.

Schedule (Draft: Subject to Change)

Please find your Course Outline:

AKA: A Switching Network

For now, lets focus on

• NAND (NOT AND)

• NOR (NOT OR)

A variable that represents a physical quantity. Two discrete

Binary values are represented by:

– labels: False (F) and True (T)

– heights: Low (L) and High (H)

– Switch values: Off and On

Is garage door Is the car Can the car be

Boolean Algebra and Logical

Boolean Algebra: the branch of algebra in which the

Values used: 0 and 1

AND, OR, NOT

Truth Table: a table of all possible

F(light on) = A AND [(B AND C) OR D]

Example #2: A Boolean Expression

Boolean Algebra: The Rules

• You should show ALL the steps and indicate

CSC 355 Spring 2019 Jackson Slides

You might also like