JAVA PROGRAMS

1.Display odd numbers between 1 -100

class OddNumber {
public static void main(String args[]) {
System.out.println("The Odd Numbers
are:"); for (int i = 1; i <= 100; i++) {
if (i % 2 != 0) {
System.out.print(i + " ");
}}}}}
OUTPUT :
The Odd Numbers are:
1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51 53 55 57 59 61 63
65 67 69 71 73 75 77 79 81 83 85 87 89 91 93 95 97 99

2.Sum of odd numbers between 1 -100

class SumOfNum
{
public static void main(String args[])
{
int sum = 0;
for (int i = 1; i <= 100; i++)
{
if (i % 2 != 0)
{
sum = sum + i;
}
}
System.out.println("The Sum Of 100 Odd Numbers are:" + sum);
}}
OUTPUT :
The Sum Of 100 Odd Numbers are:2500

3.Total number of odd numbers between 1 -100

class TotalNumOfOddNum{
public static void main(String args[]){
int count = 0;
for(int i = 1;i <= 100;i++){
if(i % 2 != 0){
count++;
}

System.out.println("The Count Of Odd Numbers are:" + count);

}}
OUTPUT :
The Odd Numbers are:
1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51 53 55 57 59 61 63
65 67 69 71 73 75 77 79 81 83 85 87 89 91 93 95 97 99
4.Find sum of first n numbers
class SumOfNum
{
public static void main(String args[])
{
int sum
= 0; int
n=10;
for(int i = 1;i <= n;i++)
{
sum = sum + i;
}
System.out.println("The Sum Of "+n+" Numbers are:" + sum);
}
}

OUTPUT :
The Sum Of 10 Numbers are:55

5.Find the sum of the digits of a number

public class DigitsSum{
public static void main(String[] args){
int num=251025, rem = 0, sum = 0,
temp; temp = num;
while (num > 0)
{
rem = num %
10; sum =
sum + rem;
num = num /
10;}

System.out.print("Sum of Digits of " + temp + " is " + sum);}}

OUTPUT :
Sum of Digits of 251025 is 15

6.Program to print Armstrong number between 1 to 1000

public class ArmstrongNumbers{

public static void main(String[] args){
int num,rem,limit=1000, sum = 0;
System.out.print("Armstrong numbers from 1 to
N:"); for (int i = 1; i <= limit; i++){
num = i;
while (num > 0){
rem = num % 10;
sum = sum + (rem*rem*rem); num = num / 10;}
if (sum == i){
System.out.print(i + " ");}
sum = 0;}}}
OUTPUT :
Armstrong numbers from 1 to N:1 153 370 371 407
7.Program to check the given number is Palindrome or not

public class PalindromeNumberCheck{

public static void main(String[] args){
int n=121,pal,r,rev=0; pal = n;
while (n > 0) {
r = n % 10;
rev = rev * 10 + r; n = n / 10; }
if (rev == pal){
System.out.println(" The given no ispalindrome "+ rev);}
else{
System.out.println("The given no is not
palindrome " + rev);
}}}
OUTPUT :
The given no is palindrome 121

8. Program to print N prime numbers and find sum and

average

public class PrimeNumberUptoN{

public static void main(String[] args){
int num =0, i =0;
System.out.println("Prime numbers from 1 to 100 are
:"); for (i = 1; i <= 100; i++){
int counter=0;
for(num =i; num>=1; num--){
if(i%num==0){
counter = counter + 1;}}
if (counter ==2){
System.out.print(i+" ");}}}}
OUTPUT :
Prime numbers from 1 to 100 are :
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83
89 97

9.Program to print pattern like this

*
**
***
****

public class PyramidPattern1{

public static void main(String[] args){
int n=4;
for(int i=0;i<n;i++){
System.out.println("\n"); for(int j=0;j<=i;j++){
System.out.print(" * ");
}}}}

OUTPUT :
*
* *
* * *
* * * *
10.Program to print patterns of numbers and stars

*
**
***
****
*****
public class PyramidPattern2
{
public static void main(String args[])
{
int i, j, k=8;
for(i=0; i<5;
i++)
{
for(j=0; j<k; j++)
{
System.out.print(" ");
}
k = k - 2;
for(j=0; j<=i; j++)
{
System.out.print("* ");
}
System.out.println();
}
}
}
OUTPUT :
*
**
***
****
*****

11.Program to print patterns of numbers and stars

***************
******* *******
****** ******
***** *****
**** ****
*** ***
** **
* *
* *
** **
*** ***
**** ****
***** *****
****** ******
******* *******
***************
import Java .util.Scanner;
public class DifferentPatternPrograms1
{
public static void main(String args[])
{
int n,i,j,k,l,m,p,q,r,s;
Scanner sc=new Scanner(System.in);
System.out.println("Enter values");
n=sc.nextInt();
P=n;
q=n;
for(i=n;i>=1;i--)
{
for(j=1;j<=i;j++){
System.out.print("*");}
for(k=p*2;k<n*2-1;k++){
System.out.print(" ");}
for(l=i;l!=0;l--){
if(l==n){
continue;}
System.out.print("*");}
p--;
System.out.println();}
for(i=1;i<=n;i++){
for(j=1;j<=i;j++){
System.out.print("*");}
for(k=q*2-2;k>1;k--){
System.out.print(" ");}
for(m=i;m!=0;m--){
if(m==n){
continue;}
System.out.print("*");}
System.out.println(); q--;}}

OUTPUT :
Enter values
8
***************
******* *******
****** ******
***** *****
**** ****
*** ***
** **
* *
* *
** **
*** ***
**** ****
***** *****
****** ******
******* *******
***************
12. Print Floyds triangle

import java.util.Scanner;
class FloydsTriangle{
public static void main(String args[]){
Scanner scan = new Scanner(System.in);
System.out.println("Enter the number of rows\n");
int rows = scan.nextInt();
System.out.println("Floyd's Triangle Generated\n"); int count = 1;
for ( int i = 1 ; i <= rows ; i++ ){
for ( int j = 1 ; j <= i ; j++ ){
System.out.print(count+" ");
count++;}
System.out.println();}}}
OUTPUT :
Enter the number of rows

9
Floyd's Triangle Generated

1
23
456
7 8 9 10
11 12 13 14 15
16 17 18 19 20 21
22 23 24 25 26 27 28
29 30 31 32 33 34 35 36
37 38 39 40 41 42 43 44 45

13.Print numbers in sequence way

public class PatternNumberSequence{

public static void main(String[] args){
int a = 3; int b = 4; int n = 8;
for (int i = 1; i <= n; i++){
int c = a + b;
System.out.print(a + " " + b + " " + c); System.out.println(" ");
a = c;
b = b + 1;
}}}

OUTPUT :

347
7 5 12
12 6 18
18 7 25
25 8 33
33 9 42
42 10 52
52 11 63
14.Print numbers in triangle and pyramid vice
1
121
12321
1234321
123454321

import java.util.Scanner;
public class PatternNuberPyramidPrevRev
{
public static void main(String args[])
{
int s = 1; int n;
Scanner sc = new Scanner(System.in); System.out.println("Enter the N values"); n =
sc.nextInt();
for (int i = 1; i <= n; i++){
while (s <= i){
System.out.print(s); s++}

s--;
while (s > 1){
System.out.print(--s);}
System.out.println();}}}

OUTPUT :
Enter the N values
7
1
121
12321
1234321
123454321
12345654321
1234567654321

15.Print Pattern Number Pyramid Upto N

public class PatternNumberPyramidUpto{

public static void main(String args[]){
int i, j, n = 1;
for (i = 0; i < 5; i++) {
for (j = 0; j <= i; j++)
{
System.out.print(n + " "); n++;
}
System.out.println();
}}}

OUTPUT :
1
23
456
7 8 9 10
11 12 13 14 15
16.Print Pattern Number Pyramid

import java.util.Scanner;
public class PatternNumberPyramid
{
public static void main(String args[])
{

int i, j, n;

Scanner sc = new Scanner(System.in); System.out.println("Enter the Row value n"); n

= sc.nextInt();
for (i = 1; i <= n; i++)
{
for (j = 1; j <= i; j++)
System.out.print(" " + j);
System.out.print("\n");

}
}
OUTPUT :
Enter the Row value n
5
1
12
123
1234
12345

17. Print numbers in pyramid vice

import java.util.Scanner;
public class PatternNumberPyramidArrow
{
public static void main(String args[])
{
int i, j, n;
Scanner sc = new Scanner(System.in); System.out.println("Enter the
values "); n = sc.nextInt();
for (i = 1; i <= n; i++)
{
for (j = 1; j <= i; j++)
System.out.print(" " + j);
System.out.print("\n");
}
for (i = n - 1; i >= 1; i--)
{
for (j = 1; j <= i; j++)
System.out.print(" " + j);
System.out.print("\n");}}}
 OUTPUT :
Enter the values
5
1
12
123
1234
12345
1234
123
12
1

18.PrintPatternNumberPyramidRev

import java.util.Scanner;
public class PatternNumberPyramidRev
{
public static void main(String args[])
{
int i, j, k, n, a;

Scanner sc = new Scanner(System.in);

System.out.println("Enter the n values"); n = sc.nextInt();
a = n;
for (i = 1; i <= n; i++){
for (j = a; j > 1; j--){
System.out.print(" ");}
for (k = i; k != 0; k--){
System.out.print(k);}
a--;

for (int l = 2; l <= i; l++){

System.out.print(l);}
System.out.println();
}}}
OUTPUT :
1
212
32123
4321234
543212345

19.Print different patterns using stars

*****
****
***
**
*

import java.util.Scanner;
public class Star1{
public static void main(String args[]){
int i, j, t;
System.out.println("How many row you want ");
Scanner sc = new Scanner(System.in);
t = sc.nextInt();
for (j = 0; j < t; j++){
for (i = t - 1; i >= j; i--){
System.out.print("*");}
System.out.println("");}}}

OUTPUT :
How many row you want
5
*****
****
***
**
*
20.Print different patterns using stars
* *
** **
******
public class Star3{
public static void main(String[] x){
int i, j, k, n = 3;
for (i = 0; i < n; i++){
for (j = 0; j <= i; j++){
System.out.print("*");}
for (j = (n - i); j >= 2; j--){
System.out.print(" ");}
for (k = i; k >= 0; k--){
System.out.print("*");}
System.out.println();}}}{
System.out.print("*");}
for (j = (n - i); j >= 2; j–){
System.out.print(" ");}
for (k = i; k >= 0; k--){
System.out.print("*");}
System.out.println();}}}
OUTPUT :
* *
** **
******

21.Print pyramid triangle with star and numbers

*
***
*****
*******
*********
*******
*****
***
*
public class Star10{
public static void main(String args[]){
int i, j, k;
for (i = 1; i <= 5; i++) {
for (j = i; j < 5; j++){
System.out.print(" ");}
for (k = 1; k < (i * 2); k++){
System.out.print("*");}
System.out.println("");}
for (i = 4; i >= 1; i--){
for (j = 5; j > i; j--){
System.out.print(" ");}
for (k = 1; k < (i * 2); k++){
System.out.print("*");}
System.out.println("");}}}
OUTPUT :
*
***
*****
*******
*********
*******
*****
***
*

22.Program to find largest number in an array

class LargestNumber{
public static void main(String args[]){
int[] a = new int[] { 20, 30, 50, 4, 71, 100};
int max = a[0];
for(int i = 1; i < a.length;i++){
if(a[i] > max){
max = a[i];}}
 System.out.println("The Given Array Element is:");
for(int i = 0; i < a.length;i++){
System.out.println(a[i]);}
System.out.println("From The Array
Element Largest Number is:" + max);}}

OUTPUT :
The Given Array Element is:
20
30
50
4
71
100
From The Array Element Largest Number is:100

23.Program to find second largest number in an array

public class SecondLargest {

public static void main(String[] args) {
int arr[] = { 14, 46, 47, 86, 92, 52, 48, 36, 66, 85 };
int largest = arr[0];
int secondLargest = arr[0];
System.out.println("The given array is:");
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]+"\t");}
for (int i = 0; i < arr.length; i++) {
if (arr[i] > largest) {
secondLargest = largest; largest = arr[i];}
else if (arr[i] > secondLargest) {
secondLargest =arr[i];}}
System.out.println("\nSecond largest number is:"
+secondLargest);}}
OUTPUT :
The given array is:
14 46 47 86 92 52 48 36 66 85
Second largest number is:86

24.Program to find largest and second largest in an array

public class LargestAndSecondLargest

{
public static void main(String[] args)
{
int nums[] = { 5, 34, 78, 2, 45, 1, 99, 23 };
int maxOne = 0; int maxTwo = 0;
for (int i=0;i<nums.length; i++)
{
if (maxOne < nums[i])
{
maxTwo = maxOne; maxOne = nums[i];
}
else if (maxTwo < nums[i])
{
maxTwo = nums[i];
}
}
System.out.println("Largest Number: " + maxOne);
System.out.println("Second Largest Number: " +
maxTwo);
}
}

OUTPUT :

Largest Number: 99
Second Largest Number: 78
25.Find the index of the largest number in an array

public class LargestNumberIndex

{
public static void main(String[] args)
{

int a[] = new int[] { 12, 44, 23, 56, 23, 78, 13 };

int max = a[0];

int index = 0;

for (int i = 0; i < a.length; i++)

{
if (max < a[i])
{
max = a[i]; index = i;
}
}
System.out.println("Index position of Maximum value in an
array is”+index);
}
}

OUTPUT :

Index position of Maximum value in an array is : 5