Is this truth table hitting all the possible cases?

  • Thread starter Thread starter mr_coffee
  • Start date Start date
  • Tags Tags
    Table Truth table
AI Thread Summary
The discussion centers on verifying the accuracy of a truth table related to a security system circuit. The user expresses concern about potentially incorrect entries in the truth table before proceeding with implementation. They clarify the inputs from six sensors and the master switch, which dictate the outputs for the alarm, lights, video cameras, and police call. A key point raised is the calculation of possible combinations, suggesting there should be 2^(n-1) rows for the sensors when the master switch is on. Ultimately, the user concludes that the truth table is correct.
mr_coffee
Messages
1,613
Reaction score
1
Hello everyone, I don't want to implement the rest of this circuit if i messed the truth table up! So i was wondering if someone can take a look to see if the truth table seems to hit all the cases and looks correct.
http://img417.imageshack.us/img417/6629/lastscan4hi.jpg
Here is what the problem says:
Inputs:
<tex>S_i = 0, 1, 2, 3, 4, 5</tex> - signals from six sensors sets (0 - instrution detected, 1 - no intrusion detected).
M- master switch (0- security system on, 1- security system off)

Outputs:
A- alarm (0 - alarm on, 1- alarm off)
L - lights (0 - lights on, 1 - lights off)
V - video cameras (0 - video cameras OFF, 1 - video cameras ON)
C- call to police (0 - call OFF, 1- call ON);

Thanks!
 
Last edited by a moderator:
Physics news on Phys.org
n/m, it is right.
 
Since you have inputs 0-5 and we only care about when M is on except for the one case when it is off, shouldn't there be 2^(n-1) possibilities or rows for the sensors?
 
Back
Top