Computer Science question :s

doddsy105 · 18 Feb 2011 at 09:17

Can anybody help with this question? It makes no sense to me :S

1.Using the Karnaugh map method, obtain the minimal sum of the products and product of sums expressions for the function

F(A,B,C,D) = sum (1,3,4,5,6,7,9,12,13)
Now realize the function F(A,B,C,D) = sum (1,3,4,5,6,7,9,12,13 by :
(i) basic gates,
(ii) NAND gates only,
(iii) NOR gates only. (10 marks)

exia · 18 Feb 2011 at 10:15

Can you do (i) basic gates?

Darg · 18 Feb 2011 at 10:23

This might be a good place to start

mattyprice4004 · 18 Feb 2011 at 11:55

Oh my God my head.

The Dread Pirate · 18 Feb 2011 at 12:04

Do your own damn homework!

steve-h · 18 Feb 2011 at 13:43

easy.

doddsy105 · 20 Feb 2011 at 20:17

no i cant do the basic gates :s

p4radox · 20 Feb 2011 at 20:50

You need a 4x4 Karnaugh map. Just circle the "ones" with as many permissible loops as possible and there's your expression. For the minimum POS expression you need to circle the zeros and then use De Morgan's theorem.

This might be a good place to start:

http://www.ee.surrey.ac.uk/Projects/Labview/minimisation/karrules.html

edit: And the Wiki article above is pretty comprehensive too.

explicit4u · 20 Feb 2011 at 21:04

Really not looking forward to this!!!

p4radox · 20 Feb 2011 at 21:07

K-maps are actually really intuitive. Once you realise how they work it makes a lot of sense, and saves so much time compared to manipulating boolean algebra.

MikeHunt79 · 20 Feb 2011 at 21:12

p4radox said:
K-maps are actually really intuitive. Once you realise how they work it makes a lot of sense, and saves so much time compared to manipulating boolean algebra.

Indeed, you've just got to be patient and once you get the hang of them they really help.

Danm54 · 20 Feb 2011 at 23:11

Of course, its so easy once you figure out the basics.

Do I sound like I know what im talking about??