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

Programmable Logic Controller (PLC):

  • PLC is a specialized computer used in industrial segments to control machines and process.
  • PLC is program that consists of a set of instructions which resembles the controlling functions needed to perform specific tasks.
  • The function of PLC is similar to that of a relay and hence, in an industrial segment a relay is greatly replaced by a suitable PLC.
  • When compared to general Personal Computer (PC), a PLC is available in small and tiny sizes.
  • The basic architecture of a PLC consists of an input-output interface module and a small Central Processing Unit (CPU) that runs by controlling programming language.

Hexadecimal number system:

  • In hexadecimal number system, the numbers from “0” to “9” and letters from “A” to “F” are used.
  • It means, in total, hexadecimal system has 10 numbers and 6 alphabets.
  • Therefore, the base used for hexadecimal numbering system is 16.

Binary number system:

  • In binary system, the numbers “0” and “1” are only used.
  • It means, in total, binary system has only 2 numbers.
  • Therefore, the base used for binary numbering system is 2.

Explanation of Solution

b.

Conversion of binary number to its equivalent hexadecimal code:

  • Given, binary number is “00100101”.
  • First, the given binary number is partitioned into two groups, such that each group contains only four bits.
  • Now, each group is converted to its corresponding hexadecimal code.
  • Here, “0010” is one such group and “0101” is the other group.
  • The following diagram describes the hexadecimal notation of the binary number “0010”.

  • The hexadecimal equivalent of decimal number “2” is “2”...

Explanation of Solution

c.

Conversion of binary number to its equivalent hexadecimal code:

  • Given, binary number is “01001110”.
  • First, the given binary number is partitioned into two groups, such that each group contains only four bits.
  • Now, each group is converted to its corresponding hexadecimal code.
  • Here, “0100” is one such group and “1110” is the other group.
  • The following diagram describes the hexadecimal notation of the binary number “0100”.

  • The hexadecimal equivalent of decimal number “4” is “4”...

Explanation of Solution

d.

Conversion of binary number to its equivalent hexadecimal code:

  • Given, binary number is “00111001”.
  • First, the given binary number is partitioned into two groups, such that each group contains only four bits.
  • Now, each group is converted to its corresponding hexadecimal code.
  • Here, “0011” is one such group and “1001” is the other group.
  • The following diagram describes the hexadecimal notation of the binary number “0011”.

  • The hexadecimal equivalent of decimal number “3” is “3”...

Blurred answer
Students have asked these similar questions
6. What is Race condition? How to prevent it? [2 marks] 7. How many synchronization methods do you know and compare the differences. [2 marks] 8. Explain what are the “mutual exclusion”, “deadlock”, “livelock”, and “eventual entry”, with the traffic intersection as an example like dinning philosophy. [2 marks] 9. For memory allocation, what are the difference between internal fragmentation and external fragmentation. Explain with an example. [2 marks] 10. How can the virtual memory map to the physical memory. Explain with an example. [2 marks]
Your answers normally have 50 words. Less than 50 words will not get marks. 1. What is context switch between multiple processes? [2 marks] 2. Draw the memory layout for a C program. [2 marks] 3. How many states does a process has? [2 marks] 4. Compare the non-preemptitve scheduling and preemptive scheduling. [2 marks] 5. Given 4 process and their arrival times and next CPU burst times, what are the average times and average Turnaround time, for different scheduling algorithms including: a. First Come, First-Served (FCFS) Scheduling [2 marks] b. Shortest-Job-First (SJF) Scheduling [2 marks] c. Shortest-remaining-time-first [2 marks] d. Priority Scheduling [2 marks] e. Round Robin (RR) [2 marks] Process Arrival Time Burst Time P1 0 8 P2 1 9 P3 3 2 P4 5 4
a database with multiple tables from attributes as shown above that are in 3NF, showing PK, non-key attributes, and FK for each table? Assume the tables are already in 1NF. [Hint: 3 tables will result after deducing 1NF -> 2NF -> 3NF]
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Enhanced Discovering Computers 2017 (Shelly Cashm...
Computer Science
ISBN:9781305657458
Author:Misty E. Vermaat, Susan L. Sebok, Steven M. Freund, Mark Frydenberg, Jennifer T. Campbell
Publisher:Cengage Learning
Text book image
CompTIA Linux+ Guide to Linux Certification (Mind...
Computer Science
ISBN:9781305107168
Author:Jason Eckert
Publisher:Cengage Learning
Text book image
MIS
Computer Science
ISBN:9781337681919
Author:BIDGOLI
Publisher:Cengage
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Text book image
A+ Guide to Hardware (Standalone Book) (MindTap C...
Computer Science
ISBN:9781305266452
Author:Jean Andrews
Publisher:Cengage Learning
Text book image
A+ Guide To It Technical Support
Computer Science
ISBN:9780357108291
Author:ANDREWS, Jean.
Publisher:Cengage,