Brandon walker 3.2

docx

School

ECPI University, Virginia Beach *

*We aren’t endorsed by this school

Course

120

Subject

Computer Science

Date

Feb 20, 2024

Type

docx

Pages

3

Uploaded by MinisterPower10030

Report
Brandon walker EET130 Cameron Ruddy Assignment 3.2 2.Write an expression that is a 1 only if all of its variables (A, B, C, D, and E) are 1s. A B C D E 3.Write an expression that is a 1 when one or more of its variables (A, B, and C) are 0s. A + B + C 5. Find the values of the variables that make each product term 1 and each sum term 0. AB^-C A=1,B’=0,C=1 10. Apply DeMorgan’s theorems to each expression: A.(A+B)*C*D’ B.(A+B)*CD*EF with a line over CD and EF C.(A+B’+C+D’)+AB+CD’ with a line over A+B+C+D and AB 19. Using Boolean algebra techniques, simplify the following expressions as much as possible A. A is the simplified expression B. A is the simplified expression 23. Convert the following expressions to sum-of-product (SOP) forms: A. AC+AB+BC with the B in AB having a line over it 24. Convert the following expressions to sum-of-product (SOP) forms: A. AB+CD 33. Develop a truth table for each of the SOP expressions:
A. 34. Develop a truth table for each of the standard POS expressions: A. 35. Develop a truth table for each of the standard POS expressions:
A. 40. Use a Karnaugh map to find the minimum SOP form for each expression: A. A′B′+B′C+AB′C C. A′+A
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help