Welcome! Log In Create A New Profile

Ass 1 Question 2

Posted by becked

Announcements		Last Post
	SoC Curricula	09/30/2017 01:08PM
	Demarcation or scoping of examinations and assessment	02/13/2017 07:59AM
	School of Computing Short Learning Programmes	11/24/2014 08:37AM
	Unisa contact information	07/28/2011 01:28PM

Forums Messages New

becked

Ass 1 Question 2
February 17, 2009 02:01PM

Registered: 18 years ago
Posts: 92
Rating: 0

The Boolean expression should change:

F(x,y,w) = [(xy'...etc

should become:

F(x,y,w) = [xy'...etc
(I deleted the rounded bracket after square bracket.)

Reply Quote

happy4u

Re: Ass 1 Question 2
February 17, 2009 09:11PM

Registered: 15 years ago
Posts: 47
Rating: 0

Use only Boolean algebra to simplify the Boolean expression F. (First determine F1 and F2, then simplify
F1 + F2, showing all the steps.

confused! need clue!

Reply Quote

becked

Re: Ass 1 Question 2
March 04, 2009 08:51AM

Registered: 18 years ago
Posts: 92
Rating: 0

You have to know all the Boolean rules ( you need not know their names).

Important to remember that eg. x + x' = 1 can be expanded, eg: yw + (yw)' = 1

See explanations in tut 102, p. 39, 40 and tut 103, p. 7