Implement the following methods in Java: a. A method named MergeFileswith the following signature that gets...

Implement the following methods in Java:

a. A method named MergeFileswith the following signature that gets two file names and write the content of the first file (sourceFile) into the beginning of the second file (destinationFile. For example, if sourceFile contains “Hello ” and destinationFile contains “World!”, this method must keep sourceFile as it is, but replace the content of the second file by “Hello World!”.public static voidMergeFiles(String sourceFile, String destinationFile)

b. A recursive method with the following signature that gets an Arraylist of Strings and starting from the second node, deletes all alternate nodes of it. The method returns an Arraylist containingthe shortened listin reverseorderas the output.public static ArrayList<String> RecursiveReverseDeleteAlt (ArrayList<String> list)

Solutions

Expert Solution

A). A method named MergeFileswith the following signature that gets two file names and write the content of the first file (sourceFile) into the beginning of the second file (destinationFile. For example, if sourceFile contains “Hello ” and destinationFile contains “World!”, this method must keep sourceFile as it is, but replace the content of the second file by “Hello World!”.public static voidMergeFiles(String sourceFile, String destinationFile)

B). A recursive method with the following signature that gets an Arraylist of Strings and starting from the second node, deletes all alternate nodes of it. The method returns an Arraylist containingthe shortened listin reverseorderas the output.public static ArrayList<String> RecursiveReverseDeleteAlt (ArrayList<String> list)

note: plzzz don't give dislike.....plzzz comment if you have any problem i will try to solve your problem.....plzzz give thumbs up i am in need.

venereology answered 2 months ago

Next > < Previous

Related Solutions

Please write a Java algorithm solving the following problem: Implement a Java method to check if...

Please write a Java algorithm solving the following problem: Implement a Java method to check if a binary tree is balanced. For this assignment, a balanced tree is defined to be a tree such that the heights of the two subtrees of any node never differ by more than one. 1. First, please create the following two classes supporting the Binary Tree Node and the Binary Tree: public class BinTreeNode<T> { private T key; private Object satelliteData; private BinTreeNode<T> parent;...

You shall implement six static methods in a class named BasicBioinformatics. Each of the methods will...

You shall implement six static methods in a class named BasicBioinformatics. Each of the methods will perform some analysis of data considered to be DNA. DNA shall be represented arrays of chars containing only the characters A, C, G and T. In addition to the six methods you will implement, six other methods exist in the class, which use Strings instead of char arrays to represent DNA. These other methods simply invoke the methods you are to implement, so all...

Program in Java Create a class and name it MyArray and implement following method. * NOTE:...

Program in Java Create a class and name it MyArray and implement following method. * NOTE: if you need more methods, including insert(), display(), etc. you can also implement those. Method name: getKthMin(int k) This method receives an integer k and returns k-th minimum value stored in the array. * NOTE: Items in the array are not sorted. If you need to sort them, you can implement any desired sorting algorithm (Do not use Java's default sorting methods). Example: Items...

Java: Create a class and name it MyArray and implement following method. * NOTE: if you...

Java: Create a class and name it MyArray and implement following method. * NOTE: if you need more methods, including insert(), display(), etc. you can also implement those Method name: getKthMin(int k) This method receives an integer k and returns k-th minimum value stored in the array. * NOTE: Items in the array are not sorted. If you need to sort them, you can implement any desired sorting algorithm (Do not use Java's default sorting methods). Example: Items in the...

Program in Java Create a class and name it MyArray and implement following method. * NOTE:...

IN JAVA. I have the following code (please also implement the Tester to test the methods...

IN JAVA. I have the following code (please also implement the Tester to test the methods ) And I need to add a method called public int remove() that should remove the first integer of the array and return it at the dame time saving the first integer and bring down all other elements. After it should decrease the size of the array, and after return and save the integer. package ourVector; import java.util.Scanner; public class ourVector { private int[]...

Java Implement a class named “Fraction” with the following properties: numerator: int type, private denominator: int...

Java Implement a class named “Fraction” with the following properties: numerator: int type, private denominator: int type, private and the following methods: one default constructor which will create a fraction of 1/1. one constructor that takes two parameters which will set the values of numerator and denominator to the specified parameters. int getNum() : retrieves the value of numerator int getDenom(): retrieves the value of the denominator Fraction add(Fraction frac): adds with another Fraction number and returns the result in...

Java program Create a public method named saveData for a class named Signal that will hold...

Java program Create a public method named saveData for a class named Signal that will hold digitized acceleration data. Signal has the following field declarations private double timeStep; // time between each data point int numberOfPoints; // number of data samples in array double [] acceleration = new double [1000]; // acceleration data double [] velocity = new double [1000]; // calculated velocity data double [] displacement = new double [1000]; // calculated disp...

In JAVA Implement the moveMinToFront method in IntSinglyLinkedList. The moveMinToFront method looks through the list to...

In JAVA Implement the moveMinToFront method in IntSinglyLinkedList. The moveMinToFront method looks through the list to find the element with the minimum value. It moves that element to the front of the list. Before abstract view: [7, 3, 2] After Abstract view: [2,7,3] Before Abstract view: [4,1,7] After Abstract view: [1,4,7] public void moveMinToFront() { } Test: package net.datastructures; import org.junit.jupiter.api.Test; import static org.junit.jupiter.api.Assertions.assertEquals; import static org.junit.jupiter.api.Assertions.assertTrue; import java.util.Random; public class IntSinglyLinkedListTest { @Test public void moveMinToFrontTestEmpty() { IntSinglyLinkedList s...

In java design and code a class named comparableTriangle that extends Triangle and implements Comparable. Implement...

In java design and code a class named comparableTriangle that extends Triangle and implements Comparable. Implement the compareTo method to compare the triangles on the basis of similarity. Draw the UML diagram for your classes. Write a Driver class (class which instantiates the comparableTriangle objects) to determine if two instances of ComparableTriangle objects are similar (sample output below). It should prompt the user to enter the 3 sides of each triangle and then display whether or not the are similar...

Subjects