Buzz Number

Buzz number:
     A number is said to be Buzz Number if it ends with 7 or is divisible by 7.

Example:

1007 is a Buzz Number as it end with 7.343 is also a Buzz Number as it is divisible by 7 and 77777 is also a Buzz Number as it ends with 7 and also it is divisible by 7.

/* Java program to check given number is buzz number or not*/

package rakesh;
import java.io.*;

class BuzzNumber
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int a;
public void show() throws Exception
{
System.out.print("Enter the number:");
a = Integer.parseInt(br.readLine());
if( a % 10 == 7 || a % 7 == 0 )
System.out.println("Entered number is a Buzz number.");
else
System.out.println("Entered number is not a Buzz number.");

}

public static void main(String args[]) throws Exception
{
BuzzNumber bn=new BuzzNumber();
bn.show();
}

}







OUTPUT:


Enter the number:49

Entered number is a Buzz number.


Enter the number:23
Entered number is not a Buzz number.

EVIL NUMBER

EVIL NUMBER:
       In number theory, an evil number is a non-negative number that has an even number of 1s in its binary expansion.

The first evil numbers are:

0, 3, 5, 6, 9, 10, 12, 15, 17, 18, 20, 23, 24, 27, 29, 30, 33, 34, 36, 39 .

These numbers give the positions of the zero values in the Thue–Morse sequence.

Numbers that are not evil are called odious numbers.

/* program to check given number is evil number or not*/

import java.io.*;

public class EvilNumber

{

    public static void main(String args[])throws IOException

    {

        int num, a, count , c, i;

        int binNum[] = new int[20];

        InputStreamReader in = new InputStreamReader(System.in);

        BufferedReader br = new BufferedReader(in);

        System.out.println("Enter a number:");

        num = Integer.parseInt(br.readLine());

        count = 0;  // count the number of 1's

        c = 0;      // for index of array

        while(num!=0)

        {

            a = num % 2;

            binNum[c] = a;

            if(a == 1)

             count++;

            num = num / 2;

            c++;

        }

        System.out.println("Total number of 1 is = " + count);

        // Print the binary number

        for(i=c-1; i>=0 ; i--)

        {

            System.out.print(binNum[i]+" ");

        }

        // Checking the number is Evil or Not

        if(count % 2 == 0)

        {

            System.out.println("\nEntered number is Evil an Number");

        }

        else

        {

            System.out.println("\nEntered number is not an Evil Number");

        }

    }   

}

OUTPUT:

Enter a number:

10

Total number of 1 is = 2

1 0 1 0 

Entered number is Evil an Number

Enter a number:

13

Total number of 1 is = 3

1 1 0 1 

Entered number is not an Evil Number

DISARIUM NUMBER

DISARIUM NUMBER:
A Disarium number is a number defined by the following process:
Sum of its digits powered with their respective position is equal to the original number.
 
Example:
 175 is a Disarium number:
As 1¹+3²+5³ = 135
 
some of disarium numbers
 89, 175, 518 etc.


/*Java program to check given number is disarium number or not*/

 package rakesh;
import java.io.*;
class DisariumNumber
    {
    public static void main(String[] args)throws IOException
        {
            BufferedReader br=new BufferedReader (new InputStreamReader(System.in));
            System.out.print("Enter a number : ");
            int n = Integer.parseInt(br.readLine());
            int copy = n, d = 0, sum = 0;
            String s = Integer.toString(n); //converting the number into a String
            int len = s.length(); //finding the length of the number i.e. no.of digits
           
            while(copy>0)
            {
                d = copy % 10; //extracting the last digit
                sum = sum + (int)Math.pow(d,len);
                len--;
                copy = copy / 10;
            }
           
            if(sum == n)
                System.out.println(n+" is a Disarium Number.");
            else
                System.out.println(n+" is not a Disarium Number.");
        }
    }



OUTPUT:

Enter a number : 135

135 is a Disarium Number.

Enter a number : 321

321 is not a Disarium Number.

MAGIC NUMBER

MAGIC NUMBER:
  A number is said to be a Magic number if the sum of its digits are calculated till a single digit is obtained by recursively adding the sum of its digits.
If the single digit comes to be 1 then the number is a magic number.

Example:
199 is a magic number as 1+9+9=19 but 19 is not a single digit number so 1+9=10 and then 1+0=1 which is a single digit number and also 1.Hence it is a magic number.

/*Java program to check given number is magic number or not*/

import java.util.*;
public class MagicNumber
{
 public static void main(String args[])
 {
 Scanner ob=new Scanner(System.in);
 System.out.println("Enter the number:");
 int n=ob.nextInt();
 int sum=0,num=n;
 while(num>9)
 {
 sum=num;int s=0;
 while(sum!=0)
 {
 s=s+(sum%10);
 sum=sum/10;
 }
 num=s;
 }
 if(num==1)
 {
 System.out.println(n+" is a Magic Number.");
 }
 else
 {
 System.out.println(n+" is not a Magic Number.");
 }
 }

}




OUTPUT:


Enter the number:
12

12 is not a Magic Number.

Enter the number:

19

19 is a Magic Number.

AUTOMORPHIC NUMBER

AUTOMORPHIC NUMBER:

An automorphic number is a number whose square ends in the same digits as the number itself.

Examples of automorphic numbers : 5, 6 and 76

/*Java program to find given number is automophic number or not*/

import java.util.*;

class AutomorphicNumber

{

  public static void main(String args[]) throws Exception

  {

    Scanner sc = new Scanner(System.in);

    System.out.print("Enter a Number : "); // Inputting the number

    int n = sc.nextInt();

    int sq = n*n; // Finding the square

    String num = Integer.toString(n); // Converting the number to String

    String square = Integer.toString(sq); // Converting the square to String

    if(square.endsWith(num)) // If the square ends with the number then it is Automorphic

        System.out.print(n+" is an Automorphic Number.");

    else

        System.out.print(n+" is not an Automorphic Number.");

    }

}

OUTPUT:

Enter a Number : 5

5 is an Automorphic Number.

Enter a Number : 9

9 is not an Automorphic Number.

HARSHAD NUMBER / NIVEN NUMBER

HARSHAD NUMBER (or) NIVEN NUMBER:

In recreational mathematics, a harshad number (or Niven number) in a given number base, is an integer that is divisible by the sum of its digits when written in that base. Harshad numbers in base n are also known as n-harshad (or n-Niven) numbers. Harshad numbers were defined by D. R. Kaprekar, a mathematician from India. The word "harshad" comes from the Sanskrit harṣa (joy) + da (give), meaning joy-giver. The term “Niven number” arose from a paper delivered by Ivan M. Niven at a conference on number theory in 1977. All integers between zero and n are n-harshad numbers.

Here some niven numbers are given they are:

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 18, 20, 21, 24, 27, 30, 36, 40, 42, 45, 48, 50, 54, 60, 63, 70, 72, 80, 81, 84, 90, 100, 102, 108, 110, 111, 112, 114, 117, 120, 126, 132, 133, 135, 140, 144, 150, 152, 153, 156, 162, 171, 180, 190, 192, 195, 198, 200, 201, 204

Example:

Let’s take the number 126. First, we must find the sum of the digits.

1 + 2 + 6 = 9

Next, we try to divide 126 by 9. And we find…

126 ÷ 9 = 14

There it is. 14 and no remainder; or put another way: 9 is a factor of 126 because

126 = 9 × 14

/*Java program to find given number is Harshad number/ niven number or not*/

import java.util.*;

class HarshadNumber

{

    public static void main(String args[])

    {

        Scanner sc = new Scanner(System.in);

         

        System.out.print("Enter a number : ");

        int n = sc.nextInt();

        int c = n, d, sum = 0;

         

        //finding sum of digits

        while(c>0)

        {

            d = c%10;

            sum = sum + d;

            c = c/10;

        }

         

        if(n%sum == 0)

            System.out.println(n+" is a Harshad Number.");

        else

            System.out.println(n+" is not a Harshad Number.");      

    }

}

OUTPUT:

Enter a number : 123

123 is not a Harshad Number

Enter a number : 6

6 is a Harshad Number.

NEON NUMBER

NEON NUMBER:

A neon number is a number where the sum of digits of square of the number is equal to the number. For example if the input number is 9, its square is 9*9 = 81 and sum of the digits is 9. i.e. 9 is a neon number.

There are only 3 neon numbers. they are 0,1,9


/*Program for checking given number is neon number or not*/



import java.util.*;
public class NeonNumber
{
    public static void main(String args[])
    {
        Scanner ob=new Scanner(System.in);
        System.out.println("Enter the number to check neon number or not");
        int num=ob.nextInt();
        int square=num*num;
        int sum=0;
        while(square!=0)//Loop to find the sum of digits.
        {
            int a=square%10;
            sum=sum+a;
            square=square/10;
        }
        if(sum==num)
        {
            System.out.println(num+" is a Neon Number.");
        }
        else
        {
            System.out.println(num+" is not a Neon Number.");
        }
    }

}







OUTPUT:

Enter the number to check neon number or not
9

9 is a Neon Number.

Enter the number to check neon number or not
8

8 is not a Neon Number.

SPY NUMBER

SPYNUMBER:

A spy number is a number where the sum of its digits equals the product of its digits. For example, 1124 is a spy number, the sum of its digits is 1+1+2+4=8 and the product of its digits is 1*1*2*4=8.

/* java program to find given number is spynumber or not*/

import java.util.*;

public class SpyNumber

{

    public static void main(String args[])

    {

        int no, pro, sum, digit;

        pro = 1;

        sum = 0;

        Scanner sc = new Scanner(System.in);

        System.out.println("Enter a number to check spy number :");

        no = sc.nextInt();

        while(no != 0)

        {

            digit = no % 10;

            pro = pro * digit;

            sum = sum + digit;

            no = no / 10;

        }

        if(sum == pro)

        {

            System.out.println("Spy Number");

        }

        else

        {

            System.out.println("Not Spy Number");

        }

    }

}

OUTPUT:

Enter a number to check spy number:

1124

Spy Number

Enter a number to check spy number:

1254

Not Spy Number

FASCINATING NUMBER

 FASCINATING NUMBER :
When a number( 3 digit or more) is multiplied by 2 and 3 ,and when both these products are concatenated with the original number all digits from 1 to 9 are present exactly once, regardless of the number of zeroes.


Example:Joining 192 with its products by 2 and 3, the resultant number is 192384576. This number contains all digits from 1 to 9 and these digits appear exactly once in the result. Hence 192 is a fascinating number. Note : The number should be of at least 3 digits to qualify for fascinating number test

/* program to find whether it is fascinating number or not*/

import java.util.*;
class FascinatingNumber
{
    boolean isUnique(String q)
    {
        int A[] = {0,0,0,0,0,0,0,0,0,0}; //to store frequency of every digit from '0' to '9'
        int i, flag = 0;
        char ch;
        for(i=0; i<q.length(); i++)
        {
            ch = q.charAt(i);
            A[ch-48]++;
            /*  increasing A[5] if ch='5' as '5'-48 = 53-48=5
             *  (ASCII values of '0' to '9' are 48 to 57) */
        }

        for(i=1; i<10; i++)
        {
            //checking if every digit from '1' to '9' are present exactly once or not
            if(A[i]!=1)
            {
                flag = 1; //flag is set to 1 if frequency is not 1
                break;
            }
        }

        if(flag == 1)
            return false;
        else
            return true;
    }
    public static void main(String args[])
    {
        Scanner sc = new Scanner(System.in);
        FascinatingNumber ob = new FascinatingNumber();

        System.out.print("Enter a number : ");
        int n = sc.nextInt();
        String p = Integer.toString(n); //converting the number to String

        if(p.length()<3)
            System.out.println("Number should be of atleast 3 digits.");

        else
        {
            String s = Integer.toString(n*1) + Integer.toString(n*2) + Integer.toString(n*3);
            /*  Joining the first, second and third multiple of the number
             *  by converting them to Strings and concatenating them*/
            if(ob.isUnique(s))
                System.out.println(n+" is a Fascinating Number.");
            else
                System.out.println(n+" is not a Fascinating Number.");
        }    
    }
}






OUTPUT:

Enter a number : 192

192 is a Fascinating Number.

Enter a number : 152
152 is not a Fascinating Number.

Find it is PRONIC NUMBER or not

pronic number:

A pronic number is a number which is the product of two consecutive integers, that is, a number of the form n(n + 1). The study of these numbers dates back to Aristotle. They are also called oblong numbers, heteromecic numbers, or rectangular numbers; however, the "rectangular number" name has also been applied to the composite numbers.

The first few pronic numbers are:

0, 2, 6, 12, 20 30,42, 56, 72, 90, 110, 132, 156, 182, 210, 240, 272, 306, 342, 380, 420, 462 

/* program to find given number is pronic number or  not*/

import java.util.*;
class PronicNumber
{
    public static void main(String args[])
    {
        Scanner sc = new Scanner(System.in);
       
        System.out.print("Enter a number : ");
        int n = sc.nextInt();
        int flag = 0;
   
        for(int i=0; i<n; i++)
        {
            if(i*(i+1) == n)
            {
                flag = 1;
                break;
            }
        }
       
        if(flag == 1)
            System.out.println(n+" is a Pronic Number.");
        else
            System.out.println(n+" is not a Pronic Number.");    
    }
}


OUTPUT:

Enter a number : 420 420 is a Pronic Number.   Enter a number : 13 13 is not a Pronic Number.   Enter a number : 12 12 is a Pronic Number.   Enter a number : 21 21 is not a Pronic Number

SampleGraph design

public class sampleGraph extends JPanel {

    private int width = 800;
    private int heigth = 400;
    private int padding = 25;
    private int labelPadding = 25;
    private Color lineColor = new Color(44, 102, 230, 180);
    private Color pointColor = new Color(100, 100, 100, 180);
    private Color gridColor = new Color(200, 200, 200, 200);
    private static final Stroke GRAPH_STROKE = new BasicStroke(2f);
    private int pointWidth = 4;
    private int numberYDivisions = 10;
    private List<Double> scores;

    public sampleGraph(List<Double> scores) {
        this.scores = scores;
    }

    @Override
    protected void paintComponent(Graphics g) {
        super.paintComponent(g);
        Graphics2D g2 = (Graphics2D) g;
        g2.setRenderingHint(RenderingHints.KEY_ANTIALIASING, RenderingHints.VALUE_ANTIALIAS_ON);

        double xScale = ((double) getWidth() - (2 * padding) - labelPadding) / (scores.size() - 1);
        double yScale = ((double) getHeight() - 2 * padding - labelPadding) / (getMaxScore() - getMinScore());

        List<Point> graphPoints = new ArrayList<>();
        for (int i = 0; i < scores.size(); i++) {
            int x1 = (int) (i * xScale + padding + labelPadding);
            int y1 = (int) ((getMaxScore() - scores.get(i)) * yScale + padding);
            graphPoints.add(new Point(x1, y1));
        }

        // draw white background
        g2.setColor(Color.WHITE);
        g2.fillRect(padding + labelPadding, padding, getWidth() - (2 * padding) - labelPadding, getHeight() - 2 * padding - labelPadding);
        g2.setColor(Color.BLACK);

        // create hatch marks and grid lines for y axis.
        for (int i = 0; i < numberYDivisions + 1; i++) {
            int x0 = padding + labelPadding;
            int x1 = pointWidth + padding + labelPadding;
            int y0 = getHeight() - ((i * (getHeight() - padding * 2 - labelPadding)) / numberYDivisions + padding + labelPadding);
            int y1 = y0;
            if (scores.size() > 0) {
                g2.setColor(gridColor);
                g2.drawLine(padding + labelPadding + 1 + pointWidth, y0, getWidth() - padding, y1);
                g2.setColor(Color.BLACK);
                String yLabel = ((int) ((getMinScore() + (getMaxScore() - getMinScore()) * ((i * 1.0) / numberYDivisions)) * 100)) / 100.0 + "";
                FontMetrics metrics = g2.getFontMetrics();
                int labelWidth = metrics.stringWidth(yLabel);
                g2.drawString(yLabel, x0 - labelWidth - 5, y0 + (metrics.getHeight() / 2) - 3);
            }
            g2.drawLine(x0, y0, x1, y1);
        }

        // and for x axis
        for (int i = 0; i < scores.size(); i++) {
            if (scores.size() > 1) {
                int x0 = i * (getWidth() - padding * 2 - labelPadding) / (scores.size() - 1) + padding + labelPadding;
                int x1 = x0;
                int y0 = getHeight() - padding - labelPadding;
                int y1 = y0 - pointWidth;
                if ((i % ((int) ((scores.size() / 20.0)) + 1)) == 0) {
                    g2.setColor(gridColor);
                    g2.drawLine(x0, getHeight() - padding - labelPadding - 1 - pointWidth, x1, padding);
                    g2.setColor(Color.BLACK);
                    String xLabel = i + "";
                    FontMetrics metrics = g2.getFontMetrics();
                    int labelWidth = metrics.stringWidth(xLabel);
                    g2.drawString(xLabel, x0 - labelWidth / 2, y0 + metrics.getHeight() + 3);
                }
                g2.drawLine(x0, y0, x1, y1);
            }
        }

        // create x and y axes
        g2.drawLine(padding + labelPadding, getHeight() - padding - labelPadding, padding + labelPadding, padding);
        g2.drawLine(padding + labelPadding, getHeight() - padding - labelPadding, getWidth() - padding, getHeight() - padding - labelPadding);

        Stroke oldStroke = g2.getStroke();
        g2.setColor(lineColor);
        g2.setStroke(GRAPH_STROKE);
        for (int i = 0; i < graphPoints.size() - 1; i++) {
            int x1 = graphPoints.get(i).x;
            int y1 = graphPoints.get(i).y;
            int x2 = graphPoints.get(i + 1).x;
            int y2 = graphPoints.get(i + 1).y;
            g2.drawLine(x1, y1, x2, y2);
        }

        g2.setStroke(oldStroke);
        g2.setColor(pointColor);
        for (int i = 0; i < graphPoints.size(); i++) {
            int x = graphPoints.get(i).x - pointWidth / 2;
            int y = graphPoints.get(i).y - pointWidth / 2;
            int ovalW = pointWidth;
            int ovalH = pointWidth;
            g2.fillOval(x, y, ovalW, ovalH);
        }
    }

//    @Override
//    public Dimension getPreferredSize() {
//        return new Dimension(width, heigth);
//    }

    private double getMinScore() {
        double minScore = Double.MAX_VALUE;
        for (Double score : scores) {
            minScore = Math.min(minScore, score);
        }
        return minScore;
    }

    private double getMaxScore() {
        double maxScore = Double.MIN_VALUE;
        for (Double score : scores) {
            maxScore = Math.max(maxScore, score);
        }
        return maxScore;
    }

    public void setScores(List<Double> scores) {
        this.scores = scores;
        invalidate();
        this.repaint();
    }

    public List<Double> getScores() {
        return scores;
    }
   
    private static void createAndShowGui() {
        List<Double> scores = new ArrayList<>();
        Random random = new Random();
        int maxDataPoints = 40;
        int maxScore = 10;
        for (int i = 0; i < maxDataPoints; i++) {
            scores.add((double) random.nextDouble() * maxScore);
//            scores.add((double) i);
        }
        sampleGraph mainPanel = new sampleGraph(scores);
        mainPanel.setPreferredSize(new Dimension(800, 600));
        JFrame frame = new JFrame("DrawGraph");
        frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
        frame.getContentPane().add(mainPanel);
        frame.pack();
        frame.setLocationRelativeTo(null);
        frame.setVisible(true);
    }
   
    public static void main(String[] args) {
      SwingUtilities.invokeLater(new Runnable() {
         public void run() {
            createAndShowGui();
         }
      });
   }

OUTPUT:

Deadlock Program

package rakesh;
class Deadlock1
{
    // Deadlock1 class to sleep a thread
    static void sleep(long millis)
    {
        try
        {
            Thread.sleep(millis);
        }
        catch (InterruptedException e)
        {
            e.printStackTrace();
        }
    }
}

// This class is shared by both threads
class Shared
{
    // first synchronized method
    synchronized void task1(Shared s2)
    {
        System.out.println("task1 started");
        Deadlock1.sleep(1000);

        // taking object lock of s2 enters
        // into test2 method
        s2.task2(this);
        System.out.println("task1 ended");
    }

    // second synchronized method
    synchronized void task2(Shared s1)
    {
        System.out.println("task2 started");
        Deadlock1.sleep(1000);

        // taking object lock of s1 enters
        // into task1 method
        s1.task1(this);
        System.out.println("task2 ended");
    }
}


class Thread1 extends Thread
{
    private Shared s1;
    private Shared s2;

    // constructor to initialize fields
    public Thread1(Shared s1, Shared s2)
    {
        this.s1 = s1;
        this.s2 = s2;
    }

    // run method to start a thread
    @Override
    public void run()
    {
        // taking object lock of s1 enters
        // into test1 method
        s1.task1(s2);
    }
}


class Thread2 extends Thread
{
    private Shared s1;
    private Shared s2;

    // constructor to initialize fields
    public Thread2(Shared s1, Shared s2)
    {
        this.s1 = s1;
        this.s2 = s2;
    }

    // run method to start a thread
    @Override
    public void run()
    {
        // taking object lock of s2
        // enters into test2 method
        s2.task2(s1);
    }
}


public class Deadlock
{
    public static void main(String[] args)
    {
        // creating one object
        Shared s1 = new Shared();

        // creating second object
        Shared s2 = new Shared();

        // creating first thread and starting it
        Thread1 t1 = new Thread1(s1, s2);
        t1.start();

        // creating second thread and starting it
        Thread2 t2 = new Thread2(s1, s2);
        t2.start();

        // sleeping main thread
        Deadlock1.sleep(2000);
    }
}






OUTPUT:



task1 started
task2 started

To check two strings are anagram or not

import java.util.Scanner;

public class Anagram
{
    public static void main(String[] input)
    {
        String str1, str2;
        int len, len1, len2, i, j, found=0, not_found=0;
        Scanner scan = new Scanner(System.in);
       
        System.out.print("Enter First String : ");
        str1 = scan.nextLine();
        System.out.print("Enter Second String : ");
        str2 = scan.nextLine();
       
        len1 = str1.length();
        len2 = str2.length();

        if(len1 == len2)
        {
            len = len1;
            for(i=0; i<len; i++)
            {
                found = 0;
                for(j=0; j<len; j++)
                {
                    if(str1.charAt(i) == str2.charAt(j))
                    {
                        found = 1;
                        break;
                    }
                }
                if(found == 0)
                {
                    not_found = 1;
                    break;
                }
            }
            if(not_found == 1)
            {
                System.out.print("Strings are not Anagram to Each Other....");
            }
            else
            {
                System.out.print("Strings are Anagram");
            }
        }
        else
        {
            System.out.print("Both Strings Must have the same number of Character to be an Anagram");
        }
    }
}





OUTPUT:


Case#1
Enter First String : java
Enter Second String : aajv

Strings are Anagram

Case#2
Enter First String : java
Enter Second String : oracle
Both Strings Must have the same number of Character to be an Anagram


Case#3

Enter First String : hello
Enter Second String : given
Strings are not Anagram to Each Other..!!