Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
54 views

Java Programs Java 1658665821

The Java code defines a method to find if an element exists in an array. It takes user input to populate a 5 element integer array. It then prompts the user to input an element to search for. The code iterates through the array and compares each element to the search element. If a match is found, it sets a boolean variable to true, otherwise it remains false. This indicates whether the search element was found in the array.

Uploaded by

Spoorthi B
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
54 views

Java Programs Java 1658665821

The Java code defines a method to find if an element exists in an array. It takes user input to populate a 5 element integer array. It then prompts the user to input an element to search for. The code iterates through the array and compares each element to the search element. If a match is found, it sets a boolean variable to true, otherwise it remains false. This indicates whether the search element was found in the array.

Uploaded by

Spoorthi B
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 37

import java.util.

Scanner;

public class AddtionOfArray {

public static void main(String[] args) {


char reply;
int sum = 0;

int a[];
a = new int[5];
System.out.println("Enter Five Number ");
Scanner sc = new Scanner(System.in);
for (int i = 0; i < 5; i++) {
a[i] = sc.nextInt();

}
System.out.println("Element stored Successfuly. Do You want to Print additon of element
Y/N");

reply = sc.next().toLowerCase().charAt(0);

if (reply == 'y')
{
for (int i = 0; i < 5; i++)
{
if (i == 4)
{
sum = sum + a[i];
System.out.print(a[i] + " = " + sum);
break;
}
System.out.print(a[i] + " + ");
sum = sum + a[i];

}
else {
System.out.println("Thank You");
System.exit(0);

Java Programs - Atul Yadav


import java.util.Scanner;

public class AllEvenNumber {

public static void main(String[] args) {


int n, i;
int total = 0;

System.out.println("Enter a number");
Scanner sc = new Scanner(System.in);
n = sc.nextInt();

for (i = 1; i <= 100; i++) {


if (i % 2 == 0) {

System.out.print(i + " ");


total = total + 1;

}
}
System.out.println("");

System.out.println("Total Even Number are " + total);


}

Java Programs - Atul Yadav


import java.util.Scanner;

public class ArrayDuplicate {

public static void main(String[] args) {


int n;
System.out.println("Enter size of array : ");
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
int a[] = new int[n];

System.out.println("Enter " + n + " array element ");


for (int i = 0; i < n; i++)

{
a[i] = sc.nextInt();

for (int i = 0; i < n; i++) {


for (int j = i + 1; j < n; j++) {
if (a[i] == a[j]) {
System.out.print("Duplicate Elements are Found ==> " + a[i] + " ");

}
}
}
System.out.println();

Java Programs - Atul Yadav


import java.util.Scanner;

public class ArrayDuplicate2 {

public static void main(String[] args) {


int n;
System.out.println("Enter size of array : ");
Scanner sc = new Scanner(System.in);
n= sc.nextInt();
int a[]=new int[n];

System.out.println("Enter "+ n+" array element ");


for(int i=0;i<n;i++)

{
a[i]=sc.nextInt();

for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(a[i]==a[j])
{
System.out.print("Duplicate Elements are Found ==> " +a[i ] +" ");

}
}
}
System.out.println();
}}

Java Programs - Atul Yadav


import java.util.Scanner;

public class ArrayTest {

public static void main(String[] args) {


int[] a = new int[5];

char reply='y';
System.out.println("Enter 5 number for array");
Scanner sc = new Scanner(System.in);
for(int i=0;i<5;i++)
{
a[i]=sc.nextInt();

}
System.out.println("Element stored successfuly. Do You want to Print Y/N");
reply=sc.next().charAt(0);

if(reply=='y')
{
System.out.println("array elements are : ");

for(int i=0;i<5;i++)
{
System.out.print(a[i]+" ");
}
}
else
{
System.out.println("Thank You");

System.exit(0);

Java Programs - Atul Yadav


import java.util.Scanner;

public class CaseConvert {

public static void main(String[] args) {


String s=" ";

System.out.println("Enter String : ");


Scanner sc= new Scanner(System.in);

s= sc.nextLine();
StringBuffer str = new StringBuffer(s);

sc.close();

for(int i=0;i<=s.length()-1 ;i++)


{
if( Character.isLowerCase(s.charAt(i)))
{
str.setCharAt(i, Character.toUpperCase(s.charAt(i)));
}
else
{
str.setCharAt(i, Character.toLowerCase(s.charAt(i)));
}

}
System.out.println(str);
}

Java Programs - Atul Yadav


import java.util.Scanner;

public class CharCountNoSpace {

public static void main(String[] args) {


//this program count string char but not space
String s="";
int c=0;

System.out.println("Enter String ");


Scanner sc = new Scanner(System.in);
s= sc.nextLine();
sc.close();

int n=s.length();
for(int i=0;i<=n-1;i++)
{
if(s.charAt(i) != ' ')
{
c++;

}
}
System.out.println("The String count with space is = "+s.length());
System.out.println("The String count without space is = "+c);
}

Java Programs - Atul Yadav


import java.util.Scanner;

public class CommonFromTwoArray {

public static void main(String[] args) {

int n1, n2;

System.out.println("Enter size of 1st Arrary");

Scanner sc = new Scanner(System.in);


n1 = sc.nextInt();
int a[] = new int[n1];

System.out.println("Enter Elements of 1st Arrary");


for (int i = 0; i < n1; i++) {
a[i] = sc.nextInt();

System.out.println("Enter size of 2st Arrary");

n2 = sc.nextInt();
int b[] = new int[n2];

for (int i = 0; i < n2; i++) {


b[i] = sc.nextInt();

}
System.out.println("Common Elements of Arrary");

for (int i = 0; i < n1; i++)


{
for (int j = 0; j < n2; j++)
{
if (a[i] == b[j])
{
System.out.print(a[i] + " ");
}
}
}

Java Programs - Atul Yadav


import java.util.Scanner;

public class DeleteArrayByItemName {

public static void main(String[] args)


{
int loc=0;
int item;
char ch;
Scanner sc = new Scanner(System.in);

int a[]={10,20,30,4,50,60};
for(int i=0;i<a.length;i++)
{
System.out.print(a[i]+" ");
}
System.out.println();
System.out.println("Enter item to be Delete form above array :");
item=sc.nextInt();

for(int i=0;i<a.length;i++)
{
if(a[i]==item)
{
loc=i;
break;
}
}

System.out.println("Item Found at location "+ loc);

for(int i=loc;i<a.length-1;i++)
{
a[i]=a[i+1];

}
System.out.println("Item delete successfuly Do You want to Print array ");

ch=sc.next().charAt(0);
if(ch=='y' || ch== 'Y')

{
for(int i=0;i<a.length-1;i++)
{
System.out.print(a[i]+" ");
}
}
else
{ System.exit(0); }
}
}

Java Programs - Atul Yadav


import java.util.Scanner;

public class DeletingFromArray {

public static void main(String[] args) {


int n,loc;
System.out.println("Enter size of array");
Scanner sc = new Scanner(System.in);
n=sc.nextInt();
int a[] = new int[n];
System.out.println("Enter Element of array");
for(int i=0;i<n;i++)
{
a[i] = sc.nextInt();

System.out.println("Enter location element to delete");

loc=sc.nextInt();

for(int i=loc;i<n-1;i++)
{

a[i]=a[i+1];
}

System.out.println("Enter Element of array");


for(int i=0;i<n-1;i++)
{
System.out.print(a[i]+ " ");

}
// 10 20 30 40 50
// 0 1 2 3 4

Java Programs - Atul Yadav


import java.util.Scanner;

public class FiboExample {

public static void main(String[] args) {


int a=0,b=1,i,c,n;

System.out.println("Enter Number :");


Scanner sc = new Scanner(System.in);
n=Integer.parseInt(sc.next()); // we need to parse in case of next()
// n=sc.nextInt(); //direct interger

sc.close();
System.out.print(a+ " "+b +" ");

for(i=2;i<n;i++)
{
c=a+b; // 0 1 1 2 3
System.out.print(c +" ");
a=b;
b=c;
}

Java Programs - Atul Yadav


import java.util.Scanner;

public class FindElementInArray {

public static void main(String[] args) {


int a[] = new int[5];
int f;
boolean status = false;

System.out.println("Enter Array Element");


Scanner sc = new Scanner(System.in);
for (int i = 0; i < 5; i++) {
a[i] = sc.nextInt();

System.out.println("Elements are inserted. ");


System.out.println("Enter Element to Find");

f = sc.nextInt();

for (int j = 0; j < 5; j++)


{

if (a[j] == f)
{
System.out.println("Element Found at Postion " + j);
status = true;

break;

}
}

if (status == false) {
System.out.println("Element Not Found .. Please enter Valid element");

sc.close();
}

Java Programs - Atul Yadav


import java.util.Scanner;

public class FindSmallFromArray {

public static void main(String[] args) {


int small,n;

System.out.println("Enter array item size");


Scanner sc = new Scanner(System.in);
n=sc.nextInt();
int a[] = new int[n];
System.out.println("Enter array item : ");

System.out.println();
for(int i=0;i<n;i++)
{
a[i]=sc.nextInt();

small=a[0];

for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
small=a[j];

}
}
System.out.println();
System.out.println("The Smallest Number in array is "+ small);

Java Programs - Atul Yadav


import java.util.Scanner;

public class InsertArray {

public static void main(String[] args) {


int size, loc, item, i;
System.out.println("Enter Size of Array : ");
Scanner sc = new Scanner(System.in);
size = sc.nextInt();
int a[] = new int[size + 1];
System.out.println("Enter Elements in Array : ");

for (i = 0; i < size; i++) {


a[i] = sc.nextInt();

}
System.out.println("Enter location to insert element : ");
loc = sc.nextInt();
System.out.println("Enter Element to insert : ");
item = sc.nextInt();

for (i = size; i > loc; i--) {


a[i] = a[i - 1];

a[loc] = item;
size++;

System.out.println("Element Inserted Successfuly");

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


System.out.println(a[i] + " ");
}

Java Programs - Atul Yadav


import java.util.Scanner;

public class InsertArrayNew {

public static void main(String[] args) {


int size, loc, item, i;
System.out.println("Enter Size of Array");
Scanner sc = new Scanner(System.in);
size=sc.nextInt();
int a[] = new int[size+1];
System.out.println("Enter Element in to Array");
for(i=0;i<size;i++)
{
a[i]=sc.nextInt();

System.out.println("Elements Inserted in to array ..");


System.out.println("Enter location to insert item");
loc=sc.nextInt();
System.out.println("Enter item to insert ");
item=sc.nextInt();

for(i=size;i>loc;i--)
{
a[i]=a[i-1];

a[loc]=item;

System.out.println(" New ..Elements Inserted in to array ..");


for(i=0;i<size+1;i++)
{
System.out.print(a[i]+" ");
}
}

Java Programs - Atul Yadav


import java.util.Scanner;

public class KthLargestArray {

public static void main(String[] args) {


int n, k, temp;
System.out.println("Enter Size of Array");
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
int a[] = new int[n];

System.out.println("Enter Array Element");


for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();

}
System.out.println("Enter Position for Largest Element");
k = sc.nextInt();
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
if (a[i] < a[j]) {
temp = a[i];
a[i] = a[j];
a[j] = temp;

}
}

if (i == k - 1) {
System.out.println(k + "th Laragest Element is = " + a[i]);
break;

Java Programs - Atul Yadav


import java.util.Scanner;

public class LeapYear {

public static void main(String[] args) {


int n;
System.out.println("Enter a Number ");
Scanner sc = new Scanner(System.in);
n=sc.nextInt();
if(n%4==0 || n%400==0)
{
if(n%100 !=0)
{

System.out.println(" leap Year");


}
else
{
System.out.println(" not Leap Year");
}
}
else
{
System.out.println(" not Leap Year");
}

Java Programs - Atul Yadav


import java.util.Scanner;

public class MatrixAdditon {

public static void main(String[] args) {

int r, c;
System.out.println("Enter size of 2D array row and column");
Scanner sc = new Scanner(System.in);
r = sc.nextInt();
c = sc.nextInt();
int a[][] = new int[r][c];
int b[][] = new int[r][c];
int d[][] = new int[r][c]; // Can't define c[][] array because we
// declared c var for column

System.out.println("Enter array elements of 1st Arrray (" + r * c + ") elements");

for (int i = 0; i < r; i++) {


for (int j = 0; j < c; j++) {
a[i][j] = sc.nextInt();

}
}

System.out.println("Enter array elements of 2nd Arrray (" + r * c + ") elements");

for (int i = 0; i < r; i++)


{
for (int j = 0; j < c; j++)
{
b[i][j] = sc.nextInt();

}
}

for (int i = 0; i < r; i++)


{
for (int j = 0; j < c; j++)
{
d[i][j] = a[i][j] + b[i][j];

}
}

Java Programs - Atul Yadav


System.out.println("Addtion of matrix is : ");

for (int i = 0; i < r; i++)


{
for (int j = 0; j < c; j++)
{
System.out.print(d[i][j] + " ");

}
System.out.println();
}
sc.close();

import java.util.Scanner;

public class OddEven {

public static void main(String[] args) {


int n;
System.out.println("Enter a number");
Scanner sc = new Scanner(System.in);
n=sc.nextInt();
if(n%2==0)
{
System.out.println("Given number is Even");
}
else
{
System.out.println("Number is Odd");
}

Java Programs - Atul Yadav


import java.util.Scanner;

public class PalindromNumber {

public static void main(String[] args) {


int n;
int orgnumber;
int r=0;

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


Scanner sc = new Scanner(System.in);
n=sc.nextInt();
orgnumber=n;

sc.close();
int rn=0;

while(n>0)
{
r=n % 10;
rn=(rn*10)+r;
n=n/10;

}
System.out.println(rn);

if(orgnumber==rn)
{
System.out.println("the number is palilndrome number");

}
else
System.out.println("Not Palindrome number");
}

Java Programs - Atul Yadav


public class Pattern1 {

public static void main(String[] args) {

for(int i=0;i<8;i++) // this for row


{
for (int j=0;j<i;j++)
{
System.out.print("*");
}
System.out.println();

}
}

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

Java Programs - Atul Yadav


import java.util.Scanner;

public class Pattern2 {

public static void main(String[] args) {


System.out.println("Enter number to print * pattern");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i=1;i<=n;i++)
{
for (int j=1;j<=i;j++)
{
System.out.print("*");
}
System.out.println();

}
}
}

Enter number to print * pattern


5
*
**
***
****
*****

import java.util.Scanner;

public class Pattern3 {

public static void main(String[] args) {

int i,j,n;
System.out.println("Enter Number");

Scanner sc = new Scanner(System.in);

n= sc.nextInt();

for(i=1;i<=n;i++)
{
for(j=n;j>=i;j--)
{
System.out.print("*");

}
System.out.println();
}

Java Programs - Atul Yadav


} }

Enter Number
8
********
*******
******
*****
****
***
**
*

public class Pattern4 {

public static void main(String[] args)


{
for(int i=1;i<=6;i++)
{
for(int j=1;j<=i;j++)
{
System.out.print("* ");

}
System.out.println();
}

for(int i=1;i<=6;i++)
{
for (int j=5;j>=i;j--)
{
System.out.print("* ");

}
System.out.println();

} }}

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

Java Programs - Atul Yadav


import java.util.Scanner;

public class Pattern5 {

public static void main(String[] args) {


System.out.println("Enter Number ");
Scanner sc = new Scanner(System.in);
int n= sc.nextInt();

for(int i=1; i<=n;i++)


{
for(int j=1; j<=i;j++)
{
System.out.print("* ");

}
System.out.println();
}

for (int i=1;i<=n;i++)


{
for(int j=n-1;j>=i;j--)
{
System.out.print("* ");
}
System.out.println();
}

}
}

Enter Number
8
*
* *
* * *
* * * *
* * * * *
* * * * * *
* * * * * * *
* * * * * * * *
* * * * * * *
* * * * * *
* * * * *
* * * *
* * *
* *
*

Java Programs - Atul Yadav


public class Pattern6 {

public static void main(String[] args)

for(int i=1;i<=8;i++)
{

for(int jspace=7; jspace>=i ;jspace--)


{
System.out.print(" ");
}

for(int kstar=1;kstar<=i;kstar++)
{
System.out.print(" * ");
}

System.out.println();
}

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

Java Programs - Atul Yadav


import java.util.Scanner;

public class Pattern7 {

public static void main(String[] args) {


System.out.println("Enter Number");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i=1;i<=n;i++)
{
for(int jspace=n-1;jspace>=i;jspace--)
{
System.out.print(" ");
}

for(int kstar=1;kstar<i;kstar++)
{
System.out.print("* ");
}
System.out.println();
}

Enter Number
8

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

Java Programs - Atul Yadav


public class Pattern9 {

public static void main(String[] args) {


for(int i= 1;i<10;i++)

{
for(int j=10;j>i;j--)
{
System.out.print(" ");
}

for(int j=1;j<i;j++)
{
System.out.print("*");
}
System.out.println();
}

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

Java Programs - Atul Yadav


import java.util.Scanner;

public class PirmerNumber {


public static void main(String[] args) {
int n = 0, i, tempnumber = 1;

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


Scanner sc = new Scanner(System.in);

n = sc.nextInt();
for (i = 2; i < n - 1; i++)
{
tempnumber = n % i;
if (tempnumber == 0)
{
System.out.println("Not Primer");
break;
}

}
if (tempnumber != 0)
{
System.out.println("The number is primer");
}

sc.close();

Enter Number
6
Not Primer

Enter Number
7
The number is primer

Java Programs - Atul Yadav


import java.util.Scanner;

public class PrimeALL {

public static void main(String[] args) {


int temp = 0;
int i, j;
int total = 0;

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


Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
sc.close();
for (i = 1; i <= n; i++)
{
temp = 0;

for (j = 2; j <= i - 1; j++)


{
if (i % j == 0) {

temp = temp + 1
}
}
if (temp == 0) {
System.out.print(i + " ");
total = total + 1;

}
System.out.println();
System.out.println("Total Prime Number between 1 to " + n + " is " +
total);

/*
* 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 101 103 107 109 113 127 131 137 139 149
*/
}

Enter Number
150
1 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 101 103 107 109
113 127 131 137 139 149
Total Prime Number between 1 to 150 is 36

Java Programs - Atul Yadav


import java.util.Scanner;

public class PrimeNumber2 {

public static void main(String[] args) {

int i,j,n;
int temp=0;

int total=0;
System.out.println("Enter Number ");
Scanner sc = new Scanner(System.in);
n=sc.nextInt();
sc.close();
for(i=1;i<=n;i++)
{
temp=0;

for(j=2;j<=i-1;j++)
{
if(i%j==0)
{
temp++;

break;
}
}

if(temp==0)
{
System.out.print(i+" ");
total=total+1;

}
}

System.out.println("Total Prime Number are = "+total);


}

Enter Number
25
1 2 3 5 7 11 13 17 19 23 Total Prime Number are = 10

Java Programs - Atul Yadav


import java.util.Scanner;

public class PrimerNumber1 {

public static void main(String[] args) {


int n, i, counter = 0;
System.out.println("Enter Number");

Scanner sc = new Scanner(System.in);


n = sc.nextInt();

for (i = 2; i < n - 1; i++) {


if (n % i == 0) {
counter++;
break;

}
}

if (counter == 1) {
System.out.println("not Prime beacuse divisible by = " + i);
} else {
System.out.println("Prime");

}
}

Enter Number
8
not Prime beacuse divisible by = 2

Java Programs - Atul Yadav


import java.util.Scanner;

public class ReverseNumber {

public static void main(String[] args) {

System.out.println("Enter Number");
Scanner sc = new Scanner(System.in);
int n= sc.nextInt();
sc.close();
int rem;

System.out.println("The reverse number ");


while(n>0)
{
rem=n%10;

System.out.print(rem);
n=n/10;

Enter Number
952
The reverse number
259

Java Programs - Atul Yadav


public class ReverseWord {

public static void main(String[] args) {


String s= "Atul Yadav";
String sr[] = s.split(" ");

int n=sr.length;

for(int i=n-1; i>=0;i-- )


{
System.out.print(sr[i]+ " ");
}

Output
Yadav Atul

Java Programs - Atul Yadav


import java.util.Scanner;

public class RevStringNew {

public static void main(String[] args) {


String s="";
String rs="";

System.out.println("Enter string ");


Scanner sc = new Scanner(System.in);

s=sc.next();
sc.close();
int n= s.length();

int i;
for( i=n-1;i>=0;i--)
{
rs=rs+s.charAt(i);

}
System.out.println(rs);

if(s.equals(rs))
{
System.out.println("palindrome");
}
else
{
System.out.println("Not palindrom");
}

}
}

Enter string
abc
cba
Not palindrom

Java Programs - Atul Yadav


import java.util.Scanner;

public class Simple2DArray {

public static void main(String[] args) {


int r,c;
System.out.println("Enter Size for array row and column : ");
Scanner sc = new Scanner(System.in);
r=sc.nextInt();
c=sc.nextInt();
int a[][]=new int[r][c];

System.out.println("Enter " +r*c+" array element");


for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{
a[i][j]=sc.nextInt();

}
}
System.out.println("Elements stored successfully ");

for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{
System.out.print(a[i][j] + " ");

}
System.out.println();
}
}

Enter Size for array row and column :


3
3
Enter 9 array element
10
20
30
40
50
60
70
80
90
Elements stored successfully
10 20 30
40 50 60
70 80 90

Java Programs - Atul Yadav


import java.util.Scanner;

public class SortingArray {

public static void main(String[] args) {


int n,temp=0;
System.out.println("Enter Array Size : ");
Scanner sc = new Scanner(System.in);
n=sc.nextInt();
int a[] = new int[n];

System.out.println("Enter Array element : ");


for(int i= 0;i<n;i++)
{
a[i]=sc.nextInt();

for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(a[i]>a[j]) // here > or < for asc or desc
{
temp=a[i];
a[i]=a[j];
a[j]=temp;

}
}

}
for(int i=0;i<n;i++)
{
System.out.print(a[i]+" ");

Enter Array Size :


4
Enter Array element :
90
52
1
95
1 52 90 95

Java Programs - Atul Yadav


public class SwapNumber {

public static void main(String[] args) {


int a, b;

a = 10;
b = 20;

System.out.println("Befor swap a = " + a + " andb is = " + b);


a = a + b;

b = a - b;

a = a - b;

System.out.println("after swap a = " + a + " andb is = " + b);


}

Befor swap a = 10 andb is = 20


after swap a = 20 andb is = 10

Java Programs - Atul Yadav

You might also like