exam instructions_updated slides(1)[1]

# suchthatforeveryelementxandy bs

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: be turned on manually, or by the use of a timer, so long as a light sensor indicates that it is dark. Draw the truth table and then the logic diagram. I/P : S – manual switch (S=1) T – timer (T=1) L – light sensor (L=0) O/P: SL – street light (SL=1) I/P : S – manual switch (S=1) T – timer (T=1) L – light sensor (L=0) O/P: SL – street light (SL=1) S 0 0 0 0 1 1 1 1 T 0 0 1 1 0 0 1 1 L 0 1 0 1 0 1 0 1 SL 0 0 1 0 1 1 1 1 11 10/13/2011 Boolean algebra Boolean algebra set • We encounter situations where the choice is binary Move –Stop, On – Off, Yes ‐ No • An intended action takes place or does not take place • Signals with two possible states are called switching signals. • We need to work with a large number of such signals • There is a need for formal methods of handling such signals A Boolean algebra consists of • a finite set BS • subject to equivalence relation "=" • one unary operator "not" (symbolised by an over bar) • two binary operators...
View Full Document

## This note was uploaded on 05/05/2013 for the course ELEC 1111 taught by Professor Jayashriravishankar during the One '11 term at University of New South Wales.

Ask a homework question - tutors are online