Question

Arizona State University - CSE205

Assignment #9

Due Date Friday, March April 3rd, 5:30pm

Important: This is an individual assignment. Please do not collaborate.

No late assignment will be accepted.

Make sure that you write every line of your code. Using code written by someone else will be considered a violation of the academic integrity and will result in a report to the Dean's office.

It must be submitted on-line (Course website).

Go to "GradeScope" tab on Canvas -> CSE205 -> Assignment9, and upload your program file.

Minimal Submitted Files

You are required, but not limited, to turn in the following source file:

Assignment9.java file (you need to create this file from scratch)

Requirements to get full credits in Documentation

1.       The assignment number, your name, StudentID, Lecture day/time, and a class description need to be included at the top of each file/class.

2.      A description of each method is also needed.

3.       Some additional comments inside of methods (especially for a "main" method) to explain code that are hard to follow should be written.

You are not allowed to use the Scanner class in this assignment and any assignment after this one. You will need to use InputStreamReader and BufferedReader (they are in java.io package) to process input and also take care of IOException.

Click on the following link to view sample code of using InputStreamReader and BuferedReader classes.

InputStreamReaderDemo.java

New Skills to be Applied

In addition to what has been covered in previous assignments, the use of the following items, discussed in class, will probably be needed:

Recursion
One-dimensional arrays

Program Description

Assignment #9 will be the construction of a program that reads in a sequence of integers from standard input until 0 is read, and store them in an array (including 0). This is done using iteration (choose one of for, while, or do while loop). You may assume that there will not be more than 100 numbers.

Then compute the minimum number, count odd integers, compute the sum of numbers that are larger than the first number in the array, and compute the largest even integer in the sequence using recursion. Thus, you will create recursive methods findMin, countOddNumbers, computeLargestEven, and sumOfNumbersLargerThanFirst in Assignment9 class and they will be called by a main method.

Specifically, the following recursive methods must be implemented (These methods should not contain any loop):

    public static int findMin(int[] numbers, int startIndex, int endIndex)

    public static int countOddNumbers(int[] elements, int startIndex, int endIndex)

    public static int computeLargestEven(int[] elements, int startIndex, int endIndex)

    public static int sumOfNumbersLargerThanFirst(int[] elements, int startIndex, int endIndex, int firstNumber)

If these methods are implemented using a Loop or any Static Variable, points will be deducted (from the test cases) even if your program passes test cases. DO NOT use any Static Variables.

The program should output the results of those calculations to standard output. Your program will continue to read in numbers until the number 0 is entered. At this point, the calculations will be outputted in the following format:

The minimum number is 0

The count of odd integers in the sequence is 0

The largest even integer in the sequence is 0

The sum of numbers larger than the first is 0

Note that the result values will be different depending on test cases (not always 0).

Do not output a prompt to query for the numbers. The number 0 is included in the sequence of numbers and should be included in all of your calculations.

Answer 1

Code

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Assignment9
{
public static void main(String[] args) throws IOException
{
//Enter data using BufferReader
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
int arr[]=new int[100];
int i=0,num;
while(true)
{
System.out.print("Enter an integer or 0 to stop: ");
num=Integer.parseInt(reader.readLine());
if(num==0)
break;
arr[i]=num;
i++;
}
  
System.out.println("\nThe minimum number is "+findMin(arr, 0, i--));
System.out.println("The count of odd integers in the sequence is "+countOddNumbers(arr, 0, i--));
System.out.println("The largest even integer in the sequence is "+computeLargestEven(arr,0,i--));
System.out.println("The sum of numbers larger than the first is "+sumOfNumbersLargerThanFirst(arr,0,i--,arr[0]));
}
  
public static int findMin(int[] numbers, int startIndex, int endIndex)
{
if(startIndex == endIndex) return numbers[0];
int min = findMin(numbers, startIndex+1, endIndex);
return (numbers[startIndex] <= min) ? numbers[startIndex] : min;
}
public static int countOddNumbers(int[] elements, int startIndex, int endIndex)
{
if (startIndex==endIndex)
{
if(elements[startIndex]%2!=0) {
return 1;
} else {
return 0;
}
}
else {
if(elements[startIndex]%2!=0) {
return countOddNumbers(elements,startIndex+1, endIndex)+1;
}
else{
return countOddNumbers(elements,startIndex+1, endIndex);
}
}
}
public static int computeLargestEven(int[] elements, int startIndex, int endIndex)
{
if(startIndex == endIndex) return elements[0];
int min = computeLargestEven(elements, startIndex+1, endIndex);
  
if(elements[startIndex]%2==0)
{
return (elements[startIndex] >= min) ? elements[startIndex] : min;
}
return computeLargestEven(elements, startIndex+1, endIndex);
}
public static int sumOfNumbersLargerThanFirst(int[] elements, int startIndex, int endIndex, int firstNumber)
{   
if (endIndex == startIndex)
{
if (elements[startIndex] > firstNumber)
{
int sum = elements[startIndex];
return sum;
}
else
{
int sum = 0;
return sum;
}
   }
else
{
int sum = sumOfNumbersLargerThanFirst(elements, startIndex+1, endIndex,firstNumber);      
if (elements[startIndex] >firstNumber)
{
return sum += elements[startIndex];
}
else
{
return sum;
}
}
}

}

output

0 Recursive Array methods - NetBeans IDE 8.0.1 File Edit View Navigate Source Refactor Run Debug Profile Team Tools Window Help 0 <default config> v . D B - Q- Search (Ctrl+1) 0 - Files Assignment9.java x Navigator Projects x Services Output W Debugger Console x Recursive Array methods (run) x e Enter an integer or o to stop: 25 Enter an integer or o to stop: 45 Ent er an int eger or o to stop: 80 r an integer or o to stop: 31 Enter an integer or o to stop: 29 er an integer or o to stop: 35 Enter an integer or o to stop: 10 Enter an integer or o to stop: 0 The minimum number is 10 The count of odd integers in the sequence is 5 The largest even integer in the sequence is 80 The sum of numbers larger than the first is 185 BUILD SUCCESSFUL (total time: 20 seconds) 62:71 INS

If you have any query regarding the code please ask me in the comment i am here for help you. Please do not direct thumbs down just ask if you have any query. And if you like my work then please appreciates with up vote. Thank You.