Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

The New Turing Omnibus Boolean Systems Logic - Assignment 8 | CSC 490, Assignments of Computer Science

Material Type: Assignment; Professor: Locklair; Class: Senior Seminar; Subject: Computer Science; University: Concordia University - Wisconsin; Term: Fall 2006;

Typology: Assignments

Pre 2010

Uploaded on 07/23/2009

koofers-user-s3l
koofers-user-s3l 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CSC 490 – Computer Science Senior Seminar I Professor Gary
Locklair
Written Homework Assignment #7 Fall
2006
Chapter 3 in The New Turing Omnibus – Systems of Logic
[Similar to Problem 1, p. 20 (Show NOR is complete)]
Demonstrate that NOR is a complete base by constructing the following
Boolean functions using only NOR gates: AND, OR, NOT, NAND along with
NONIMPLICATION.
Demonstrate your answer by creating appropriate circuits in Electronic
Workbench. Save your EWB file to Chemnitz.
{15 points}
CSC 490 – Computer Science Senior Seminar I Professor Gary
Locklair
Written Homework Assignment #7 Fall
2006
Chapter 3 in The New Turing Omnibus – Systems of Logic
[Similar to Problem 1, p. 20 (Show NOR is complete)]
Demonstrate that NOR is a complete base by constructing the following
Boolean functions using only NOR gates: AND, OR, NOT, NAND along with
NONIMPLICATION.
pf2

Partial preview of the text

Download The New Turing Omnibus Boolean Systems Logic - Assignment 8 | CSC 490 and more Assignments Computer Science in PDF only on Docsity!

CSC 490 – Computer Science Senior Seminar I Professor Gary Locklair Written Homework Assignment #7 Fall 2006 Chapter 3 in The New Turing Omnibus – Systems of Logic [Similar to Problem 1, p. 20 (Show NOR is complete)] Demonstrate that NOR is a complete base by constructing the following Boolean functions using only NOR gates: AND, OR, NOT, NAND along with NONIMPLICATION. Demonstrate your answer by creating appropriate circuits in Electronic Workbench. Save your EWB file to Chemnitz. {15 points} CSC 490 – Computer Science Senior Seminar I Professor Gary Locklair Written Homework Assignment #7 Fall 2006 Chapter 3 in The New Turing Omnibus – Systems of Logic [Similar to Problem 1, p. 20 (Show NOR is complete)] Demonstrate that NOR is a complete base by constructing the following Boolean functions using only NOR gates: AND, OR, NOT, NAND along with NONIMPLICATION.

Demonstrate your answer by creating appropriate circuits in Electronic Workbench. Save your EWB file to Chemnitz. {15 points}