ITI 1100 : Lab report 2.docx

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

Document Summary

Objectives: proving that the function can be simplified using boolean algebra, testing to see if the function was simplified correctly. Implementing a combinational circuit using nand, and, or, nor and inverter gates: test the combinational circuit, the laws of boolean algebra (example: demorgan"s) is proven. Theoretically, the function simplifies to f=1, therefore the circuit was expected to always equal: indeed, the long simplified function was designed and implemented and tested. The results were always equal to 1 proving the hypothesis, and theoretical work. This means that particular populates and theorems of boolean algebra can defiantly be used to simplify a complicated function. The boolean populates and theorems used in the preparation of the lab were the following: involution, demorgan, absorption and theorems 1 and 2. The results of the function were always equal to one, thus the simplified function is correct.