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
Trunks are the lines that run between (A)  Subscribers and exchange (B)  Switching system and power plant (C) Local area network (D) Switching stations Ans:

What are the different ways in which a thread can be cancelled?  Cancellation of a target thread may occur in two different scenarios: Asynchronous cancellation: One thre

Explain the working of a 2-bit digital comparator with the help of Truth Table. Ans. Digital comparator is a combinational circuit which compares two numbers, A and B; and

List the properties which a hashing function should possess to ensure a good search performance. What approaches are adopted to handle collision? A hashing function h must poss

What are the characteristics of digital ICs used to compute their performance? Ans: Characteristics of Digital Integrated Circuits 1. Speed of operation:   The Speed o

Variable ordering - Forward checking: Hence this is different from variable ordering in two important ways as:  Whether this is a dead end when we will end up visiting a

What logic is inferred when there are multiple assign statements targeting the same wire? It's illegal to specify multiple assign statements to the same wire in a synthesizable

Define underflow and overflow. Underflow: If the result the arithmetic operation including n-bit numbers is too small to show by n-bits, underflow is said to occur. Overflow

Specified the average case complexity of sequential search in an array of unsorted elements of size n if the following conditions hold: a)  Probability of the key to be in the a

What are the Difference between $display and $strobe Difference between $display and $strobe is that $strobe displays parameters at the very end of current simulation time unit