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

Related questions

Q: Debugseven3 contain errors fix code with no errors or mistake import java.util.*; public class…

A: I'll break down the corrections made to the original Java code into concise steps:Step 1. Fix String…

Q: Covert Program in C++ import java.util.Scanner; public class Main { public static void…

A: Given java program input is area of circle and output is radius of the circle import…

Q: Which of the following are necessary parts of all recursive methods? A tail call. Tail-call…

A: Disclaimer: “Since you have asked multiple questions, we will answer the first question. If you want…

Q: import java.util.Arrays; import java.util.Random; public class Main { public void Start(){…

A: JAVA Program: import java.util.Arrays; import java.util.Random; public class Main { public…

Q: Write a program which does the following: 1. Create a class with the main() method. 2. Take a string…

A: note:- length() and indexOf() both returns indexes in numeric, you must have to use charAt() to…

Q: as storage of data. import java.util.Scanner; public class Main { public static void…

A: We need to add the code to sort the array on ascending and descending order and print the result

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: Public Class Utilities { replaceCharacter Method public static void replaceCharacter(char[] array,…

A: The below given Java program will obey the following rubrics: Declaring main class. Defining some…

Q: Type up the code, execute it and submit the output only. CODE: import java.util.Arrays;…

A: According to the information given;- We have to type the code, fix and execute.

Q: Create a java code to find the recursive sum of a array of numbers

A: A method that calls itself is known as a recursive method.

Q: The language used here is in Java. Please answer the question in the screenshot. Please use the code…

A: Coded in Java.

Q: Over the first few Long Weekly Homework assignments for this quarter, we have been building a…

Q: // Create a program that searches a two dimensional array and determines the number of elements //…

A: Here, we have to search in the entire 2d array But we are iterating over a single loop checking only…

Q: Lambda This lab will demonstrate the Java Lambda and how it works. Type up the code and submit the…

A: Logic Taking name as input from the user. Taking the capacity of the washing machine as input in…

Q: Please complete the task by yourself only in JAVA with explanation. Don't copy. Thank you. Using…

A: Java program: import java.util.Comparator; class Car { public String make; public String…

Q: def count_vowels(self, a_string): """ Given a string, count the number of vowels one character at a…

A: Please find the answer below:

Q: Write a method named minimumValue, which returns the smallest value in an array that is passed (in)…

A: Java Program code: public class Array…

Q: The following recursive method is causing an exception because the base case is missing. This…

A: Here method print() will print element of array in reverse order. In this code we are passing last…

Q: import java.util.Scanner; public class xyz { This program has the following methods: read 10…

A: import java.util.Scanner; public class xyz { // method to read the temperature from the user public…

Q: Complete the following program ArrayMax.java. The function max() should return a new array…

A: Here I have defined the method named max(). Inside the function, I have declared an array with the…

Q: In JavaScript use recursion to find the sum of all pages in the following: function…

A: The javascript code has been written for the given function and succesfully runs, please refer step2

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: You are given the daily temperature reading of P towns and the daily temperature reading of New York…

A: Code : #!/bin/python3 import mathimport osimport randomimport reimport sysimport numpy as npimport…

Question

Section 13.5 - cSC 1351: Compute
b Membership | bartleby
E zyBooks
Computer Science II for Majors home > 13.5: The Efficiency of Recursion
PARTICIPATION
13.5.3: Produce a non-recursive method for counting zeroes in an array.
АCTIVITY
Here 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/drop
Keyboard: Grab/release Spacebar (or Enter ). Move 1D00 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 = 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: " + start
int numZeros = zeroes (intArray, startingPos);
public static int zeroes (int [] a, int pos)
if (alnosl == a)
Check
Feedback?
PARTICIPATION
13.5.4: Comparing the performance of the recursive and iterative solutions.
АCTIVITY
MacBook Pro
く
@
%23
$
%
&
2
3
4
5
7
W
E
R
Y
U
* CO

PARTICIPATION
13.5.3: Produce a non-recursive method for counting zeroes in an array.
АCTIVITY
Here 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/drop
Keyboard: Grab/release Spacebar (or Enter). Move 0000 Cancel Esc
Unused
Arrays.java
Load 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: " + start
int numZeros = zeroes(intArray, startingPos);
System.out.println("Number of zeros found: " + nur
result++;
if (a[pos) == 0)
result++;
Check
Feedback?
PARTICIPATION
13.5.4: Comparing the performance of the recursive and iterative solutions.
ACTIVITY
MacBook Pro
#3
$
2
7
8
W
E
R
Y
P
< co

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

Introduction

VIEW

LOGIC for non-recursive

VIEW

Re-defined method with non-recursion

VIEW

Calling new method from given main class

VIEW

Output

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 5 steps with 3 images

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

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)…
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.
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 }
import java.util.Arrays; import java.util.Random; public class Board { /** * Construct a puzzle board by beginning with a solved board and then * making a number of random moves. That some of the possible moves * don't actually change what the board looks like. * * @param moves the number of moves to make when generating the board. */ public Board(int moves) { throw new RuntimeException("Not implemented"); } The board is 5 X 5. You can add classes and imports like rand.
Create a java code to find the average and standard deviation of a number in a array
public class Main { public static void main(String[] args) { System.out.println("Your factorial is: " + factorial(9)); }} public static int factorial(int number) { if (number == 0) { return 1; } return number * factorial(number -1); } i need help fixing this code involving recursion
StringFun.java import java.util.Scanner; // Needed for the Scanner class 2 3 /** Add a class comment and @tags 4 5 */ 6 7 public class StringFun { /** * @param args not used 8 9 10 11 12 public static void main(String[] args) { Scanner in = new Scanner(System.in); System.out.print("Please enter your first name: "); 13 14 15 16 17 18 System.out.print("Please enter your last name: "); 19 20 21 //Output the welcome message with name 22 23 24 //Output the length of the name 25 26 27 //Output the username 28 29 30 //Output the initials 31 32 33 //Find and output the first name with switched characters 34 //All Done! } } 35 36 37
import java.util.Scanner; public class LabProgram { /* Define your method here */ public static void main(String[] args) { Scanner scnr = new Scanner(System.in); /* Type your code here. */ }}