CMPT 150 Lecture Notes - Lecture 2: Dispatch Table, And Gate, Operand

• School: Simon Fraser University
• Department: Computing Science
• Course: CMPT 150
• Professor: Anthony Dixon

Document Summary

A function table (or truth table if the input and output alphabets are binary) is a listing of the output sequence expected for every valid input sequence. There are a nite number of functions (and therefore devices), since there are a nite number of bits in the input and output sequences. Example 1: 1-input, 1-output: four possible functions - m0, m1, m2, m3: x m0 m1 m2 m3. Note: this table actually represents 4 distinct function (truth) tables: m0, m1, m2, and m3. Since they all have the same set of possible input sequences, these need only be expressed once on the left-hand side with the understanding that this is the left-hand side for each output column. Example 2: 2-input, 1-output: sixteen possible functions - p0 through p15: x1. 1 x0 p0 p1 p2 p3 p4 p5 p6 p7. 0 x0 p8 p9 p10 p11 p12 p13 p14 p15.