POLYMORPHISM 

package com.cnc;

class Movie {
    private String name;
    public Movie(String name) {
        this.name = name;
    }
    public String script() {
        return "The plot is here";
    }

    public String getName() {
        return name;
    }
}
class Jollywood extends Movie{
    public Jollywood() {
        super("Assamese");
    }
    public String script() {
        return "jai aai Axom";
    }

}
class JatinBora extends Jollywood {
    public JatinBora(){
    }
    public String script() {
        return "ratnakar";
    }
}
class Bollywood extends Movie {
    public Bollywood() {
        super("Hindi");
    }
    public String script(){
        return "Jai hind!";
    }
}
class Sharukh extends Bollywood {
    public Sharukh(){
    }
    public String script() {
        return "hehe";
    }
}
public class Main {

    public static void main(String[] args) {
    for(int i=1; i<11;i++){
        Movie movie = randomMovie();
         System.out.println("MOVIE = "+ i+" i "+ movie.getName());
     }
    }
    public static Movie randomMovie(){
        int randomNum = (int)(Math.random()*5)+1;
        System.out.println("RANDOM NUMER GENERATED WAS "+ randomNum);
        switch (randomNum){
            case 1:
                return new Sharukh();
            case 2:
                return new JatinBora();
            case 3:
                return new Bollywood();
            case 4:
                return new Jollywood();
            default:
                return null;
        }
    }
}


RANDOM NUMER GENERATED WAS 2
MOVIE = 1 i Assamese
RANDOM NUMER GENERATED WAS 4
MOVIE = 2 i Assamese
RANDOM NUMER GENERATED WAS 1
MOVIE = 3 i Hindi
RANDOM NUMER GENERATED WAS 4
MOVIE = 4 i Assamese
RANDOM NUMER GENERATED WAS 3
MOVIE = 5 i Hindi
RANDOM NUMER GENERATED WAS 5

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