From ee1a31b5e125d04afffb04017008018136cf34bc Mon Sep 17 00:00:00 2001 From: Aadit Agrawal Date: Sat, 10 Aug 2024 09:47:35 +0530 Subject: [PATCH] Upload files to "OOP/Java/Lab/Week3" --- OOP/Java/Lab/Week3/Armstrong.java | 28 +++++++++++++++++++++++++++ OOP/Java/Lab/Week3/ArraySearch.java | 23 ++++++++++++++++++++++ OOP/Java/Lab/Week3/LadderFor.java | 11 +++++++++++ OOP/Java/Lab/Week3/LadderForEach.java | 14 ++++++++++++++ OOP/Java/Lab/Week3/PrimeGen.java | 27 ++++++++++++++++++++++++++ 5 files changed, 103 insertions(+) create mode 100644 OOP/Java/Lab/Week3/Armstrong.java create mode 100644 OOP/Java/Lab/Week3/ArraySearch.java create mode 100644 OOP/Java/Lab/Week3/LadderFor.java create mode 100644 OOP/Java/Lab/Week3/LadderForEach.java create mode 100644 OOP/Java/Lab/Week3/PrimeGen.java diff --git a/OOP/Java/Lab/Week3/Armstrong.java b/OOP/Java/Lab/Week3/Armstrong.java new file mode 100644 index 0000000..0354ca9 --- /dev/null +++ b/OOP/Java/Lab/Week3/Armstrong.java @@ -0,0 +1,28 @@ +import java.util.Scanner; + +class Armstrong{ + public static void main(String args[]){ + Scanner sc = new Scanner(System.in); + + int a,b,digit; + int digisum=0; + + System.out.println("Enter the number you went to check for Armstrong-ness:"); + a = sc.nextInt(); + + b = a; + + while(b!=0){ + digit = b%10; + digisum += (digit*digit*digit); + b /= 10; + } + + if(digisum == a){ + System.out.println("The number is an armstrong number."); + }else{ + System.out.println("The number is not an armstrong number."); + } + + } +} \ No newline at end of file diff --git a/OOP/Java/Lab/Week3/ArraySearch.java b/OOP/Java/Lab/Week3/ArraySearch.java new file mode 100644 index 0000000..9b57821 --- /dev/null +++ b/OOP/Java/Lab/Week3/ArraySearch.java @@ -0,0 +1,23 @@ +import java.util.Scanner; +public class ArraySearch { + public static void main(String args[]){ + Scanner sc = new Scanner(System.in); + int flag=0; + + int[] array = {1,2,3,1,5,6,1,8,9}; + + System.out.println("Enter the search value:"); + int b = sc.nextInt(); + + System.out.println("The value is found at the locations: "); + for(int i=0;i<9;i++){ + if(array[i] == b){ + System.out.print(" a["+i+"]"); + flag++; + } + } + if(flag==0){ + System.out.print("None. The input value does not exist in the array."); + } + } +} diff --git a/OOP/Java/Lab/Week3/LadderFor.java b/OOP/Java/Lab/Week3/LadderFor.java new file mode 100644 index 0000000..74be932 --- /dev/null +++ b/OOP/Java/Lab/Week3/LadderFor.java @@ -0,0 +1,11 @@ +public class LadderFor { + public static void main(String args[]){ + for(int i = 1; i<=5 ; i++){ + for (int j = 0; j