EECS 203 Mailing List
Re: Proofs

Re: Proofs

From: Robert Dick <dickrp_at_avoiding.spam>
Date: Wed Apr 23 2008 - 08:38:27 CDT

> I was wondering whe you asked for us to prove that a single bit change
> error can be detected and a double can't what kind of proof should we do?
> Does it need to be like a truth table or an actual proof?

Anything that makes the truth obvious, including truth tables, is sufficient.
However, I found K-maps easier than truth tables.

-Robert Dick-
Received on Wed Apr 23 08:38:27 2008

This archive was generated by hypermail 2.1.8 : Sat Aug 23 2008 - 21:08:11 CDT