Programmable Logic Controllers
5th Edition
ISBN: 9780073373843
Author: Frank D. Petruzella
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
Chapter 15.1, Problem 23RQ
Program Plan Intro
Array:
- An array is a tag type that holds multiple pieces of data as a block.
- In an array, each element should be of same data type such as BOOL, SINT, or INT.
- It resides in a neighboring block of the controller’s memory.
- Arrays are similar to tables of data. In an array, the data can be represented in 1, 2, or 3 dimensional arrays.
- One element represents a single tag within the array.
Example:
The example for a one-dimensional array is given below: Consider an array named “Sample” which of “INT” data type. Let the size of the array be 6.
Array representation
From the above representation,
- The tag name is “Sample”.
- The array can holds “6” integer values, which are represented by “Sample [0]” to “Sample [5]”.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Question 1 (15 Points) Inheritance:
In this question, we are going to create a new subclass of the SimpleGeometricObject class,
named Triangle. Create a SimpleGeometricObject.java and Copy the source code of the
SimpleGeometricObject class from the following link:
https://liveexample.pearsoncmg.com/html/SimpleGeometricObject.html
TASK 1: Create a Triangle class that extends the SimpleGeometricObject class in Eclipse, following
the below UML diagram.
+ base:double = 5
+ height:double = 10
Triangle
+ Triangle()
+ Triangle(newBase: double, newHeight: double)
+ getArea(): double
+ setBase(): void
+ setHeight(): void
+ getBase(): double
+ getHeight(): double
Question 2 (10 Points): String vs. StringBuilder
Create a Question2.java file and finish the following tasks:
Task 1.
a) Create a 1D array of integers to store 50 integers.
b) Store values from 0 to 49 in the array you just created.
c) Create a new String Object using no-arg constructor.
d) Using for loop to add the array elements one by one to the String (one per loop iteration)
Hint: to append an element to a String, use the + operator.
e) Output the String on the console. Record and display a run-time it took to append all
integers to the String (record run-time of 1.d.)). Please submit a screenshot. The
screenshot should match the following example:
012345678910111213141516171819202122232425262728293031323334353637383940414243444546474849
it took 196708 nanoseconds to append 50 integers to the String.|
Hint: You can use the following statements to record run-time.
long begin, end, time; // we will measure time it took
begin = System.nanoTime(); //we measure in nanoseconds.
// put…
Answer this Java OOP question below:
Discuss the challenges and benefits of using multiple levels of inheritance in a class hierarchy. How can deep inheritance structures impact the maintainability and readability of code?
Chapter 15 Solutions
Programmable Logic Controllers
Ch. 15.1 - Prob. 1RQCh. 15.1 - Prob. 2RQCh. 15.1 - Prob. 3RQCh. 15.1 - Prob. 4RQCh. 15.1 - Prob. 5RQCh. 15.1 - Prob. 6RQCh. 15.1 - Prob. 7RQCh. 15.1 - Prob. 8RQCh. 15.1 - Prob. 9RQCh. 15.1 - Prob. 10RQ
Ch. 15.1 - Prob. 11RQCh. 15.1 - Compare the accessibility of program scope and...Ch. 15.1 - Prob. 13RQCh. 15.1 - What is the difference between a produced tag and...Ch. 15.1 - Prob. 15RQCh. 15.1 - State the data type used for each of the...Ch. 15.1 - Describe the make-up of a predefined structure.Ch. 15.1 - Describe the make-up of a module-defined...Ch. 15.1 - Describe the make-up of a user-defined structure.Ch. 15.1 - Prob. 20RQCh. 15.1 - Prob. 21RQCh. 15.1 - Prob. 22RQCh. 15.1 - Prob. 23RQCh. 15.2 - Prob. 1RQCh. 15.2 - Prob. 2RQCh. 15.2 - Prob. 3RQCh. 15.2 - Prob. 4RQCh. 15.2 - Prob. 5RQCh. 15.2 - Prob. 6RQCh. 15.2 - Prob. 7RQCh. 15.2 - Prob. 8RQCh. 15.2 - Prob. 9RQCh. 15.2 - Prob. 10RQCh. 15.2 - Prob. 11RQCh. 15.2 - Extend control of the original ControlLogix...Ch. 15.2 - Prob. 3PCh. 15.3 - Prob. 1RQCh. 15.3 - Prob. 2RQCh. 15.3 - Prob. 3RQCh. 15.3 - Prob. 4RQCh. 15.3 - Prob. 5RQCh. 15.3 - Prob. 6RQCh. 15.3 - Prob. 7RQCh. 15.3 - Prob. 8RQCh. 15.3 - Prob. 9RQCh. 15.3 - Prob. 10RQCh. 15.3 - Prob. 11RQCh. 15.3 - Prob. 12RQCh. 15.3 - Modify the original CLX ten-second TON timer...Ch. 15.3 - Prob. 2PCh. 15.3 - Prob. 3PCh. 15.3 - Prob. 4PCh. 15.3 - Prob. 5PCh. 15.3 - Prob. 6PCh. 15.4 - Prob. 1RQCh. 15.4 - Prob. 2RQCh. 15.4 - Prob. 3RQCh. 15.4 - Prob. 4RQCh. 15.4 - Prob. 5RQCh. 15.4 - Prob. 6RQCh. 15.4 - Prob. 7RQCh. 15.4 - Prob. 1PCh. 15.4 - Prob. 2PCh. 15.5 - Prob. 1RQCh. 15.5 - Prob. 2RQCh. 15.5 - Prob. 3RQCh. 15.5 - Prob. 4RQCh. 15.5 - Prob. 5RQCh. 15.5 - Construct a ControlLogix ladder rung with compare...Ch. 15.5 - Prob. 2PCh. 15.5 - A single pole switch is used in place of the two...Ch. 15.6 - Prob. 1RQCh. 15.6 - Name the four basic elements of an FBD.Ch. 15.6 - Prob. 3RQCh. 15.6 - Prob. 4RQCh. 15.6 - Prob. 5RQCh. 15.6 - Prob. 6RQCh. 15.6 - Prob. 7RQCh. 15.6 - Prob. 8RQCh. 15.6 - Prob. 9RQCh. 15.6 - Prob. 10RQCh. 15.6 - Prob. 11RQCh. 15.6 - How is a function block feedback loop created?Ch. 15.6 - Prob. 13RQCh. 15.6 - Prob. 14RQCh. 15.6 - Prob. 1PCh. 15.6 - Prob. 2PCh. 15.6 - Prob. 3PCh. 15.6 - Prob. 4PCh. 15.6 - Prob. 5P
Knowledge Booster
Similar questions
- Answer the Java OOP question below: Explain the relationship between a superclass and a subclass. How do the principles of encapsulation and abstraction play a role in this relationship? In your experience, how do you decide what should be included in a superclass versus a subclass? Share an example where a well-defined superclass-subclass hierarchy improved your code.arrow_forward1.) Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable. ii) Let ALLDFA = {(A)| A is a DFA and L(A) = "}. Show that ALLDFA is decidable. iii) Let AECFG = {(G)| G is a CFG that generates &}. Show that AECFG is decidable. iv) Let ETM {(M)| M is a TM and L(M) = 0}. Show that ETM, the complement of Erm, is Turing-recognizable. Let X be the set {1, 2, 3, 4, 5} and Y be the set {6, 7, 8, 9, 10). We describe the functions f: XY and g: XY in the following tables. Answer each part and give a reason for each negative answer. n f(n) n g(n) 1 6 1 10 2 7 2 9 3 6 3 8 4 7 4 7 5 6 5 6 Aa. Is f one-to-one? b. Is fonto? c. Is fa correspondence? Ad. Is g one-to-one? e. Is g onto? f. Is g a correspondence? vi) Let B be the set of all infinite sequences over {0,1}. Show that B is uncountable using a proof by diagonalization.arrow_forwardCan you find the least amount of different numbers to pick from positive numbers (integers) that are at most 100 to confirm two numbers that add up to 101 when each number can be picked at most two times?arrow_forward
- Can you find the formula for an that satisfies the provided recursive definition? Please show all steps and justificationarrow_forwardWhat is the number of injective functions f from set {1,2,....,2n} to set {1,2,....,2n} so that f(x) >= x for all the 1<= x <= n?arrow_forwardIdeal MOSFET Current–Voltage Characteristics—NMOS Device and draw the circuitarrow_forward
- 1. Create a Person.java file. Implement the public Person and Student classes in Person.java, including all the variables and methods in the UMLS. Person -name: String -street: String -city: String +Person(String name, String, street, String, city) +getName(): String +setName(String name): void +getStreet(): String +setStreet(String street): void +getCity(): String +setCity(String City): void +toString(): String Student -Id: int +Person(String name, String, street, String, city, int Id) +getId(): int +setId(int Id): void +toString(): String 2. Create a StudentTest.java file. Implement a public StudentTest class with a main method. In the main method, create one student object and print the object using System.out.println(). Your printing result must follow the example output: name: Mike, street: Morris Ave, city: Union, Id: 1000 Hint: You need to modify the toString methods in the Student class and Person class!arrow_forward1) Apply the Paint Blue algorithm discussed in class to the following Finite Automata. a a a b b a COIS-3050H-R-W01-2025WI-COMB Formal Languages & Automata a b Show the status of the Finite Automata at the conclusion of the Paint Blue Algorithm (mark the visited states with an X and only include edges that have not been followed). 2) Use the pumping lemma to prove the following language is nonregular: L= {ab} = {abbb, aabbbbbb, aaabbbbbbbbb, ...}arrow_forward3) Find CFGs that for these regular languages over the alphabet Σ= {a, b}. Draw a Finite Automata e CFG. 1 COIS-3050H-R-W01-2025WI-COMB Formal anguages & Automata Is that contain the substring aba. (b) The language of all words that have an odd number letters and contains the string bb. (c) The language of all words that begin with the substring ba and contains an odd number of letters. 4) Convert the following FA into a PDA. a a S± b a a Ν Ꮓarrow_forward
- COIS-3050H-R-W01-2025WI-COMB Formal ministic PDA. Are the following words accepted by this Languages & Automata UI MIUSɩ that aTU I ed, indicate which state the PDA is in when the crash occurs. (a) aabbaa (b) aaabab (c) bababa Start (d) aaaabb A Accept Read₁ Push a (e) aaaaaa a b Read, Popi a a,b A Read₂ Accept A Pop₂arrow_forward5) Eliminate the A-productions from the following CFG: Abc COIS-3050H-R-W01-2025WI-COMB Formal Languages & Automata BAabC C CaA | Bc | A 6) Convert the following CFG into CNF. S→ XYZ XaXbS | a |A YSbS | X | bb Z→ barrow_forwardNeed help answering these questions!1. Design a While loop that lets the user enter a number. The number should be multiplied by 10, and the result stored in a variable named product. The loop should iterate as long as the product contains a value less than 100. 2. Design a For loop that displays the following set of numbers: 0, 10, 20, 30, 40, 50 . . . 1000 3. Convert the While loop in the following code to a Do-While loop: Declare Integer x = 1 While x > 0 Display "Enter a number." Input x End Whilearrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT
Programming with Microsoft Visual Basic 2017Computer ScienceISBN:9781337102124Author:Diane ZakPublisher:Cengage Learning
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
New Perspectives on HTML5, CSS3, and JavaScriptComputer ScienceISBN:9781305503922Author:Patrick M. CareyPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning