4) The following method wants to take an array of Strings and reverse the contents of each String and store it in a new array. The method will return the resulting array. public static String[] reverse (String[] words) { } String[] reverseWords = new String [words.length]; for (int i = 0; i < words.length; i++) { String temp = ""; /* missing code */ reverseWords [i] = temp; For example, if words contains: {"fire", "arose", "closing", "account", "teacher", "java", "skirt"} the method would return the array {"erif", "esora", "gnisolc", "tnuocca", "rehcaet", "avaj", "triks"}. } } Which of the following code segments should replace /* missing code */ so that the method works as intended? return reverseWords; (A) for (int j = 0; j < words.length; j++) { temp += words[i].substring(j, j+1); } (B) for (int j = words [i].length(); j > 0; j--) { temp += words[i].substring (j, j+1); } (C) for (int j = 0; j < words [i].length; j++) { temp += words [i].substring (j, j+1); } (D) for (int j = words [i].length() - 1; j >= 0; j--) { temp += words [i].substring(j, j+1); } (E) for (int j = words.length() - 1; j >= 0; j--) { temp += words.substring(j, j+¹);

4) The following method wants to take an array of Strings and reverse the contents of each String and store it in a new array. The method will return the resulting array. public static String[] reverse (String[] words) { } String[] reverseWords = new String [words.length]; for (int i = 0; i < words.length; i++) { String temp = ""; /* missing code / reverseWords [i] = temp; For example, if words contains: {"fire", "arose", "closing", "account", "teacher", "java", "skirt"} the method would return the array {"erif", "esora", "gnisolc", "tnuocca", "rehcaet", "avaj", "triks"}. } } Which of the following code segments should replace / missing code */ so that the method works as intended? return reverseWords; (A) for (int j = 0; j < words.length; j++) { temp += words[i].substring(j, j+1); } (B) for (int j = words [i].length(); j > 0; j--) { temp += words[i].substring (j, j+1); } (C) for (int j = 0; j < words [i].length; j++) { temp += words [i].substring (j, j+1); } (D) for (int j = words [i].length() - 1; j >= 0; j--) { temp += words [i].substring(j, j+1); } (E) for (int j = words.length() - 1; j >= 0; j--) { temp += words.substring(j, j+¹);

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: java Given an array of strings, return the array in reverse order. For example, given:…

A: Program: Programs can be used to perform various tasks according to the requirement. To perform…

Q: Programming Challenge 1: Create a Java program that collects numeric data from a user (10 values…

A: “Since you have asked multiple question, we will solve the first question for you. If you want any…

Q: Write a method that gets an element from an array randomly. The method signature is as follows:…

A: Program Approach: Include necessary libraries like random and array package . Define main class .…

Q: public boolean inSort ( double element ) ; /* A form of ins operations, but here we do not insert…

A: According to the information given:- We have to follow the instruction and write boolean sort…

Q: Edit this code to be Allow to input a double number The code is //AssignmentMarks.java import…

A: Given that Edit this code to be Allow to input a double number The code is //AssignmentMarks.java…

Q: JAVA PROGRAMMING Please Help! Look over my code and explain to me what I'm doing wrong. Thank You!…

A: Here, I have to write a java code for the above question. The highlighted one is the modified code.

Q: Find the index of the first negative number

A: I have provided JAVA CODE along with CODE SCREENSHOT and OUTPUT…

Q: Please follow the comments and please do exactly according to the comments. import…

A: Actually, java is a object oriented programming language. It is a platform independent.

Q: Write a test program that prompts the user to enter two 3 * 3 arrays of integers and displays…

A: I have provided java code with output in step 2.

Q: Complete the following method in java that takes an array and a key(int value) that traverses the…

A: //we have to find count of all pairs whose sum is passed value //to find count of all such pairs, we…

Q: public class ReplaceEvenWithZero { public static void main(String[] args) { int[]a =…

A: The program replaces each even number to zero. The array is initialized, which includes both even…

Q: void countSort(int arr[], int n, int exp) { intoutput[n]; inti, count[10] = { 0 }; for (i=0; i=0;…

A: converting the given C code for Counting Sort into MIPS assembly language. Counting Sort is a…

Q: java The search method accepts ArrayList of Strings and String find. The method returns a String.…

A: The java code for this problem is given below. Open any java code editor and run the program. Input:…

Q: JAVA Write a method that computes how often each letter A-Z or a-z occurs in a string. Don't…

A: logic:- Read string from user and store in variable . store the length of string using length()…

Q: ArrayList programming: switchPairs Write a method switchPairs that switches the order of values in…

A: The following are steps need to be taken for the given program: For the function switchPairs(), we…

Q: Code: public class RURottenTomatoes { public static void main (String[] args) { int r =…

A: Actually your code ia not wrong but some places their are some implementations problems I have fixed…

Q: * Returns a new string with s2 inserted in the middle of string sl * for example, insertInMiddle…

A: 1. Create a function insertInMiddle which takes two strings as argument2. Find the middle index of…

Q: Fill an array of strings with the twenty-six strings "a" ... "z".

A: Step 1: Declare a string alpha that contains the alphabets from 'a' to 'z' as a string. Step 2:…

Q: Q1. Produce a method that reads in a set of values (double) from the user and returns them. Use this…

A: Given code is Java code it returns the student grades. By using the public static double[]…

Q: Write a value-returning method that returns the product of all the elements in an integer array

A: class Person: listnew=[1,2,3,4] def __init__(self): continue def myfunc(self):…

Q: // Use the above method, findExactString, as a helper method to implement addWithoutDuplication…

A: /******************************************************************************…

Q: Write the method print that receives a String array as a parameter and prints one string per line.…

A: In the print() method – Take a variable to iterate the loop. Use a println() pre-defined method…

Q: How do I fix the code? public class PromptBank { public static void main(String[] args) {…

A: The solution to the given problem is below.

Question

4) The following method wants to take an array of Strings and reverse the contents of each String
and store it in a new array. The method will return the resulting array.
public static String[] reverse (String[] words)
{
}
For example, if words contains: {"fire", "arose", "closing", "account", "teacher",
"java", "skirt"} the method would return the array {"erif", "esora", "gnisolc",
"tnuocca", "rehcaet", "avaj", "triks").
}
Which of the following code segments should replace /* missing code */ so that the method works as
intended?
String[] reverseWords = new String [words.length];
for (int i = 0; i < words.length; i++)
{
String temp = "";
/* missing code */
reverseWords [i] = temp;
(A)
for (int j = 0; j < words.length; j++) {
temp += words [i].substring (j, j+1);
}
}
return reverseWords;
(B)
for (int j = words [i].length(); j> 0; j--) {
temp += words [i].substring (j, j+1);
}
(C)
for (int j = 0; j < words [i].length; j++) {
temp += words [i].substring (j, j+1);
}
(D)
for (int j = words [i].length() - 1; j >= 0; j--) {
temp += words [i].substring (j, j+1);
}
(E)
for (int j = words.length() - 1; j >= 0; j--) {
temp += words.substring(j, j+1¹);

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Project Description: In this project you implement an ArrayStack ADT and use the stack for implementing the following methods: a) Reverse an array of Words: Accept an array of words as input parameter and return an array of words in reverse order. Use the method signature: public static String[] reverse Words (String[] wordList) Example Input: Bird Cat Dog Elephant Output: Elephant Dog Cat Bird
Fill in the blank to complete the following method that takes an array of integers and returns the average as a double: public static double getAverage (int[] array) { double avg = 0; for (- avg + array[1]; avg /- array.length; return avg;
In C++ whats the answer from below ? int size = 10; for ( int i = -1; i < size ; i++) { arr[size - i] = i; } This array: has 12 positions is out of bounds has 10 positions has 11 positions
Complete the below function (using recursion)
The following code prints out all permutations of the string generate. Insert the missing statement. public class PermutationGeneratorTester { public static void main(String[] args) { PermutationGenerator generator = new PermutationGenerator("generate"); ArrayList<String> permutations = generator.getPermutations(); for (String s : permutations) { ____________________ } } }
In java, the Arrays class contains a static binarySearch() method that returns …… if element is found. false true (-k–1) where k is the position before which the element should be inserted The index of the element
Below is a bubble sort program that sorts the elements in an array. static void bubbleSort(int] arr) { arr.length; int temp = 0; for (int i = 0; i arrlil) { int n = temp arrlj- 1 arrlj - 1] = arrlil: arrli] = temp; Based on the program above, please draw a control flow graph for it. In your control flow graph, what are the test requirements for edge coverage List test path(s) that achieves the edge coverage. Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason. In your control flow graph, what are the test requirements for edge-pair coverage? List test paths that achieve the edge-pair coverage Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason.
/*In this program you need to implement four methods with the following signatures:printArr(int[] a)add(int[] a, int[] b)subtract(int[] a, int[] b)negate(int[] a) 1. Method printArr(a) should print out all elements of a given int array in one line. 2. Method add(a, b) should take two int arrays (assume they have the same length) and return a new array each element of which will be the sum of the corresponding elements in a and b 3. Method subtract(a, b) is similar to add(), except it returns (a - b) array 4. Method negate(a)takes an int array and returns a new array in which every element is multiplied by -1. */ public class ArrayOperations{ public static void main(String[] args){ //The main only has the testing code. //You don't have to change it. int [] a = { 1, 2, 3, 4, 5}; int [] b = {10, 1, 3, 5, 7}; System.out.print("a = "); printArr(a);//Should print each element of a (in one line) System.out.print("b = ");…
Refer to the following method that finds the smallest value in an array. /** Precondition: arr is initialized with int values. * Oparam arr the array to be processed Greturn the smallest value in arr public static int findMin(int[] arr) { int min = /* some value */; int index = 0; while (index < arr.length) { if (arr [index] < min) min = arr [index]; index++; } return min; } Which replacement(s) for /* some value */ will always result in correct execu- tion of the findMin method? I Integer.MIN_VALUE II Integer.MAX_VALUE III arr [0] (A) I only (B) II only (C) III only (D) I and III only (E) II and III only
Write the following method that returns the sum of all numbersin an ArrayList:public static double sum(ArrayList<Double> list)Write a test program that prompts the user to enter five numbers, stores them inan array list, and displays their sum.
class Output{public static void main(String args[]){byte a[] = { 65, 66, 67, 68, 69, 70 };byte b[] = { 71, 72, 73, 74, 75, 76 };System.arraycopy(a , 0, b, 0, a.length);System.out.print(new String(a) + " " + new String(b));}} The output of the above Java code is ?
1. Write a program that calls a method that takes a character array as a parameter (you can initialize an array in the main method) and returns the number of vowels in the array. Partial program is given below. public class CountVowels{ public static void main(String[] args){ char[] arr= System.out.print("There are "+vowels(arr)+" vowels in the array");