Java Write a program which does the following: Create a class with the main() method. Take a string array input from the user in main() method. Note: Do not hardcode the string array in code. After the String array input loop, the array should be: words[] = {"today", "is", "a", "lovely", "spring","day", "not", "too", "hot", "not", "too", "cold"}; Print the contents of this array using Arrays.toString() method. Write a method called handleString() that performs the following: Takes a String[] array as method parameter (similar to main method). Loop through the array passed as parameter, and for each word in the array: If the length of the word is even, get the index of the last letter & print that index. Use length() and indexOf() String object methods. If the string length is odd, get the character at th

Java Write a program which does the following: Create a class with the main() method. Take a string array input from the user in main() method. Note: Do not hardcode the string array in code. After the String array input loop, the array should be: words[] = {"today", "is", "a", "lovely", "spring","day", "not", "too", "hot", "not", "too", "cold"}; Print the contents of this array using Arrays.toString() method. Write a method called handleString() that performs the following: Takes a String[] array as method parameter (similar to main method). Loop through the array passed as parameter, and for each word in the array: If the length of the word is even, get the index of the last letter & print that index. Use length() and indexOf() String object methods. If the string length is odd, get the character at th

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

Write a method that returns a new array by eliminating theduplicate values in the array using the following method header:public static int[] eliminateDuplicates(int[] list)Write a test program that reads in 10 integers, invokes the method, and displaysthe distinct numbers separated by exactly one space. Here is a sample run of theprogram: Enter 10 numbers: 1 2 3 2 1 6 3 4 5 2 ↵EnterThe distinct numbers are: 1 2 3 6 4 5
I am trying to write a code that swaps 1st element of an array with 2nd one, 3rd with 4th and keeps like that. It is not working and instead I wrote a code that is reversing the order. (better explanation on pictures attached.) I am using Java. public static void swapPairs(String[]array) {for(int i= 0; i< array.length / 2; i++) {int j= array.length - i -1;swap(array, i, j);}}public static void swap(String[] array, int i, int j) {String temp= array[i];array[i]= array[j];array[j]= temp;}
For this exercise, you need to shift all the elements in the array one space to the right (increase the index of the element by 1). The last element will wrap around and become the new first element. For example, given: moveUp({"first", "second", "third", "fourth"}); You would return: {"fourth", "first", "second", "third"} in java
javaprogram that uses an array with ten random integers to prints four lines of output, containing all even elements, every element at a even index, elements in reverse order, only first and last element thank you!!
Hello. I need assistance writing a method to merge two arrays and then print the new merged array. I have written the following: import java.util.ArrayList; public class HW1{ public static void main(String[] args){ArrayList<Integer> arr1 = new ArrayList<Integer>(); arr1.add(1);arr1.add(4);arr1.add(9);arr1.add(16);arr1.add(21);arr1.add(33);arr1.add(41);arr1.add(52);System.out.println("Array 1" + arr1);ArrayList<Integer> arr2 = new ArrayList<Integer>();arr2.add(4);arr2.add(7);arr2.add(9);arr2.add(9);arr2.add(20);arr2.add(25);arr2.add(27);System.out.println("Array 2" + arr2);} I need to write a method that merges the two arrays and sorts the new array from lowest number to highest. Then I need to print the new array. The output should be the following: 1 4 4 7 9 9 9 16 20 21 33 41 52 Thank you.
The split method in the String class returns an array of strings consisting of the substrings split by the delimiters. However, the delimiters are not returned. Implement the following new method that returns an array of strings consisting of the substrings split by the matching delimiters, including the matching delimiters. public static String[] split(String s, String regex) For example, split("ab#12#453", "#") returns ab, #, 12, #, and 453 in an array of String and split("a?b?gf#e", "[?#]") returns a, ?, b, ?, gf, #, and e in an array of String.
Add a new method to ArrayTools called copy. Make this method accept two String arrays. Copy the content from the first array into the second array. If the second array isn't big enough, show an error message. Write in Java and use test case 1 as result.
1)Write a method that takes an array of ints and returns the sum of all numbers that are even. For example, given an array {3, 4, 6}, you would return 10. 2)For this exercise, you are given an array of integers. Return true if every element in the array is an odd number, otherwise return false. 3) Given an array of strings, return the array in reverse order. For example, given: reverse({"one", "two", "three"}); You would return: {"three", "two", "one"} 4) For this exercise, you need to shift all the elements in the array one space to the right (increase the index of the element by 1). The last element will wrap around and become the new first element. For example, given: moveUp({"first", "second", "third", "fourth"}); You would return: {"fourth", "first", "second", "third"}
. Now take any name from the user, find whether that name is present in that array or not, and print the position of that name in the array if found. Write a search method to sequentially search the name from the array. Invoke the search method from the main method. The array and the name to be searched should be passed into the search method as parameters.Now write a Java program to implement binary search for the above problem.[Hint: You can use equals() and compareTo() methods of String class.]
Use Java programming. Write the removeEvens() method, which receives an array of integers as a parameter and returns a new array of integers containing only the odd numbers from the original array. The main program outputs values of the returned array. Hint: If the original array has even numbers, then the new array will be smaller in length than the original array and should have no blank elements. Ex: If the array passed to the removeEvens() method is [1, 2, 3, 4, 5, 6, 7, 8, 9], then the method returns and the program output is: [1, 3, 5, 7, 9] Ex: If the array passed to the removeEvens() method is [1, 9, 3], then the method returns and the program output is: [1, 9, 3] import java.util.Arrays; public class LabProgram { public static int[] removeEvens(int [] nums) { /* Type your code here */} public static void main(String[] args) { int [] input = {1,2,3,4,5,6,7,8,9};int [] result = removeEvens(input); // Helper method Arrays.toString() converts int[] to a…
(IN JAVA) Write a method which does the following: Ask the user to enter a size of array between 2 to 10. Based on the size entered, write a loop which asks the user to fill values into an integer array. Print the array contents using Arrays.toString(). For this integer array, write a logic that returns true if there exists a place to split the array such that the sum of the numbers on one side is equal to the sum of the numbers on the other. Otherwise return false. Examples: If the array is {1, 1, 1, 2, 1} then return true. If the array is {2, 1, 1, 2, 1} then return false If the array is {10, 10} then return true.
FOR JAVA Write a method that takes a two dimensional integer array, and returns the number of elements in it. Note that your method should also work with nonrectangular arrays such as {{1}, {2, 3}, {4, 5, 6}}.