Perfect induction, Computer Engineering

Any identity or equality in Boolean algebra, suchas de Morgan's Theorem can be proved usingthe method of perfect induction.

1. All combinations of variables are written down.

2. Expressions thought to be identical arecomputed.

3. Identity is proved if the two results are thesame for every line.

E.g. X + X.Y = X + Y 

 

Perfect Induction.

Prove X + X.Y = X + Y

 

471_Perfect induction.png

Posted Date: 8/27/2012 2:12:41 AM | Location : United States







Related Discussions:- Perfect induction, Assignment Help, Ask Question on Perfect induction, Get Answer, Expert's Help, Perfect induction Discussions

Write discussion on Perfect induction
Your posts are moderated
Related Questions
The advantages of specifying parameters during instantiation method are: -  All values to all the parameters do not need to be specified. Only those parameters that are assigne

assignment on transaction flow, transform flow, transform mapping: refining the architectural design

What is Verilog Verilog  language  is  still  rooted  in  it's  native  interpretative  mode.  Compilation  is  a means of speeding up simulation however has not changed the or

What is pipelining? It is a method of decomposing a sequential process into sub-operations, with each sub-process being implemented in a special dedicated segment that operates

(a) Explain, using suitable examples, the functions of each of the sub system mentioned in the context of a large chain of supermarkets (i) Database Management Subsystem (ii)

Difference between relocatable and self relocatable programs. A relocatable program is one which can be processed to relocate it to a selected area of memory. For illustratio

What is View? A simple view can be thought of as a subset of a table. It can be used for retrieving data, as well as updating or deleting rows. Rows updated or deleted in the v

Describe the advantages of JAVA servlets over CGI interface. The Advantage of Servlets Over "Tradi tional" CGI: Java servlets are extra efficient, easier to utilize more pow

Functions - first-order logic: Functions can be thought of as exceptional predicates, wherever we think of all but one of the arguments as input and the output as final argume

What is Expansion swap? At the time when any process needs more memory than it is currently allocated, the Kernel performs Expansion swap. To do this Kernel reserves enough spa