Question

(Done in Eclipse Java)

1. Given an integer between 1—100 captured from a user, perform the following conditional actions: • If is odd, print Weird • If is even and in the inclusive range of 2 to 5, print Not Weird • If is even and in the inclusive range of 6 to 20, print Weird • If is even and greater than 20, print Not Weird Note: Validate that your algorithm works for all cases.

2. Read an integer from stdin and save it to a variable size which denotes some number of integers. • Use the variable size to initialize an array of length size • Next, read in integers from stdin and save each incoming integer to the next available position in your array ◦ Continue until your array is full. Note: you will need to conditionally check to see if you have received the number of inputs you need from the user in order to fill the array • Finally, Print the contents of the full array

3. A prime number is a number which is divisible by only two numbers: 1 and itself. So, if any number is divisible by any other number, it is not a prime number.
Write a method which takes one integer as a parameter and identifies if the number is prime or not. Print if the number is prime or not. • Expected result: ◦ 13 is prime, while ◦ 8 is not prime • Run with both prime numbers and numbers which are not prime to verify
1

4. Create a method which takes an integer array as a parameter and reverses the elements in the array. Print the reversed array. • Expected result for int[] testArr = [5, 33, 0, 8, 2] is that it would become the array [2, 8, 0, 33, 5] after the call to your reversal method.

5. Create a method which prints the distance between the two closest numbers in a given array. • Expected result for int[] testArr = [3, 9, 50, 15, 99, 7, 98, 65] is 1, as the two closest numbers in testArr are 98 and 99

6. Given an array of numbers such as int[] testArr = [3, 9, 50, 15, 99, 7, 98, 65], use a loop to sort it from largest to smallest. Print the sorted array. • Expected result for the above array would be [99, 98, 65, 50, 15, 9, 7, 3]

Answer 1

//code for case 1----------------------------------------------------------------------
import java.util.*;
public class CheckEvenOdd {
static Scanner s=new Scanner(System.in);
   public static void main(String[] args) {
       System.out.println("enter number between 1 to 100:");
       int n=s.nextInt();
       if(n%2==0){
           if( n>=2 && n<=5){System.out.println("Not Weird"); }
           else if( n>=6 && n<=20){System.out.println("Weird"); }
           else{System.out.println("Not Weird");}
       }
       else{
           System.out.println(" Weird");
       }

   }

}

//code for case 2------------------------------------------------------------------------------------------------------------------

import java.util.*;
public class CheckEvenOdd {
static Scanner s=new Scanner(System.in);
   public static void main(String[] args) {
       System.out.println("enter length of array:");
       int n=s.nextInt();
       int[] arr=new int[n];
       System.out.println("enter element in the array:");
       for(int i =0;i<arr.length;i++){
           arr[i]=s.nextInt();
       }
       System.out.println("entered Array:");
       for(int j:arr){
           System.out.print(j+" ");
       }

   }

}

//code for case 3( method that identifies a number is prime or not) ----------------------------------------------------------

   void CheckPrime(int n){
       int i;
       int flag=0;
       for(i=2;i<n;i++){
           if(n%i==0){
               flag=1;
           }
          
       }
       if(flag==0){
           System.out.println(n+" is prime number.");  
       }
       else{
           System.out.println(n+" is not prime number.");   }
   }

//code for case 4(method that reversed the element of given array)----------------------------------------------

void reversal(int[] arr){
       int[] rev=new int[arr.length];
       int j=0;
       for(int i=arr.length-1;i>-1;i--){
           rev[j]=arr[i];
           j++;
       }
       System.out.println("reversed array:");
       for(int k:rev)
       System.out.print(k+" ");
   }

//code for case 5(minimum distance between 2 elements of array )-------------------------

static int findMinDiff(int[] arr, int n)
   {
   // Initialize difference as infinite
   int diff = Integer.MAX_VALUE;
  
   // Find the min diff by comparing difference
   // of all possible pairs in given array
   for (int i=0; i<n-1; i++)
   for (int j=i+1; j<n; j++)
   if (Math.abs((arr[i] - arr[j]) )< diff)
   diff = Math.abs((arr[i] - arr[j]));
  
   // Return min diff   
   return diff;
  
   }

//code for case 6(sorted array)-------------------------

import java.util.*;
class prime{
   void sorted(int[] arr){
       int i,j,t;
       for(i=0;i<arr.length;i++){
           for(j=i+1;j<arr.length;j++){
               if(arr[i]<arr[j]){
                   t=arr[i];
                   arr[i]=arr[j];
                   arr[j]=t;
               }
           }
       }  
       System.out.println("sorted array:");
       for(int k:arr){
           System.out.print(k+" ");
       }
   }
}
public class CheckEvenOdd {
static Scanner s=new Scanner(System.in);
   public static void main(String[] args) {
       System.out.println("enter number:");
       int n=s.nextInt();
       int[] arr=new int[n];
       for(int i=0;i<arr.length;i++)
           arr[i]=s.nextInt();
      
       prime p=new prime();
       p.sorted(arr);

   }

}