Programmable Logic Controllers
Programmable Logic Controllers
5th Edition
ISBN: 9780073373843
Author: Frank D. Petruzella
Publisher: McGraw-Hill Education
Question
Book Icon
Chapter 4, Problem 6RQ
Program Plan Intro

Logic gate:

  • Logic gate is an electronic circuit that is used to take logical decisions based on the input.
  • It contains one or more number of inputs and one output.
  • The working of logic gate is based on the binary principle that has two states either logic 0 or logic 1.
  • The output of logic gate is produced when it satisfies any of its logic conditions.
  • The logic condition depends upon the type of the gates and the number of inputs.
  • The primary logic gates include AND, OR and NOT and the combinations of these gates are used to implement any of the other logic gates.

AND gate:

  • The AND gate refers to a logic gate whose output will be HIGH only when all the inputs are HIGH.
  • The output of AND gate will be LOW when any one of its input is LOW.
  • The symbol to represent AND gate is given below:

Programmable Logic Controllers, Chapter 4, Problem 6RQ , additional homework tip  1

  • The truth table for AND gate is as follows:
INPUT AINPUT BOUTPUT Y
000
010
100
111

OR gate:

  • The OR gate refers to a logic gate whose output will be HIGH when any one of its inputs are HIGH.
  • The output of AND gate will be LOW when both the inputs are LOW.
  • The symbol to represent OR gate is given below:

Programmable Logic Controllers, Chapter 4, Problem 6RQ , additional homework tip  2

  • The truth table for OR gate is as follows:
INPUT AINPUT BOUTPUT Y
000
011
101
111

NOT gate:

  • The NOT gate refers to a logic gate whose output will be HIGH when it’s input is LOW and whose output will be LOW when it’s input is HIGH.
  • The symbol to represent NOT gate is given below:

Programmable Logic Controllers, Chapter 4, Problem 6RQ , additional homework tip  3

  • The truth table for NOT gate is as follows:
INPUT AOUTPUT Y
01
10

Explanation of Solution

b.

Logic gate circuit:

The logic gate circuit for the given Boolean expression Y=AB+CD is as follows.

Explanation:

In the above given logic gate circuit,

  • The inputs “A” and “B” are connected to logic AND gate and the corresponding output will be (AB)

Explanation of Solution

c.

Logic gate circuit:

The logic gate circuit for the given Boolean expression Y=(A+B)(C¯+D) is as follows.

Explanation:

In the above given logic gate circuit,

  • The inputs “A” and “B” are connected to logic OR gate and the corresponding output will be (A+B).
  • The input “C” is connected to logic NOT gate and the corresponding output will be “C¯

Explanation of Solution

d.

Logic gate circuit:

The logic gate circuit for the given Boolean expression Y=[A¯(B+CD)] is as follows.

Explanation:

In the above given logic gate circuit,

  • The inputs “C” and “D” are connected to logic AND gate and the corresponding output will be (CD).
  • Now, the resultant along with other input “B” is connected to logic OR gate whose output will be (B+CD)

Explanation of Solution

e.

Logic gate circuit:

The logic gate circuit for the given Boolean expression Y=(A¯B+C) is as follows.

Explanation:

In the above given logic gate circuit,

  • The input “A” is connected to logic NOT gate and the corresponding output will be “A¯

Explanation of Solution

f.

Logic gate circuit:

The logic gate circuit for the given Boolean expression Y=[(ABC+D)EF¯] is as follows.

Explanation:

In the above given logic gate circuit,

  • The inputs “A”, “B” and “C” are connected to logic AND gate and the corresponding output will be (ABC).
  • Now, the resultant along with the other input “D” is connected to logic OR gate whose output will be (ABC+D)

Blurred answer
Students have asked these similar questions
the nagle algorithm, built into most tcp implementations, requires the sender to hold a partial segment's worth of data (even if pushed) until either a full segment accumulates or the most recent outstanding ack arrives. (a) suppose the letters abcdefghi are sent, one per second, over a tcp connection with an rtt of 4.1 seconds. draw a timeline indicating when each packet is sent and what it contains.
Just need some assistance with number 3 please, in C#
How do we find the possible  final values of variable x in the following program.   Int x=0; sem  s1=1, s2 =0;   CO P(s2); P(s1); x=x*2; V(s1); // P(s1); x=x*x; V(s1); // P(s1); x=x+3; V(s2); V(s1); Oc
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781285867168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Text book image
Fundamentals of Information Systems
Computer Science
ISBN:9781337097536
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning