How Can Boolean Expressions Be Simplified and Implemented Using Logic Gates?

[pli777]

some one plase help me with following expresssions.
1 simplify the following expressions
1. z=abc+abc'+ab'c
2. x=(a'+b)(a+b+d)d'

2. apply de morgan's therems and simplify

1. z=(a(a+c')')'d
2. z=abc+ab'(a'c')'
3. z=(a+b=b'cd')'+b'cd'
4. z+a'c(a'bd)'+(a'bc'd'+ab'c)'

3. implement the following boolean expressions using and,or,not

1. x=b'c+ac+ab'
2. x=(a'+b'+c)+ab

 

[kamerling]

These are all boolean expressions, and a' meand not a, (a+b) is a or b, and ab= a and b?

you must try at least some of them yourself and show your work. If you have no idea what to do with all 8 expressions, it will be very hard to help you.

 

[ogb p]

'c
3. x=(a'+b)(a'+c)(b'+c)

1. x=(b'c)+(ac)+(ab')
2. x=((a'+b')+(c))+(ab'c)
3. x=((a'+b)+(a'+c)+(b'+c))