Week 8 : Programming Assignment 1

Due on 2023-10-19, 23:59 IST

Create a class called Animal with protected fields and a parameterized constructor to initialize the protected fields.

Fields:

name (String)
sound (String)

and Method:

public void makeSound() - This method should display the name of the animal and the sound it makes.

Create a class called Dog that extends the Animal class.
The Dog class should have a constructor that accepts the name of the dog and sets the sound to "Woof".

Create a class called Cat that extends the Animal class.
The Cat class should have a constructor that accepts the name of the cat and sets the sound to "Meow".

Follow the naming convention as given in the main method of the suffix code.

Your last recorded submission was on 2024-03-09, 22:57 IST

Select the Language for this assignment.

File name for this program :

import java.util.Scanner;

// TODO: Create a class "Animal" that have a  parameterized constructor to initialize the protected fields and method of makeSound().
// Create a class called Dog that extends the Animal class.
// Create a class called Cat that extends the Animal class.
class Animal {
  protected String name;
  protected String sound;
  
  public Animal(String name, String sound) {
     this.name = name;
     this.sound = sound;
  }
  public void makeSound() {
     System.out.println(this.name + " says: " + this.sound);
  }
}
class Dog extends Animal {
    public Dog(String name) {
      super(name, "Woof");
    }
}
class Cat extends Animal {
    public Cat(String name) {
      super(name, "Meow");
    }
}

class W08_P1{
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
 
        String dogName = scanner.nextLine();
        String catName = scanner.nextLine();
 
        Dog dog = new Dog(dogName);
        Cat cat = new Cat(catName);
 
        dog.makeSound(); 
        cat.makeSound();  
 
        scanner.close();
    }
}

You may submit any number of times before the due date. The final submission will be considered for grading.

This assignment has Public Test cases. Please click on "Compile & Run" button to see the status of Public test cases. Assignment will be evaluated only after submitting using Submit button below. If you only save as or compile and run the Program , your assignment will not be graded and you will not see your score after the deadline.

Compilation : Passed
Public Test Cases: 1 / 1 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	Jacky Tom	Jacky says: Woof\n Tom says: Meow	Jacky says: Woof\n Tom says: Meow\n	Passed after ignoring Presentation Error

Week 8 : Programming Assignment 2

Program to Generate Harmonic Series.
Follow the naming convention as given in the main method of the suffix code.

Your last recorded submission was on 2024-03-09, 23:22 IST

Select the Language for this assignment.

File name for this program :

import java.util.Scanner;
class W08_P2
{
public static void main(String... a)
    {        
        Scanner s = new Scanner(System.in);
        int num = s.nextInt();

//TODO code to generate harmonic series using while loops.
        double result = 0.0;
        while(num > 0)
          {
               result = result + (double) 1 / num;
               num--;
          }
        System.out.println("Output of Harmonic Series is "+result);

}
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 1 / 1 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	6	Output of Harmonic Series is 2.45	Output of Harmonic Series is 2.45\n	Passed after ignoring Presentation Error

Week 8 : Programming Assignment 3

Write a code to find the Trace of the 2D matrix.

Your last recorded submission was on 2024-03-10, 07:50 IST

Select the Language for this assignment.

File name for this program :

import java.util.*;
 
public class W08_P3{
    public static void main(String args[]) {
        int array[][] = new int[5][5];
        int i, j;
        double sum = 0, square = 0, result = 0;
        Scanner s = new Scanner(System.in);
 
        // reads number of rows from the user
        int row = s.nextInt();
 
        // reads number of columns from the user
        int column = s.nextInt();
        for (i = 0; i < row; i++) {
            // loop for columns
            for (j = 0; j < column; j++) {
                // reads the matrix elements
                array[i][j] = s.nextInt();
                // prints space
               // System.out.print(" ");
            }
        }

// Input 2D matrix using Scanner Class 
//Calculate the trace of the matrix
for (i = 0; i < row; i++) {
            // loop for columns
            for (j = 0; j < column; j++) {
                if( i == j )
                    sum+= array[i][j];
                // prints space
               // System.out.print(" ");
            }
        }
System.out.print(sum);

} 
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 1 / 1 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	5 5 2 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 1 3 0 6 7 8 11 8 11	37.0	37.0	Passed

Week 8 : Programming Assignment 4

Program to remove duplicate elements from sorted array
Follow the naming convention as given in the main method of the suffix code.

Your last recorded submission was on 2024-03-10, 10:02 IST

Select the Language for this assignment.

File name for this program :

import java.util.Scanner;
class W08_P4
{

//TODO code to remove duplicates from sorted array
static int removeDuplicates(int arr[])
    {
        int n = arr.length;
        // Return, if array is empty or 
        // contains a single element
        if (n == 0 || n == 1)
            return n;
 
        int[] temp = new int[n];
 
        // Start traversing elements
        int j = 0;
        for (int i = 0; i < n - 1; i++)
             
            // If current element is not equal to next
            // element then store that current element
            if (arr[i] != arr[i + 1])
                temp[j++] = arr[i];
 
        // Store the last element as whether it is unique or
        // repeated, it hasn't stored previously
        temp[j++] = arr[n - 1];
 
        // Modify original array
        for (int i = 0; i < j; i++)
            arr[i] = temp[i];
 
        return j;
    }

public static void main(String... a)
    {        
        Scanner s = new Scanner(System.in);
        int size = s.nextInt();
        int[] array = new int[size];
        int i;
        for (i = 0; i < size; i++) {
            array[i] = s.nextInt();
        }
        int index = removeDuplicates(array);
        for(i=0; i<index; i++){
            System.out.print(array[i] + " ");
        }
    }
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 1 / 1 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	6 1 2 2 3 3 4	1 2 3 4	1 2 3 4	Passed after ignoring Presentation Error

Week 8 : Programming Assignment 5

Write a code to find the Determinant of the 2D matrix.

Your last recorded submission was on 2024-03-10, 09:53 IST

Select the Language for this assignment.

File name for this program :

import java.util.*;
 
public class W08_P5{

static int determinantOfMatrix(int mat[][], int n)
    {
        int num1, num2, det = 1, index,
                        total = 1; // Initialize result
         int[] temp = new int[n + 1];
         for (int i = 0; i < n; i++){
            index = i; // initialize the index
             while (index < n && mat[index][i] == 0){
                index++;
            }
            if (index == n) // if there is non zero element
            {
                continue;
            }
            if (index != i){
                for (int j = 0; j < n; j++){
                    swap(mat, index, j, i, j);
                }
                det = (int)(det * Math.pow(-1, index - i));
            }
             for (int j = 0; j < n; j++){
                temp[j] = mat[i][j];
            }
            for (int j = i + 1; j < n; j++){
                num1 = temp[i]; // value of diagonal element
                num2 = mat[j][i]; // value of next row element
                 for (int k = 0; k < n; k++) {
                    mat[j][k] = (num1 * mat[j][k])
                                - (num2 * temp[k]);
                }
                total = total * num1; // Det(kA)=kDet(A);
            }
        }
        for (int i = 0; i < n; i++) {
            det = det * mat[i][i];
        }
        return (det / total); // Det(kA)/k=Det(A);
    }
    static int[][] swap(int[][] arr, int i1, int j1, int i2,
                        int j2){
        int temp = arr[i1][j1];
        arr[i1][j1] = arr[i2][j2];
        arr[i2][j2] = temp;
        return arr;
}

public static void main(String args[]) {
        int array[][] = new int[5][5];
        int i, j;
       // double sum = 0, square = 0, result = 0;
        Scanner s = new Scanner(System.in);
 
        
        int dimension = s.nextInt();
 
       
        for (i = 0; i < dimension ; i++) {
            // loop for columns
            for (j = 0; j < dimension ; j++) {
                // reads the matrix elements
                array[i][j] = s.nextInt();
                // prints space
               // System.out.print(" ");
            }
        }
System.out.printf("Determinant of the matrix is : %d",
            determinantOfMatrix(array,dimension));
} 
}