Onthebooleanexpression a

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: time Quiz time Which Boolean expression can be obtained by using DeMorgan’s Law ,, ⋅ ̅? on the Boolean expression a̅ ⋅ Which Boolean expression can be obtained by using DeMorgan’s Law b c ̅ ⋅ ⋅ ̅ on the Boolean expression a b c d ̅ ,,, ⋅ ⋅ ? ⋅̅ ̅ ̅ ̅ ̅ ⋅ 3 2/9/2014 A minimal SOP expression has the fewest product terms and the fewest literals of equivalent Boolean expressions Quiz time The following two Boolean expressions are equivalent. ̅ ̅ ̅ ̅ ̅ a) true b) false ̅ ̅ ̅ ̅ ̅ A minimal POS expression has the fewest sum terms and the fewest literals of equivalent Boolean expressions ̅ ̅ ̅ ̅ ̅ Minimal Boolean expressions let us build simpler logic circuits ̅ ̅ ̅ ̅ ̅̅ ̅ ̅ ̅ ̅...
View Full Document

This document was uploaded on 03/21/2014.

Ask a homework question - tutors are online