Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

CS201 Lab: Introduction to LogicWorks 5 link: http://www.cs.uregina.ca/Links/cla

ID: 3877952 • Letter: C

Question

CS201 Lab: Introduction to LogicWorks 5

link: http://www.cs.uregina.ca/Links/class-info/201/LW5/lab.html

Objectives of this lab:

Preparation

Lab Assignment

Using LogicWorks, test the functionality of each of the following gates:
NAND, NOR and XOR.
Submit your LogicWorks circuits and the resulting truth tables from your experimentation.
You can find these gates from the "Simulation Gates.clf" library.

Design circuits to verify Demorgan's law, (A + B + C)'= A'B'C' and (ABC)'= A' + B' + C'.
Show LogicWorks circuits and the resulting truth tables from your experimentation.

Build a circuit for the Boolean function F = AB + (A XOR B)C + B NAND D and find the truth table by using LogicWorks.
Show the LogicWorks circuit and the resulting truth table in your lab report.

Questions

Reference - Logical Symbols

Here is a list of the logical symbols and their truth tables for your reference.

Back to the top

F

Explanation / Answer

Question 1. A binary switch is the switch that gives the result in two forms same like a binary number as true or false.