Create the PolynomialDemoClass: instantiate and initialize PolynomialDataStrucClass objects p1, p2, p3, p4 Add terms to the polynomials (pass 2 arguments to the method: coefficient and exponent- for example: addPolyNodeLast(4, 3);) Print out p1, p2 and sum of the polynomials AND p3, p4, and sum of the polynomials Use: p1= 4x^3 + 3x^2 – 5 ; p2 = 3x^5 + 4x^4 + x^3 – 4x^2 + 4x^1 + 2 AND p3= -5x^0 + 3x^2 + 4x^3 ; p4 = -4x^0 + 4x^3 + 5x^4

JAVA complete a method that swaps the first and second half of an array of integers. For example, if the array contains the values 1 4 9 16 25 36then after calling the method, it should contain the values16 25 36 1 4 9If the array contains an odd number of elements, leave the middle element in place. For example, 1 4 9 16 25 36 45becomes25 36 45 16 1 4 9

Write the definition of a method reverse, whose parameter is an array of chars. The method reverses the elements of the array. The method does not return a value.

Question 2. package sortsearchassigncodeex1; import java.util.Scanner; import java.io.*; // // public class Sortsearchassigncodeex1 { // public static void fillArray(Scanner inputFile, int[] arrIn){ int indx = 0; //Complete code { arrIn[indx] = inputFile.nextInt(); indx++; } }

Execute the following statements over initially empty ArrayList myList one after another (cascade). Explain what was changed after each statement (what did it do?) myList.add("z"); ArrayList content: Your explanation (where this output came from): myList.add(0, "a"); ArrayList content: Your explanation (where this output came from): myList.add("t"); ArrayList content: Your explanation (where this output came from): myList.add(2,"w"); ArrayList content: Your explanation (where this output came from): myList.set(0,"b"); ArrayList content: Your explanation (where this output came from):

Java Code: Below are the methods for parser.java. Make sure to use the existing Parser.java file to add in all the methods and show the output. OperationNode: Has enum, left and Optional right members, good constructors and ToString is good VariableReferenceNode: Has name and Optional index, good constructors and ToString is good Constant & Node Pattern: Have name, good constructor and ToString is good ParseLValue - variables: Accepts a variable name and creates an appropriate Variable Reference Node ParseLValue - arrays: Accepts a name, appropriately gets an index and creates an appropriate Variable Reference Node ParseLValue - dollar: Creates an operation node, gets the value of the $ operator appropriately ParseBottomLevel – constants & patterns: Detects strings, numbers and patterns and creates appropriate nodes ParseBottomLevel – parenthesis: Creates an operation node AND gets the contents of the parenthesis appropriately ParseBottomLevel – unary operators: All...

JAVA Using the code provided below called intSet create an iterator called sortedElements and the inner class. This will return an interator that will produce each element of the inset in ascending order. Specify and implement an iterator method called sortedElements for IntSet. The iterator method sortedElements returns an iterator that will produce each element of the intset in ascending order. The intset cannot be mutated when the iterator is in use. Be sure to specify the iterator method before implementation. Do not forget to give the rep invariant and abstraction function for your implementation. Note: IntSet.java has been provided. You can directly add in the code the specification, the implementation of the iterator method sortedElements, and the inner iterator class. There is a segment of simple testing code for sortedElements in main() close to the end in the provided IntSet.java. The program will not compile until you have properly implemented sortedElements...

Exercise #2 Implement an instance method belonging to the IntArrayBag class that takes two input parameters, oldVal and newVal. The method replaces each oldVal element in the array with newVal. Make sure to include the method header.

Image one is my file. Image 2 is my code(already have method 1 and 2) For my method 3, I want to write A method to find the index of the maximum value in an array takes one parameter, an array of integers returns the index at which the maximum value of the array occurs If the maximum value occurs multiple times, you may return the index of any occurrence

Complete the searching and sorting algorithms in ModuleOne and ModuleTwo of the modules package. Test all sorting algorithms in AlgorithmsTest. You must build everything from scratch and cannot use any methods in other Java packages to make your algorithm. Restrictions : All classes/methods must be made by you. You are ONLY allowed to use java.util.Arrays.toString method You are NOT allowed to use any other the Java API Library classes/methods.

Please help me with this using java and recursion. Please also comment the code. Please do not use hashtags when creating theses fractals. And provide an image of the output. (Just pick one) 1) create a sierpenski triangle fract 2) create a viscek fractals

In Java: Write a method that multiplies all elements in the array by 3 and returns it to the main method.

4. Now examine the ArrayList methods in the above table, a) Which method retrieves elements from the ArrayList? b) Which method replaces the value of an element that already exists in the ArrayList? c) Which two methods initializes the value of an element? d) How do the two methods in (c) differ? Which method(s) would be appropriate in the above Java program (after we convert it to work with ArrayLists)?