Write a method reverse that takes an array as an argument and returns a new array with the elements in reversed order. Do not modify the array.Only edit code in the /* Your code code goes here */ portions. UtilsC Grades.java xtest.java XC ArrayDemo.java x© NumbeC PrintDemo.java xPasswordGenerator.java XIntegerName.java xmaProjects/CSC 1350public class Arrayutils1.3/*** Returns an array with the elements in reversed order.* @param words an array of String.4.* @return a new array as described here.7*/8.9 @public static /* Your code goes here */ reverse(String[] words)estment210dCharactersceStrengthmulation211String[] result = /* Your code goes here */;12for (int i = 0; i < words.length; i++)13{14/* Your code goes here */;15}16return result;sa17}1.java1819ceramentTableGeneratoreleeDemoPartyPooperDemoealSumDuplicateWordsDemoalatorharsmlriesConsolesmsTerminalK BuildMaoRoelu D

Algorithm: Start Implement a method reverse() which an array as argument and returns an array whose…

Write a method reverse that takes an array as an argument and returns a new array with the elements in reversed order. Do not modify the array. Only edit code in the /* Your code code goes here */ portions.

Write a method reverse that takes an array as an argument and returns a new array with the elements in reversed order. Do not modify the array. Only edit code in the /* Your code code goes here */ portions.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Modify the unsortedArrayAccess class by adding a method that find the smallest element and average in the array. import java.util.*; public class unsortedArrayAccess{ public static double[] arr; public int arraySize; public unsortedArrayAccess(int scale) { arr = new double[scale]; arraySize = 0; } public int search(double Key) { int i = 0; while ((i < arraySize) && (arr[i] != Key) ) { i = i + 1; } if (i < arraySize) { return i; } else { System.out.println("There is no such item!"); return -1; } } public void append(double Item) { arr[arraySize] = Item; arraySize = arraySize + 1; } public double remove() { if (arraySize == 0) { System.out.println("There is no item in the array!"); return -1; } double x = arr[arraySize - 1]; arraySize = arraySize - 1; return x; } public void deletion(double Key) { int k = search(Key); if (k != -1) { for (int i = k; i…
Using Java. Implement a deque, except base your implementation on an array. The constructor for the class should accept an integer parameter for the capacity of the deque and create an array of that size. Use a graphical user interface based on an array of text fields similar to what is shown in the image attached. Test your deque class by constructing a deque with capacity 10. Below also is an unfinished code for the challenge. #################################Array Based Deque################################# public class ArrayBaseDeque{private String [ ] q; // Holds queue elementsprivate int front; // Next item to be removedprivate int rear; // Next slot to fillprivate int size; // Number of items in queue private int count = 0;/**Constructor.@param capacity The capacity of the queue.*/ArrayBaseDeque(int capacity){q = new String[capacity];front = 0; rear = 0;size = 0;}/**The capacity method returns the length of the array used to implement the queue.@return The capacity of the…
Make a class TestArrayList with a main method: import java.util.*; public class TestArrayList {public static void main (String [] args) { ArrayList<String> myList = new ArrayList<String>(); myList.add("Z");myList.add(0, "A"); System.out.println(myList); } } Chapter 11 Lab3 • Change the program so that without changing the statements already in program, the contents of the array at the end are: B C A F D
Please help me fix this code Make it run out like the picture import java.util.ArrayList; import java.util.Random; import java.util.Scanner; public class FrogListApp { public static void main(String[] args) { final int MIN_WEIGHT = 1; final int MAX_WEIGHT = 25; // Step 3: Create an array list to store Frog objects ArrayList frogsList = new ArrayList<>(); // Step 4: Create a Scanner object Scanner scanner = new Scanner(System.in); // Step 5: Read an integer as the number of frogs // using prompt "Enter the number of frogs: " System.out.print("Enter the number of frogs: "); int numberOfFrogs = scanner.nextInt(); // Step 6: Read an integer as the random generator seed // using prompt…
Make a class TestArrayList with a main method: import java.util.*; public class TestArrayList { public static void main (String [] args) { ArrayList myList = new ArrayList(); myList.add("Z"); myList.add(0, "A"); System.out.println(myList); } } • Change the program so that without changing the statements already in program, the contents of the array at the end are: B C A F D
this is the template to be user. Add the code here according to the question in image. in java language. public class MergeSort { ArrayList getInput(ArrayList<Integer> al) { // } void getOutput(ArrayList<Integer> al) { // } void merge(ArrayList<Integer> al, int beg, int mid, int end) { // } void sort(ArrayList<Integer> al, int beg, int end) { // } public static void main(String[] args) { // TODO Auto-generated method stub } }
Write a Java class, XXX_Lab7-3, where XXX is your Kean email ID. In the main method:* Create an array with the values: 99, 55, 87, 21, 3, using any method*Create a second array* Copy the elements of the first array to the second* Change an element of the first array.* Print both arrays
In Java intellej Correct this code and add the following 1.Correct: (The error shows a problem under () next to "firstBeachShoot.printPhotoDetails") 2.Add the following to the second package (screenshot): 1.for or for...each or while loops. 2.Arrays 3.default, no-args and parameterized constructors. Here's the first package : import java.util.Scanner;public class Image {int numberOfPhotos; // photos on rolldouble fStop; // light let it 1.4,2.0,2.8 ... 16.0int iso; // sensativity to light 100,200, 600int filterNumber; // 1-6String subjectMatter;String color; // black and white or colorString location;boolean isblurry;public String looksBlurry(boolean key) {if (key == true) {return "Photo is Blurry";} else {return "Photo is Clear";}}public void printPhotoDetails(String s1) {Scanner br = new Scanner(System.in);String subjectMatter = s1;System.out.println("Data of Nature photos:");System.out.println("Enter number of photos:");numberOfPhotos = br.nextInt();int i = 1;while…
Please complete the task by yourself only in JAVA with explanation. Don't copy. Thank you. Only finish the (d) question, Thank you ! Using quicksort to sort an array of car objects by various criteria. Define a class Car as follows: class Car { public String make; public String model; public int mpg; // Miles per gallon } a) Implement a comparator called CompareCarsByMakeThenModel that can be passed as an argument to the quicksort method from the lecture notes. CompareCarsByMakeThenModel should return a value that will cause quicksort to sort an array of cars in ascending order (from smallest to largest) by make and, when two cars have the same make, in ascending order by model. b) Implement a comparator called CompareCarsByDescendingMPG that can be passed as an argument to the quicksort method from the lecture notes. CompareCarsByDescendingMPG should return a value that will cause quicksort to sort an array of cars in descending order (from largest to smallest) by mpg. c)…
Write a Java program to find the median of all elements in an array of integers. The median is the middle value in an ordered set of numbers. If the number of elements is even, the median is the average of the two middle values. Crease a class name Task5. There should be a main method and a “findMedian” method to find out the median of an input array.
public class ReplaceEvenWithZero { public static void main(String[] args) { int[]a = new int[]{14, 2, 19, 3, 15, 22, 18, 7, 44, 39, 51, 78} ; // Print array a for (int i = 0; i < a.length; i++) { System.out.print(a[i] + " "); } System.out.println(); // Replace the even elements. replaceEven(a); // Print array a again to see new elements. for (int i = 0; i < a.length; i++) { System.out.print(a[i] + " "); } System.out.println(); } /** Replace the even elements in the given array with 0 @param arr the array to use for the replacements */ public static void replaceEven(int[] arr) { //-----------Start below here. To do: approximate lines of code = 2 // Write a for loop to go through each element, determine if it is even //If so, replace with 0. Hint: use the modulus operator % to determine if an…
Getting this error when trying to run this program - java.lang.ArrayIndexOutOfBoundsException: Index 1 out of bounds for length 1 here is the program below. import java.util.ArrayList;import java.util.Scanner;import java.io.File;import java.io.FileNotFoundException; public class Largest_Country{public static ArrayList<Country> readCountry(String filename) throws FileNotFoundException { // Create an arraylist of the country class ArrayList<Country> countries = new ArrayList<Country>(); // Create a scanner object to open the input file Scanner scan = new Scanner(new File(filename)); // Initialize a string variable to read the file String line = ""; while(scan.hasNextLine()) { // Read the file line by line line = scan.nextLine(); // Split the line at spaces, and assign the values to // a string array String[] details = line.split(" "); // Create object of the class Country, and pass the values // to the object Country country_info = new Country(details[0],…