TRUTH TABLE

PRESENTED BY :PRASHANT SHARMA

TRUTH VALUES

 

Truth value of a logical variable tells us the logical state of that variable . In logic calculus we represent it by True & False In Mathematical form by X , X’ In Boolean Algebra by 1 , 0.

TRUTH TABLE
Truth table of a function / boolean expression of ‘N’ variables is a tabular representations of inputs & outputs of fuction/boolean expression in terms of their truth values . It involves all the minterms of a given function in input part & corresponding to each minterm its output is depicted as per the function .

EXAMPLE

Y = A’BC’ + AB’C + ABC
OUTPUT B B’ B’ B B B’ B’ C C’ C C’ C C’ C Y FALSE FALSE TRUE FALSE FALSE TRUE

INPUT A A’ A’ A’ A’ A A

RANDOM
HFHG FGFDG SDDGDF NJBNMH M

DFGDFG FGF

DFGDFG FGHJ

Symbol For Truth Value
  

X’ , X For any variable X False , True 0 , 1

PARTS OF TRUTH TABLE
 

Input Output
OUTPUTS

INPUTS

CLASSIFICATION
There are two types of classifications of truth table

 

Based on no of inputs / outputs Based on dependency of inputs / outputs

A) Based on no of I / O
   

Single Single Multiple Multiple

Input Input Input Input

Single Output Multiple Output Single Output Multiple Output

Single Input Single Output
Expression Y = A
INPUT A 0 1 OUTPUT Y 0 1

Single Input Multiple Output

Expression : Y1 = A Y2 = A’
INPUT A 0 1 Y1 0 1 OUTPUT Y2 1 0

Multiple Input Single Output

Expression : Y = A + B
INPUT A 0 0 1 1 B 0 1 0 1 OUTPU T Y 0 1 1 1

Multiple Input Multiple Output

Expression : Y1 = A + B , Y2 = Y1’ INPUT A 0 0 1 1 B 0 1 0 1 OUTPUT Y1 0 1 1 1 Y2 1 0 0 0

B) Based on dependency of I / O

Input independent Output independent Input independent Output dependent Input dependent Output independent Input dependent Output dependent

Input Independent Output Independent
Expression Y = A
INPUT A 0 1 OUTPUT Y 0 1

Input Independent Output Dependent

Expression : Y1 = A Y2 = Y1’
INPUT A 0 1 Y1 0 1 OUTPUT Y2 1 0

Input Dependent Output Independent

Expression : Y1 = A+BC , Y2 =A+B+C
INPUT B 0 1 0 1 OUTPUT Y2 1 1 1 1 A 0 0 1 1 C=A+B ’ 1 0 1 1 Y1 0 0 1 1

Input Dependent Output Dependent

Expression : Y1 = A+BC , Y2 = Y1’
INPUT B 0 1 0 1 OUTPUT Y2 1 1 0 0 A 0 0 1 1 C=A+B ’ 1 0 1 1 Y1 0 0 1 1

AlGORITHM

Write down all the minterms for ‘N’ variables / inputs in the special sequence . Find each product appearing in Y ( where Y is output ) Mark the output as true / 1 corresponding to those minterm which are present in Y

STATES FOR EVALUATING TRUTH TABLE
 

INPUT STATE :- Write all minterms INTERMEDIATE STATE :- Find all the partial outputs necessary for final output OUTPUT STATE :- Find output according to given expression REPEATED OUTPUT STATE :- For multiple outputs , find output of all expressions