CYLINDER CHALLENGE

 1 Write a class with the name Circle.. the class needs one field (instance variable) with name radius of type double.
  The class needs to have one constructor with a parameter radius of type double and it needs to initialize the fields.
in case the radius parameter is less than 0 it needs to set the radius field value to 0.
Write the following methods(instance method):
  • the method named getRadius without any parameters, it needs to return the value of the radius field.
  •  ''        ''          ''       getArea          ''        ''           ''         , ''     ''      ''     ''       ''    calculated area (radius*radius*PI) for PI use Math.PI constant.  
2 Write the name Cylinder that extends Circle class. The class needs one field (instance variable) with the name height of type double.
The class needs to have one constructor with two parameters radius and height of both of type double. It needs to call the parent constructor and initialize the height field.
In case the height parameter is less than 0 it needs to set the height field to 0.
Write the following methods:
  • Method named getHeight without any parameters, it needs to return the value of the height field.
  •   ''                ''    getVolume      ''       ''          ''          , ''    ''       ''     ''        ''      ''     ''    ''        ''     area.
Soln :
package com.cnc;

public class Circle {
    private double radius;

    public Circle(double radius) {
        this.radius = radius < 0 ? 0:radius;
    }

    public double getRadius() {
        return this.radius;
    }

    public double getArea() {
        return this.radius * this.radius * Math.PI;
    }
}

package com.cnc;

public class Cylinder extends Circle {
    private double height;

    public Cylinder(double radius, double height) {
        super(radius);
        this.height = height < 0 ? 0:height;
    }

    public double getHeight() {
        return this.height;
    }

    public double getVolume() {
        return this.height * getArea();
    }
}


Popular posts from this blog

NUMBER PALINDROME CHALLENGE

  package com.cnc ; public class Main { public static void main ( String [] args) { System . out .println( isPalindrome ( 101 )); } public static boolean isPalindrome ( int number) { int reverse = 0 ; int temporaryNumber =number; while (number!= 0 ){ reverse = reverse* 10 + number% 10 ; number = number/ 10 ; } if (reverse== temporaryNumber ) return true ; else return false ; } }
Read more

ENCAPSULATION CHALLENGE

package com.cnc ; public class Main { public static void main ( String [] args) { Printer printer = new Printer( 50 , true ); System . out .println( "Initial Page count is " + printer .getNumberOfPages()); int pagesPrinted = printer .getNumberOfPages( 4 ); } } package com.cnc ; public class Printer { private int tonerLevel = 100 ; private int numberOfPages ; private boolean isDuplex ; public Printer ( int tonerLevel, boolean isDuplex) { if (tonerLevel>=- 1 && tonerLevel<= 100 ) { this . tonerLevel = tonerLevel; } else { this . tonerLevel =- 1 ; } this . isDuplex = isDuplex; this . numberOfPages = 0 ; } public int addToner ( int tonerAmount){ if (tonerAmount> 0 && tonerAmount<= 100 ){ if ( this . tonerLevel +tonerAmount > 100 ){ return - 1 ; } this . tonerLevel += tonerAmount
Read more

LARGEST PRIME FACTOR OF A NUMBER

package com.cnc ; public class Main { public static void main ( String [] args) { System . out .println( getLargestPrime ( 20 )); System . out .println( getLargestPrime ( 7 )); } public static int getLargestPrime ( int number){ int i,stored=number; if (number<= 0 ) return - 1 ; else if ( isPrime (number)){ number=stored; } else { for ( i = 2 ; i < number; i++){ if (number%i== 0 ){ stored=i; } } } return stored; } public static boolean isPrime ( int n){ for ( int j = 2 ; j <n; j ++){ if (n% j == 0 ) return false ; else return true ; } return false ; } } ☑ Here i created a new method isTrue. if the number is prime then the number will return the same as output. but if it is not a prime then it will return the largest number excluding itself.
Read more