Section 13.5 - cSC 1351: Computeb Membership | bartlebyE zyBooksComputer Science II for Majors home > 13.5: The Efficiency of RecursionPARTICIPATION13.5.3: Produce a non-recursive method for counting zeroes in an array.АCTIVITYHere is a recursive method for counting all zeroes in an array starting with a given position:public static int zeroes (int[] a, int pos){if (pos == a.length) { return 0; }int result = zeroes(a, pos + 1);if (alpos] == 0) { return result + 1; }else { return result; }Rearrange the following lines of code to produce a non-recursive version of this method. Not all lines are useful.Mouse: Drag/dropKeyboard: Grab/release Spacebar (or Enter ). Move 1D00 Cancel EscUnusedArrays.javaLoad default template..elseimport java.util.Scanner;return result;public class Arraysreturn result;public static void main (String [] args)Scanner in = new Scanner (System.in);int arraysige = in.nextInt();int [] intAray new int [arraySizel;System.out.print ("Array contents: ");for (int i = 0; i < araySize; i++)for (int i = pos; i < a.length; i++)intArray (i] = in.nextInt();System.out.print(intArray(i] +" ");int result = 0;int result = zeroes (a, pos + 1);int startingPos = in.nextInt();System.out.printin("\nStarting position: " + startint numZeros = zeroes (intArray, startingPos);public static int zeroes (int [] a, int pos)if (alnosl == a)CheckFeedback?PARTICIPATION13.5.4: Comparing the performance of the recursive and iterative solutions.АCTIVITYMacBook Proく@%23$%&23457WERYU* CO PARTICIPATION13.5.3: Produce a non-recursive method for counting zeroes in an array.АCTIVITYHere is a recursive method for counting all zeroes in an array starting with a given position:public static int zeroes (int[] a, int pos){if (pos == a.length) { return 0; }int result = zeroes(a, pos + 1);if (a[pos] == 0) { return result + 1; }else { return result; }Rearrange the following lines of code to produce a non-recursive version of this method. Not all lines are useful.Mouse: Drag/dropKeyboard: Grab/release Spacebar (or Enter). Move 0000 Cancel EscUnusedArrays.javaLoad default template..int result = 0;public static void main (String [] args)int result = zeroes (a, pos + 1);Scanner in = new Scanner(System.in);int arraySize = in.nextInt():int [) intArray = new int [arraySizel;System.out.print("Array contents: ");for (int i = 0; i < arraySize; i++)public static int zeroes (int[] a, int pos)if (alpos) == 0)return result + 1;}intarray (i] = in.nextInt();Syste. out.print (intArray [i] + " ");if (ali] == 0)int startingPos = in.nextInt();System.out.println("\nStarting position: " + startint numZeros = zeroes(intArray, startingPos);System.out.println("Number of zeros found: " + nurresult++;if (a[pos) == 0)result++;CheckFeedback?PARTICIPATION13.5.4: Comparing the performance of the recursive and iterative solutions.ACTIVITYMacBook Pro#3$278WERYP< co

The given problem is related to Java where the given recursive function is to be converted to a…

Rearrange the following lines of code to produce a non-recursive version of this method. Not all lines are useful. Mouse: Drag/drop Keyboard: Grab/release Spacebar (or Enter). Move DO00 Cancel Esc Unused Arrays.java Load default template... else import java.util. Scanner; return result; public class Arrays return result; public static void main (String [] args) Scanner in = new Scanner (System.in); int arraySige int [] intAray = new int [arraySizel; System.out.print ("Array contents: "); for (in+ for (int i = pos; < a. length; i++) = in.nextInt(); c arravSize: i+)

Rearrange the following lines of code to produce a non-recursive version of this method. Not all lines are useful. Mouse: Drag/drop Keyboard: Grab/release Spacebar (or Enter). Move DO00 Cancel Esc Unused Arrays.java Load default template... else import java.util. Scanner; return result; public class Arrays return result; public static void main (String [] args) Scanner in = new Scanner (System.in); int arraySige int [] intAray = new int [arraySizel; System.out.print ("Array contents: "); for (in+ for (int i = pos; < a. length; i++) = in.nextInt(); c arravSize: i+)

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

Similar questions

Create an executable class that uses the following methods. The following methods illustrate the concept of recursion. Please complete this part of the program
Write a Java program to implement the following: Ask the user to enter the names of 3 Books and store them in an ArrayList called Book Remove the second book from the list Add the user to enter a new book name and store to be the first book of the list Ask the user to enter a book name, search for it in list, and print “exist” or “not exist” Print the book name at index 2 Print all list items using loop Print the size of the list
Complete the following program Multiply.java. This program uses recursion to multiply two numbers through repeated addition. The output should look exactly like what is pictured below. The code should be completed where it states "complete here"
Fill in the gap with Java language Complete the following program as runnable. public class Final { public static void main(String[] args) { // Declare and create an array int[] myArray = createArray(); // a) Invoke the method that displays the array System.out.println("My integers are:"); // b) Invoke the method that displays the even integer numbers above the average } // c) Please write createArray() method public static ____________________________ { // Declare an array of integers and create it. (The array size is 100) // Create integers randomly (1-100) and assign // them to the array // Return the array } // d) Please write a method that displays the array of integers public static ______________________________{ } // e) Please write a method that returns the average of the integers public static _________ averageOfIntegers(__________________){ return _____________ ; } /* f)…
Problem: Kindly please add comments to my program thank you very much!package examples;import java.text.ParseException;import java.text.SimpleDateFormat;import java.util.*;public class dateSortListr {public static void main(String[] args) throws ParseException{Scanner s=new Scanner (System.in);Date date[];String str[];System.out.print("Enter number of dates: ");// Integer inputint i,n = s.nextInt();str= new String[n];date = new Date[n];s.nextLine();System.out.println("\nEnter dates using dd-MM-yy format");for(i=0;i<n;i++){str[i]=s.next();}SimpleDateFormat sdf = new SimpleDateFormat("dd-MM-yyyy");for (i=0;i<n;i++){date[i]=sdf.parse(str[i]);}Arrays.sort(date);System.out.println("\nSorted Dates:");for (Date date1: date){System.out.println(sdf.format(date1));}}}
Need some help with this java problem
Write a recursive method called reverseString() that takes in a string as a parameter and returns the string in reversed order. The main method is provided to read a string from the user and call the reverseString() method. Ex: If the input of the program is: Hello the reverseString() method returns and the program outputs: Reverse of "Hello" is "olleH". Ex: If the input of the program is: Hello world! the reverseString() method returns and the program outputs: Reverse of "Hello, world!" is "!dlrow, olleH". Hint: Move the first character to the end of the returning string and pass the remaining sub-string to the next reverseString() method call.
Create a read function and a print function with this code while creating a new object (data structure in java)
import java.util.Scanner; public class TriangleArea { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); Triangle triangle1 = new Triangle(); Triangle triangle2 = new Triangle(); // TODO: Read and set base and height for triangle1 (use setBase() and setHeight()) // TODO: Read and set base and height for triangle2 (use setBase() and setHeight()) System.out.println("Triangle with smaller area:"); // TODO: Determine smaller triangle (use getArea()) // and output smaller triangle's info (use printInfo()) }} public class Triangle { private double base; private double height; public void setBase(double userBase){ base = userBase; } public void setHeight(double userHeight) { height = userHeight; } public double getArea() { double area = 0.5 * base * height; return area; } public void printInfo() { System.out.printf("Base:…
Given a long string use recursion to traverse the string and replace every vowel (A,E,I,O,U) with an @ sign. You cannot change the method header. public String encodeVowels(String s){ // Your code here }
Downvote for incorrect answer please do asap.
create a recursive decent parse that read ( 1 + 2 ) / 3 from a txt file import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;import java.util.StringTokenizer; public class Lexical {public static void main(String args[]) throws FileNotFoundException{//reading file (Create one and put the expression (2+5/t) or (1-9)*0)Scanner input = new Scanner(new File("Expression.txt"));while(input.hasNextLine()) {//reading next lineString line = input.nextLine();//reading tokens by spaceStringTokenizer strings = new StringTokenizer(line," ");//reading more stringswhile (strings.hasMoreElements()) {//converting object to stringString token = strings.nextElement().toString();switch(token) //switch case{case "(" :System.out.println("Next token is: 25 Next lexeme is (");break;case ")" :System.out.println("Next token is: 26 Next lexeme is )");break;case "=" :System.out.println("Next token is: 20 Next lexeme is =");break;case "+" :System.out.println("Next token is: 21 Next…