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

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 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…
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.
Write a Java program to do the following task :Create an integer array of size 15. Input the values from user . Input an integer key . Pass the array and key to a method that searches the key in the array . If the key is found , print the index . Otherwise print that “ key is not .found " in the method
Create a java code to find the average and standard deviation of a number in a array
Follow instructions please
in java
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
JAVA Language: Transpose Rotate. Question: Modify Transpose.encode() so that it uses a rotation instead of a reversal. That is, a word like “hello” should be encoded as “ohell” with a rotation of one character. (Hint: use a loop to append the letters into a new string) import java.util.*; public class TestTranspose { public static void main(String[] args) { String plain = "this is the secret message"; // Here's the message Transpose transpose = new Transpose(); String secret = transpose.encrypt(plain); System.out.println("\n ********* Transpose Cipher Encryption *********"); System.out.println("PlainText: " + plain); // Display the results System.out.println("Encrypted: " + secret); System.out.println("Decrypted: " + transpose.decrypt(secret));// Decrypt } } abstract class Cipher { public String encrypt(String s) { StringBuffer result = new…
After completing the methods, use the main method to test them.
Please add comments to my program. Thank you in advance! :)package examples;import java.util.Scanner;public class ascendingOrder{public static void main(String[] args){int count, temp;//User inputs the array sizeScanner scan = new Scanner(System.in);System.out.print("\nEnter number of elements you want in the array: ");count = scan.nextInt();int num[] = new int[count];System.out.println("\nEnter array elements:");for (int i = 0; i < count; i++){num[i] = scan.nextInt();}scan.close();for (int i = 0; i < count; i++){for (int j = i + 1; j < count; j++) {if (num[i] > num[j]){temp = num[i];num[i] = num[j];num[j] = temp;}}}System.out.print("Array Elements in Ascending Order: ");for (int i = 0; i < count - 1; i++){System.out.print(num[i] + ", ");}System.out.print(num[count - 1]);System.out.print("\n");}}
PYTHON: This exercise is a variation on "instrumenting" the recursive Fibonacci program to better understand its behavior. Write a supporting method that counts how many times the fib function is called to compute fib (n) where n is a user input. Hint: To solve this problem, you need an accumulator variable whose value "persists" between calls to fib. You can do this by making the count an instance variable of an object. Create a FibCounter class with the following methods: _init_(self) Creates a new FibCounter, setting its count instance variable to 0. getCount(self) Returns the value of count. fib(self, n) Recursive function to compute the nth Fibonacci number. It increments the count each time it is called. resetCount(self) Sets the count back to 0.