SpiralFlex
Well-Known Member
- Joined
 - Dec 18, 2010
 
- Messages
 - 6,954
 
- Gender
 - Female
 
- HSC
 - N/A
 
1. Okay.1) (ceebs tex)= (xy+xz+yy+yz)(not[x] + z) = (y(x+z+1)+xz) [as yy=1] = (x+y)(not[x] + z) [x+z+1 is always true]
2) SDD marker says we only need to know the basic laws of boolean - none of the XOR crap
3) how the f is there THREE inputs to AND?
2. There was one in one of the trial papers.
3. Why not?
				