ENGG1100|Term2|201415 题香港中文大學 The Chinese University of Hong Kong Truth table · The idea is to have all · Example different combinations of inputs arranged in a table Input: Inpu W= Each combination gives one X Y Output output for the For n digital inputs there will operation be 2n different combinations The truth table has 2n rows 0 0 Example 0 n =2 X and y as inputs ,so there are 2n=4 rows You can see that no two rows have the same combination of Inputs All possible combinations of the inputs, y) are found in the truth table ?=depends on the operation V15.02.09 Introduction 16ENGG1100 | Term 2 | 2014-15 Truth table • The idea is to have all different combinations of inputs arranged in a table • Each combination gives one output • For n digital inputs , there will be 2n different combinations • The truth table has 2n rows • Example: – n=2 (X and Y as inputs), so there are 2n=4 rows – You can see that no two rows have the same combination of inputs – All possible combinations of the inputs (X,Y) are found in the truth table • Example V15.02.09 Introduction 16 Input: X Input: Y W= Output for the operation 0 0 ? 0 1 ? 1 0 ? 1 1 ? ? = depends on the operation