Draw the logical gate scheme and the binary switch scheme that realize the following propositional logic formula

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

2. Binary switches.

(a) Draw the logical gate scheme and the binary switch scheme that realize the following propositional logic formula (1 points of 10):

(x Vy) + (y Vz)

(b) Make the truth table for the given PL formula and determine which scheme is more simple: of logical gates or of binary switches. Remark: a scheme is more simple if it consists of less elements in comparison to another (1 points of 10)

Use the standard notations for the binary switches and the logical gates, see Fig. 2 bellow. The negation of the input 'Boolean variable of a gate can be shortened by replacing the Not gate by the circle in the corresponding place of the input Boolean variable, see Fig. 2 (b) and (c). For example, the scheme of operation - Ay shown in 2 (d) can be replaced by shorter scheme shown in Fig. 2 (e). For the binary switch scheme use Fig. 2 (f) and (g) notations.

 

Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of