COMPUTER SCIENCE ILLUMIN.-TEXT
COMPUTER SCIENCE ILLUMIN.-TEXT
7th Edition
ISBN: 9781284156010
Author: Dale
Publisher: Jones & Barlett
bartleby

Videos

Question
Book Icon
Chapter 4, Problem 64E
Program Plan Intro

Boolean algebra:

  • The Boolean expression is known as a mathematical notation that is used to express the function.
  • For example: Boolean expression for the NOT gate.

  X = A¯

Expert Solution & Answer
Check Mark

Explanation of Solution

Properties of Boolean algebra:

  • Six properties of Boolean algebra are shown below:
    • Commutative property
    • Associative property
    • Distributive property
    • Identity property
    • Complement property
    • DeMorgan’s law property
  • Commutative property:
    • The commutative property is the property that specifies the production of the same result when adding or multiplying two variables and its reverse order.
    • It is represented in the binary operations with the use of “AND” and “OR” gate.
    • AND operation:
      • Apply the commutative property from left to right or right to left for the given expression using AND operation:

AB = BA

  • For example:
    • Here, take the inputs A as 1 and B as 0 and apply the commutative property for AND operation

10 = 01

0 = 0

  • Thus, from the above example, it can be seen that both produce the same result.
  • The product of 1 and 0 is 0.
  • The product of 0 and 1 is 0.
  • OR operation:
    • Apply the commutative property from left to right or right to left for the given expression using the OR operation:

A+B = B+A

  • For example: Here, take the inputs A as 1 and B as 0 and apply the commutative property for OR operation:

1+0 = 0+1

1 = 1

  • Thus, from the above example, it can be seen that both produce the same result.
  • The sum of 1 and 0 is 1.
  • Reverse the sum of 0 and 1 is 1.
  • Associative property:
    • The associative property is the property that specifies the production of same results when the group of variables is added or multiplied together within the parentheses and its reverse order.
    • It is represented in the binary operations with the use of “AND” and “OR” gate.
    • AND operation:
      • Apply the associative property from left to right or right to left for the given expression using AND operation:

(AB)C = A(BC).

  • For example: Here, take the inputs A as 1, B as 0, and C as 1 and apply the associative property for AND operation:

(10)1 = 1(01)

01 = 10

0 = 0

  • Thus, from the above example, it can be seen that both produce the same result.
  • Group of product of A as 1, B as 0, and C as 1 within the parentheses is 0.
  • Reverse group of product of A as 1, B as 0, and C as 1 within the parentheses is 0.
  • OR operation:
  • Apply the associative property from left to right or right to left for the given expression using the OR operation:

(A+B)+C = A+(B+C).

  • For example: Here, take the inputs A as 1, B as 0 and C as 1 and apply the associative property for OR operation:

(1+0)+1 = 1+(0+1)

1+1 = 1+1

1 = 1

  • Thus, from the above example, it can be seen that both produce same result.
  • Group the sum of A as 1, B as 0, and C as 1 within the parentheses is 1.
  • Reverse group of sum of A as 1, B as 0, and C as 1 within the parentheses is 1.

Distributive property:

  • The distributive property is represented in the binary operations with the use of “AND” and “OR” gate.
  • AND operation:
    • Apply the distributive property from left to right or right to left for the given expression using AND operation:
    • The distributive property is the property when the variable multiplied by a group of variable added together produces the result which is same as that of the variable multiplied separately and then added together.

A(B+C) = (AB)+(AC).

  • For example: Here, take the inputs A as 1, B as 0, and C as 1 and apply the distributive property for AND operation:

1(0+1) = (10)+(11)

11 = 0+1

1 = 1

  • Thus, from the above example, it can be seen that both produce same result.
  • Sum of 0 and 1 produces the result 1, which when multiplied with 1 produces the result 1.
  • Multiply the 1 with 0 separately and multiply 1 with 1 separately and then add both the values which produce the result 1.
  • OR operation:
    • Apply the distributive property from left to right or right to left for the given expression using the OR operation:
    • The distributive property is the property when the variable added by a group of variable multiplied together produces the result which is same as that of the variable added separately and then multiplied together.

A+(BC) = (A+B)(A+C).

  • For example: Here, take the inputs A as 1, B as 0 and C as 1 and apply the distributive property for OR operation:

1+(01) = (1+0)(1+1)

1+0 = 11

1 = 1

  • Thus, from the above example, it can be seen that both produce same result.
  • Multiply the 0 with 1 produces the result 0, which when added to 1 produces the result 1.
  • Sum of 1 and 0 separately and Sum of 1 and 1 separately and then multiply both the values which produce the result 1.
  • Identity property:
    • The identity property is the property which produces the same results when sum of 0 and one variable produces the variable itself or product of 1 with one variable produces the variable itself.
    • It is represented in the binary operations with the use of “AND” and “OR” gate.
    • AND operation:
      • Apply the identity property for the given expression using AND operation:

A1 = A.

  • For example: Here, take the inputs A as 1 and apply the identity property for AND operation:

11 = 1

1 = 1

  • OR operation:
    • Apply the identity property for the given expression using the OR operation:

A+0 = A.

  • For example: Here, take the inputs A as 1 and apply the identity property for OR operation:

1+0 = 1.

1 = 1.

  • Complement property:
    • The complement property is represented in the binary operations such as “AND” and “OR” gate.
    • AND operation:
      • Apply the complement property for the given expression using AND operation:
      • The product of variable with its complement produces the 0.

A(A¯) = 0.

  • For example: Here, take the inputs A as 1 and apply the complement property for AND operation:

1( 1 ¯) = 0.

10 = 0.

0 = 0

  • OR operation:
    • Apply the complement property for the given expression using the OR operation:
    • The Sum of variable with its complement produces the 1.

A+(A¯) = 1.

  • For example: Here, take the inputs A as 1 and apply the complement property for OR operation:

1+( 1 ¯) = 1.

1+0 = 1.

1 = 1.

  • DeMorgan’s law property:
    • The DeMorgan’s law property is represented in the binary operations such as “AND” and “OR” gate.
    • AND operation:
      • Apply the complement property for the given expression using AND operation:
      • The DeMorgan’s law states that the complement of results produced in AND gate is equivalent to the complement of the individual inputs and then passed into an OR gate.

(AB¯) = A¯+B¯.

  • For example: Here, take the inputs A as 1 and B as 0 and apply the DeMorgan’s law property for AND operation:

(10¯) =  1 ¯+ 0 ¯.

( 0 ¯) = 0+1.

1 = 1.

  • OR operation:
    • Apply the complement property for the given expression using the OR operation:
    • The DeMorgan’s law states that the complement of result produced in OR gate is equivalent to the complement of the individual inputs and then passed into an AND gate.

(A+B¯) = A¯B¯.

  • For example: Here, take the inputs A as 1 and B as 0 and apply the DeMorgan’s law property for OR operation:

(1+0¯) =  1 ¯ 0 ¯

( 1 ¯) = 01

0 = 0

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
A Dia file has been created for you to extend and can be found on Company.dia represents a completed ER schema which, models some of the information implemented in the system, as a starting point for this exercise. Understanding the ER schema for the Company database. To demonstrate that you understand the information represented by the schema, explain using EMPLOYEE, DEPARTMENT, PROJECT and DEPENDENT as examples: attributes, entities and relationships cardinality & participation constraints on relationships You should explain questions a and b using the schema you have been given to more easily explain your answers. Creating and Extending Entity Relationship (EER) Diagrams. To demonstrate you can create entity relationship diagrams extend the ER as described in Company.dia by modelling new requirements as follows: Create subclasses to extend Employee. The employee type may be distinguished further based on the job type (SECRETARY, ENGINEER, MANAGER, and TECHNICIAN) and based…
Computer programs can be very complex, containing thousands (or millions) of lines of code and performing millions of operations per second. Given this, how can we possibly know that a particular computer program's results are correct? Do some research on this topic then think carefully about your response. Also, explain how YOU would approach testing a large problem. Your answer must be thoughtful and give some insight into why you believe your steps would be helpful when testing a large program.
Could you fix this? My marker has commented, What's missing? The input list is the link below.  https://gmierzwinski.github.io/bishops/cs321/resources/CS321_Assignment_1_Input.txt     result.put(true, dishwasherSum);        result.put(false, sinkSum);        return result;    }}
Knowledge Booster
Background pattern image
Computer Science
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
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Boolean Algebra - Digital Logic and Logic Families - Industrial Electronics; Author: Ekeeda;https://www.youtube.com/watch?v=u7XnJos-_Hs;License: Standard YouTube License, CC-BY
Boolean Algebra 1 – The Laws of Boolean Algebra; Author: Computer Science;https://www.youtube.com/watch?v=EPJf4owqwdA;License: Standard Youtube License