ITI 1100 Study Guide - Final Guide: Circuit Diagram, Logic Gate, Boolean Function

• School: University of Ottawa
• Department: Information Technology
• Course: ITI 1100
• Professor: Qi Hao

Document Summary

React to input values and output a set of desired data. New output appear after change in output. Ex/ code conversion convert from bcd to excess-3 code: each code uses four bits, we will need 4 inputs (bcd) and 4 outputs (excess, draw truth table, obtain simplified versions of functions, draw logic diagram. Combinational circuit that preforms the addition of two bits is called a half adder. One that preforms addition of three bits (two significant bits and a carry) is called a full adder: two half adders can produce one full adder. We need two outputs (the numbers being added) and two inputs (the carry and the sum) This form is used to show that two half adders can make a full adder. Addition of n-bit binary number requires use of full adder. Process of addition proceeds right to left, beginning from least significant. X and y are for the two addition bit and z is the carry bit.