2.11 List the truth table of the function: (a)* F = xy + xy' + y'z (b) F = x'z' + yz

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
2.11 List the truth table of the function:
(a)* F = xy + xy' + y'z
(b) F = x'z' + yz
2.12 We can perform logical operations on strings of bits by considering each pair of corresponding
bits separately (called bitwise operation). Given two eight-bit strings A = 10110001 and
B = 10101100, evaluate the eight-bit result after the following logical operations: (a)* AND,
(b) OR, (c)* XOR, (d)* NOT A, (e) NOT B.
2.17 Obtain the truth table of the following functions, and express each function in sum-of-minterms
and product-of-maxterms form:
(a) (xy + z)(y + xz)
(c) x'z + wx'y + wyz' + w'y'
(b) (x + y')(y' + z)
(d) (xy + yz' + x'z)(x + z)
2.18 For the Boolean function
F = xy'z + x'y'z + w'xy + wx'y + wxy
(a) Obtain the truth table of F.
(b) Draw the logic diagr
(c Use Boolean algebra to simplify the function to a minimum number of literals.
(d) Obtain the truth table of the function from the simplified expression and show that it is the
same as the one in part (a).
(e) Draw the logic diagram from the simplified expression, and compare the total number of
gates with the diagram of part (b).
sing the origin
Boolean expression.
Transcribed Image Text:2.11 List the truth table of the function: (a)* F = xy + xy' + y'z (b) F = x'z' + yz 2.12 We can perform logical operations on strings of bits by considering each pair of corresponding bits separately (called bitwise operation). Given two eight-bit strings A = 10110001 and B = 10101100, evaluate the eight-bit result after the following logical operations: (a)* AND, (b) OR, (c)* XOR, (d)* NOT A, (e) NOT B. 2.17 Obtain the truth table of the following functions, and express each function in sum-of-minterms and product-of-maxterms form: (a) (xy + z)(y + xz) (c) x'z + wx'y + wyz' + w'y' (b) (x + y')(y' + z) (d) (xy + yz' + x'z)(x + z) 2.18 For the Boolean function F = xy'z + x'y'z + w'xy + wx'y + wxy (a) Obtain the truth table of F. (b) Draw the logic diagr (c Use Boolean algebra to simplify the function to a minimum number of literals. (d) Obtain the truth table of the function from the simplified expression and show that it is the same as the one in part (a). (e) Draw the logic diagram from the simplified expression, and compare the total number of gates with the diagram of part (b). sing the origin Boolean expression.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Fast Fourier Transform Concepts
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education