Programmable Logic Controllers
Programmable Logic Controllers
5th Edition
ISBN: 9780073373843
Author: Frank D. Petruzella
Publisher: McGraw-Hill Education
bartleby

Concept explainers

Question
Book Icon
Chapter 4, Problem 2P
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 2P , 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 2P , 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 2P , additional homework tip  3

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

Expert Solution
Check Mark

Explanation of Solution

a.

Logic gate circuit:

The logic gate circuit is as follows.

Programmable Logic Controllers, Chapter 4, Problem 2P , additional homework tip  4

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).
  • Now, the resultant along with other inputs “C” and “D” are connected to logic AND gate whose output will be Y=(A+B)CD.

Therefore, the Boolean expression for the given logic circuit is Y=(A+B)CD.

Explanation of Solution

b.

Logic gate circuit:

The logic gate circuit is as follows.

Programmable Logic Controllers, Chapter 4, Problem 2P , additional homework tip  5

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¯”.
  • Then, the inputs “C¯” and “D” are connected to another logic OR gate and the corresponding output will be (C¯+D).
  • Now, the output (A+B) and (C¯+D) are connected to a logic AND gate whose output will be Y=(A+B)(C¯+D).

Therefore, the Boolean expression for the given logic circuit is Y=(A+B)(C¯+D).

Explanation of Solution

c.

Logic gate circuit:

The logic gate circuit is as follows.

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

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).
  • Now, the resultant along with other input “C” is connected to logic OR gate whose output will be Y=(AB+C).

Therefore, the Boolean expression for the given logic circuit is Y=(AB+C).

Explanation of Solution

d.

Logic gate circuit:

The logic gate circuit is as follows.

Programmable Logic Controllers, Chapter 4, Problem 2P , additional homework tip  7

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).
  • Now, the resultant along with other input “C” is connected to logic OR gate whose output will be (AB+C).
  • The input “E” is connected to logic NOT gate and the corresponding output will be “E¯”.
  • Now, the outputs (AB+C) and E¯ along with the input “D” are connected to a logic AND gate whose output will be Y=[(AB+C)DE¯].

Therefore, the Boolean expression for the given logic circuit is Y=[(AB+C)DE¯].

Explanation of Solution

e.

Logic gate circuit:

The logic gate circuit is as follows.

Programmable Logic Controllers, Chapter 4, Problem 2P , additional homework tip  8

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).
  • Then, the inputs “C” and “D” are connected to logic OR gate and the corresponding output will be (C+D).
  • Now, the output (A+B) and (C+D) are connected to a logic AND gate whose output will be Y=(A+B)(C+D).

Therefore, the Boolean expression for the given logic circuit is Y=(A+B)(C+D).

Explanation of Solution

f.

Logic gate circuit:

The logic gate circuit is as follows.

Programmable Logic Controllers, Chapter 4, Problem 2P , additional homework tip  9

Explanation:

In the above given logic gate circuit,

  • The input “B” is connected to logic NOT gate and the corresponding output will be “B¯”.
  • The inputs “A” and “B¯” are connected to logic AND gate and the corresponding output will be (AB¯).
  • Similarly, the input “D” is connected to logic NOT gate and the corresponding output will be “D¯”.
  • The inputs “C” and “D¯” are connected to logic AND gate and the corresponding output will be (CD¯).
  • Then, the input “F” is connected to logic NOT gate and the corresponding output will be “F¯”.
  • The inputs “E” and “F¯” are connected to logic AND gate and the corresponding output will be (EF¯).
  • Finally, the outputs AB¯,  CD¯ and EF¯ are connected to a logic OR gate whose output will be Y=(AB¯+CD¯+EF¯).

Therefore, the Boolean expression for the given logic circuit is Y=(AB¯+CD¯+EF¯).

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
What are the major threats of using the internet? How do you use it? How do children use it? How canwe secure it? Provide four references with your answer. Two of the refernces can be from an article and the other two from websites.
Assume that a string of name & surname is saved in S. The alphabetical characters in S can be in lowercase and/or uppercase letters. Name and surname are assumed to be separated by a space character and the string ends with a full stop "." character. Write an assembly language program that will copy the name to NAME in lowercase and the surname to SNAME in uppercase letters. Assume that name and/or surname cannot exceed 20 characters. The program should be general and work with every possible string with name & surname. However, you can consider the data segment definition given below in your program. .DATA S DB 'Mahmoud Obaid." NAME DB 20 DUP(?) SNAME DB 20 DUP(?) Hint: Uppercase characters are ordered between 'A' (41H) and 'Z' (5AH) and lowercase characters are ordered between 'a' (61H) and 'z' (7AH) in the in the ASCII Code table. For lowercase letters, bit 5 (d5) of the ASCII code is 1 where for uppercase letters it is 0. For example, Letter 'h' Binary ASCII 01101000 68H 'H'…
What did you find most interesting or surprising about the scientist Lavoiser?
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
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
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781305480537
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781285867168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr