Boolean Algebra Truth Table, Product and Sum Expressions

In summary, the conversation discusses a function f(x,y,z) that outputs 1 when the binary number xyz evaluates to 1,2,3, or 4, and 0 otherwise. A truth table is drawn to visualize the function and the sum of product and product of sum expressions are found for the function. The conversation ends with a question about finding the max terms for the function.
  • #1
Fomular
1
0
Given f(x,y,z)=sum(1,2,3,4)
draw truth table
find product of sum exprsn
find max terms
find sum of product

truth table
x y z out
0 0 0 0 (x'+y'+z')
0 0 1 1 x'y'z
0 1 0 1 x'yz'
0 1 1 1 x'yz
1 0 0 1 xy'z'
1 0 1 0 (x+y'+z)
1 1 0 0 (x+y+z')
1 1 1 0 (x+y+z)
sop=x'y'z +x'yz' +x'yz +xy'z'
pos=(x'+y'+z')(x+y'+z)(x+y+z')(x+y+z)

i think this is incorrect and i don't knw how to find the max terms
 
Physics news on Phys.org
  • #2
Fomular said:
Given f(x,y,z)=sum(1,2,3,4)
draw truth table
find product of sum exprsn
find max terms
find sum of product

truth table
x y z out
0 0 0 0 (x'+y'+z')
0 0 1 1 x'y'z
0 1 0 1 x'yz'
0 1 1 1 x'yz
1 0 0 1 xy'z'
1 0 1 0 (x+y'+z)
1 1 0 0 (x+y+z')
1 1 1 0 (x+y+z)
sop=x'y'z +x'yz' +x'yz +xy'z'
pos=(x'+y'+z')(x+y'+z)(x+y+z')(x+y+z)

i think this is incorrect and i don't knw how to find the max terms
Hi Fomular! http://img96.imageshack.us/img96/5725/red5e5etimes5e5e45e5e25.gif

Can you explain how f(x,y,z)=sum(1,2,3,4) leads to your truth table? I'm intrigued and I hope to learn something here. :smile:
 
Last edited by a moderator:
  • #3
NascentOxygen said:
Hi Fomular! http://img96.imageshack.us/img96/5725/red5e5etimes5e5e45e5e25.gif

Can you explain how f(x,y,z)=sum(1,2,3,4) leads to your truth table? I'm intrigued and I hope to learn something here. :smile:

When the binary number xyz evaluates to 1,2,3, or 4, in base ten, output 1 otherwise output zero.
 
Last edited by a moderator:

What is boolean algebra?

Boolean algebra is a branch of mathematics that deals with logical operations and values. It is used to analyze and manipulate logical expressions and statements.

What are the basic operations in boolean algebra?

The basic operations in boolean algebra are AND, OR, and NOT. These operations are used to combine or manipulate logical values or expressions.

How is boolean algebra used in computer science?

Boolean algebra is the foundation of digital logic, which is used in computer science to design and analyze digital circuits. It is also used in programming languages to create conditional statements and control flow.

What are the laws of boolean algebra?

The laws of boolean algebra are a set of rules that govern the manipulation of logical statements. Some common laws include the commutative law, associative law, and distributive law.

How do I simplify a boolean expression?

To simplify a boolean expression, you can use the laws of boolean algebra to rearrange the expression and reduce it to its simplest form. This involves eliminating redundant terms, applying the correct operations, and grouping terms together.

Similar threads

  • Engineering and Comp Sci Homework Help
Replies
1
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
15
Views
3K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
962
  • Engineering and Comp Sci Homework Help
Replies
5
Views
8K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
3K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
4K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
2
Views
2K
  • Linear and Abstract Algebra
Replies
19
Views
2K
  • Engineering and Comp Sci Homework Help
Replies
5
Views
2K
Back
Top