This is Prashanth, a Java and Selenium Expert, sharing the experience that has taken me a long way! Learn, Code, and practice here with me!<\/p>\n\n\n
![\"java](\"http:\/\/guviblogs.files.wordpress.com\/2014\/08\/java_logo-245132408_std1.png?w=300\"){kind=logo}
<\/a><\/figure><\/div>\n\n\n\n\nWhy refer to this list of ‘top 10 Java Programs for freshers’?<\/strong><\/h2>\n\n\n\nThis is a list of 10 Java coding interview questions and answers<\/a>. The below array of questions is a good place to get started and prepare before you appear for any Java Programming interviews.<\/p>\n\n\n\nFirst of all, I would like to tell you that Java Interview questions are mostly based on programming, logical analysis, and problem-solving skills. It is always better to get it right in the first place. Well, obviously you may be able to solve and find answers to these Java programming questions by yourself.<\/p>\n\n\n\n
However, if you find yourself stuck at some place and end up Googling it, then it becomes a larger challenge! This is to say that, in Google, you will find ‘n’ a number of alternative solutions to the same problem. However, knowing more than one way to solve any programming question or coding problem in Java is a factor that impresses the interviewer. However, most of the time it becomes overwhelming and too confusing to take.<\/p>\n\n\n\n![\"top](\"http:\/\/blog.guvi.in\/wp-content\/uploads\/2014\/08\/top-10-Java-programs-for-freshers-1024x819.jpg\")
So, I have specially curated a list of the top 10 Java programs. This list mainly contains basic programs asked in Interviews. Let’s get started!<\/span> <\/strong><\/figcaption><\/figure>\n\n\n\n\n\n\n\n1. Verify a number is Even\/Odd<\/a><\/strong><\/h3>\n\n\n\nThis is one of the most commonly asked coding questions. Find the easiest solution below.<\/p>\n\n\n\n
import java.util.Scanner;\n\npublic class EvenOdd{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter a number which you want to check whether that is even or odd\");\nint n = in.nextInt();\n\nif(n%2==0){\nSystem.out.println(n+\" is an even number.\");\n}else{\nSystem.out.println(n+\" is an odd number.\");\n\n}\n}\n}<\/mark>\n<\/pre>\n\n\n\nMatch Your Output here <\/strong><\/h4>\n\n\n\nEnter a number which you want to check whether that is even or odd\n 4\n 4 is an even number.<\/pre>\n\n\n\n2. Swapping Numbers without using the 3rd variable<\/a><\/strong><\/h3>\n\n\n\nimport java.util.Scanner;\n\npublic class Swapping{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter the 1st number: \");\nint x = in.nextInt();\nSystem.out.println(\"Enter the 2nd number: \");\nint y = in.nextInt();\n\nSystem.out.println(\"Initial value of x: \"+x+\" and y: \"+y);\n\nx = x+y;\ny = x-y;\nx = x-y;\n\nSystem.out.println(\"After swapping value of x: \"+x+\" and y: \"+y);\n}\n}<\/mark>\n<\/pre>\n\n\n\nOutput<\/strong><\/h4>\n\n\n\nEnter the 1st number:\n 43\n Enter the 2nd number:\n 56\n Initial value of x: 43 and y: 56\n After swapping value of x: 56 and y: 43\n<\/pre>\n\n\n\n3. Factorial of a number<\/a><\/strong><\/strong><\/h3>\n\n\n\nimport java.util.Scanner;\n\npublic class Factorial{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter the number whose factorial you want: \");\nint n = in.nextInt();\nint f =1;\nfor(int i=n; i>0; i--){\nf = f*i;\n}\nSystem.out.println(\"Factorial of \"+n+\" is \"+f);\n}\n}<\/mark>\n<\/pre>\n\n\n\nOutput<\/strong><\/h4>\n\n\n\nEnter the number whose factorial you want:\n6\nFactorial of 6 is 720\n<\/pre>\n\n\n[maxbutton id=”3″]<\/p>\n\n\n\n
4. How to get the prime numbers between a given range<\/a><\/strong><\/strong><\/h3>\n\n\n\npackage javaTutorial;\n\nimport java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class GetPrimeNumbers{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter a number from which you want prime number: \");\nint p1 = in.nextInt();\nSystem.out.println(\"Enter one more number till which you want prime number: \");\nint p2 = in.nextInt();\nArrayList<Integer> prime = new ArrayList<Integer>();\nint i=2;\nfor(int p=p1; p<=p2; p++){\ni=2;\nfor(; i<10; i++){\nif(p%i==0 && p!=i){<\/mark>\nbreak;\n}\n}\nif(i==10){\nprime.add(p);\n}\n}\nSystem.out.println(\"Prime numbers between \"+p1+\" and \"+p2+\" are: \");\nfor(int j=0; j<prime.size(); j++){\nSystem.out.print(prime.get(j).toString()+\", \");\n}\n}\n}<\/mark>\n<\/pre>\n\n\n\nOutput<\/strong><\/h4>\n\n\n\nEnter a number from which you want prime number:\n10\nEnter one more number till which you want prime number:\n30\nPrime numbers between 10 and 30 are:\n11, 13, 17, 19, 23, 29,\n<\/pre>\n\n\n\n5. Check a number is prime or not.<\/a><\/strong><\/h3>\n\n\n\nNote- A number is prime if it is not divisible by any other number except itself.<\/p>\n\n\n\n
import java.util.Scanner;\n\npublic class PrimeNumber{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter a number greater than 2 which you want to check whether that number is prime or not: \");\nint p = in.nextInt();\nint i=2;\nfor(; i<10; i++){\nif(p%i==0 && p!=i){\nSystem.out.println(\"Entered number \"+p+\" is not a prime number.\");\nbreak;\n}\n}\nif(i==10){\nSystem.out.println(\"Entered number \"+p+\" is a prime number.\");\n}\n}\n}\n<\/mark><\/pre>\n\n\n\nOutput<\/strong><\/h4>\n\n\n\nEnter a number greater than 2 which you want to check whether that number is prime or not:\n139\nEntered number 139 is a prime number.\n<\/pre>\n\n\n\n6. Check if a number is Armstrong or not.<\/a><\/strong><\/h3>\n\n\n\nNote- A number is Armstrong if the sum of the cubes of the digit of the number is equal to the number. ex- 407 = 4*4*4 + 0*0*0 + 7*7*7<\/p>\n\n\n\n
import java.util.Scanner;\n\npublic class ArmstrongNum{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter a number which you want to check whether that is armstrong or not: \");\nint n = in.nextInt();\nint a = n, r=0, s=0;\n\nwhile(a!=0){\nr = a%10;\na = a\/10;\ns = s + r*r*r;\n}\nif(s==n){\nSystem.out.println(\"Number \"+n+\" is an armstrong number.\");\n}else{\nSystem.out.println(\"Number \"+n+\" is not an armstrong number.\");\n}\n}\n}<\/mark>\n<\/pre>\n\n\n\nOutput<\/strong><\/h4>\n\n\n\nEnter a number which you want to check whether that is armstrong or not:\n407\nNumber 407 is an armstrong number.<\/pre>\n\n\n\n![\"armstrong](\"https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2023\/10\/image-8.png\")
<\/figure>\n\n\n\n7. Floyd Triangle<\/a><\/strong><\/h3>\n\n\n\nNote- Floyd Triangle is like 1 2 3 4 5 6 7 8 9 10 ———— Code-<\/p>\n\n\n\n
import java.util.Scanner;\n\npublic class FloydTriangle{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter the number of rows which you want in your Floyd Triangle: \");\nint r = in.nextInt();\nint n=0;\nfor(int i=0; i<r; i++){\nfor(int j=0; j<=i; j++){\nSystem.out.print(++n+\" \");\n}\nSystem.out.println();\n}\n}\n}<\/mark>\n<\/pre>\n\n\n\nOutput<\/strong><\/h4>\n\n\n\nEnter the number of rows which you want in your Floyd Triangle:\n5\n1\n2 3\n4 5 6\n7 8 9 10\n11 12 13 14 15\n![\"floyds](\"https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2014\/08\/Untitled.png\")
\n<\/pre>\n\n\n\n8. Palindrome of String or reverse a String.<\/a><\/strong><\/h3>\n\n\n\nimport java.util.Scanner;\n\npublic class PalindromeString{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter the string which you want to check whether that is palindrome or not: \");\nString s = in.next();\nString r = \"\";\nfor(int i=s.length()-1; i>=0; i--){\nr = r+s.charAt(i);\n}\nSystem.out.println(\"Reverse of entered string \"+s+\" is \"+r);\nif(r.equals(s)){\nSystem.out.println(\"String \"+s+\" is palindrome.\");\n}else{\nSystem.out.println(\"String \"+s+\" is not palindrome.\");\n}\n}\n}\n<\/mark><\/pre>\n\n\n\nOutput<\/strong><\/h4>\n\n\n\nEnter the string which you want to check whether that is palindrome or not:\nselenium\nReverse of entered string selenium is muineles\nString selenium is not palindrome.\n<\/pre>\n\n\n\n9. Binary Search<\/a><\/strong><\/h3>\n\n\n\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class BinarySearch{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter the size of the array which should be greater than zero else it will throw InputMismatchException : \");\nint size = in.nextInt();\nint[] array = new int[size];\nSystem.out.println(\"Enter the elements of the array: \");\nfor(int i=0; i<size; i++){\narray[i] = in.nextInt();\n}\nSystem.out.println(\"Enter the search element: \");\nint s = in.nextInt();<\/mark>\n\nArrays.sort(array); \/\/binary search will work on sorted array only so sort first\nint first, last, middle;\nfirst=0;\nlast = size-1;\nmiddle = (first+last)\/2;\nint i=0;\nfor(; i<size; i++){\nif(s>array[middle]){\nfirst = middle+1;\n}else if(s<array[middle]){\nlast = middle-1;\n}else{\nprintArray(array);\nSystem.out.println(\"Element \"+s+\" found in the array.\");\nbreak;\n}\nmiddle= (first+last)\/2;\n}\nif(i==size){\nprintArray(array);\nSystem.out.println(\"Element \"+s+\" is not found in the array\");\n}\n}\npublic static void printArray(int[] a){\nSystem.out.println(\"Array of elements: \");\nSystem.out.print(\"{\");\nfor(int i:a){\nSystem.out.print(i+\",\");\n}\nSystem.out.println(\"}\");\n}\n}<\/mark>\n<\/pre>\n\n\n\n10. Bubble Sort – last but not least in the list of top 10 Java Programs for freshers<\/a><\/strong><\/h3>\n\n\n\npackage SeleniumMakeItEasy;\n\nimport org.apache.commons.lang3.ArrayUtils;\n\npublic class BubbleSort{\npublic static void main(String[] args){\nint[] a = {2,3,2,5,3,3,6,1,2,5};\nint l = a.length;\n\nfor(int i=0;i<l; i++){\n\nfor(int j=0; j<l-1; j++){\nif(a[j]>a[j+1]){\na[j] = a[j] + a[j+1];\na[j+1] = a[j] - a[j+1];\na[j] = a[j] - a[j+1];\n}else if(a[j]==a[j+1]){\na = ArrayUtils.remove(a,j);\nl = a.length;\n}\n}\n}\nfor(int s: a){\nSystem.out.println(s);\n}<\/mark>\n\n}\n}\n[maxbutton id=\"3\"]<\/mark><\/pre>\n\n\n\nCheck out our Project Ideas – Here<\/a><\/strong><\/p>\n\n\n\n
First of all, I would like to tell you that Java Interview questions are mostly based on programming, logical analysis, and problem-solving skills. It is always better to get it right in the first place. Well, obviously you may be able to solve and find answers to these Java programming questions by yourself.<\/p>\n\n\n\n
However, if you find yourself stuck at some place and end up Googling it, then it becomes a larger challenge! This is to say that, in Google, you will find ‘n’ a number of alternative solutions to the same problem. However, knowing more than one way to solve any programming question or coding problem in Java is a factor that impresses the interviewer. However, most of the time it becomes overwhelming and too confusing to take.<\/p>\n\n\n\n This is one of the most commonly asked coding questions. Find the easiest solution below.<\/p>\n\n\n\n [maxbutton id=”3″]<\/p>\n\n\n\n Note- A number is prime if it is not divisible by any other number except itself.<\/p>\n\n\n\n Note- A number is Armstrong if the sum of the cubes of the digit of the number is equal to the number. ex- 407 = 4*4*4 + 0*0*0 + 7*7*7<\/p>\n\n\n\n Note- Floyd Triangle is like 1 2 3 4 5 6 7 8 9 10 ———— Code-<\/p>\n\n\n\n Check out our Project Ideas – Here<\/a><\/strong><\/p>\n\n\n\n1. Verify a number is Even\/Odd<\/a><\/strong><\/h3>\n\n\n\n
import java.util.Scanner;\n\npublic class EvenOdd{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter a number which you want to check whether that is even or odd\");\nint n = in.nextInt();\n\nif(n%2==0){\nSystem.out.println(n+\" is an even number.\");\n}else{\nSystem.out.println(n+\" is an odd number.\");\n\n}\n}\n}<\/mark>\n<\/pre>\n\n\n\nMatch Your Output here <\/strong><\/h4>\n\n\n\n
Enter a number which you want to check whether that is even or odd\n 4\n 4 is an even number.<\/pre>\n\n\n\n
2. Swapping Numbers without using the 3rd variable<\/a><\/strong><\/h3>\n\n\n\n
import java.util.Scanner;\n\npublic class Swapping{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter the 1st number: \");\nint x = in.nextInt();\nSystem.out.println(\"Enter the 2nd number: \");\nint y = in.nextInt();\n\nSystem.out.println(\"Initial value of x: \"+x+\" and y: \"+y);\n\nx = x+y;\ny = x-y;\nx = x-y;\n\nSystem.out.println(\"After swapping value of x: \"+x+\" and y: \"+y);\n}\n}<\/mark>\n<\/pre>\n\n\n\nOutput<\/strong><\/h4>\n\n\n\n
Enter the 1st number:\n 43\n Enter the 2nd number:\n 56\n Initial value of x: 43 and y: 56\n After swapping value of x: 56 and y: 43\n<\/pre>\n\n\n\n
3. Factorial of a number<\/a><\/strong><\/strong><\/h3>\n\n\n\n
import java.util.Scanner;\n\npublic class Factorial{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter the number whose factorial you want: \");\nint n = in.nextInt();\nint f =1;\nfor(int i=n; i>0; i--){\nf = f*i;\n}\nSystem.out.println(\"Factorial of \"+n+\" is \"+f);\n}\n}<\/mark>\n<\/pre>\n\n\n\nOutput<\/strong><\/h4>\n\n\n\n
Enter the number whose factorial you want:\n6\nFactorial of 6 is 720\n<\/pre>\n\n\n
4. How to get the prime numbers between a given range<\/a><\/strong><\/strong><\/h3>\n\n\n\n
package javaTutorial;\n\nimport java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class GetPrimeNumbers{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter a number from which you want prime number: \");\nint p1 = in.nextInt();\nSystem.out.println(\"Enter one more number till which you want prime number: \");\nint p2 = in.nextInt();\nArrayList<Integer> prime = new ArrayList<Integer>();\nint i=2;\nfor(int p=p1; p<=p2; p++){\ni=2;\nfor(; i<10; i++){\nif(p%i==0 && p!=i){<\/mark>\nbreak;\n}\n}\nif(i==10){\nprime.add(p);\n}\n}\nSystem.out.println(\"Prime numbers between \"+p1+\" and \"+p2+\" are: \");\nfor(int j=0; j<prime.size(); j++){\nSystem.out.print(prime.get(j).toString()+\", \");\n}\n}\n}<\/mark>\n<\/pre>\n\n\n\nOutput<\/strong><\/h4>\n\n\n\n
Enter a number from which you want prime number:\n10\nEnter one more number till which you want prime number:\n30\nPrime numbers between 10 and 30 are:\n11, 13, 17, 19, 23, 29,\n<\/pre>\n\n\n\n
5. Check a number is prime or not.<\/a><\/strong><\/h3>\n\n\n\n
import java.util.Scanner;\n\npublic class PrimeNumber{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter a number greater than 2 which you want to check whether that number is prime or not: \");\nint p = in.nextInt();\nint i=2;\nfor(; i<10; i++){\nif(p%i==0 && p!=i){\nSystem.out.println(\"Entered number \"+p+\" is not a prime number.\");\nbreak;\n}\n}\nif(i==10){\nSystem.out.println(\"Entered number \"+p+\" is a prime number.\");\n}\n}\n}\n<\/mark><\/pre>\n\n\n\nOutput<\/strong><\/h4>\n\n\n\n
Enter a number greater than 2 which you want to check whether that number is prime or not:\n139\nEntered number 139 is a prime number.\n<\/pre>\n\n\n\n
6. Check if a number is Armstrong or not.<\/a><\/strong><\/h3>\n\n\n\n
import java.util.Scanner;\n\npublic class ArmstrongNum{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter a number which you want to check whether that is armstrong or not: \");\nint n = in.nextInt();\nint a = n, r=0, s=0;\n\nwhile(a!=0){\nr = a%10;\na = a\/10;\ns = s + r*r*r;\n}\nif(s==n){\nSystem.out.println(\"Number \"+n+\" is an armstrong number.\");\n}else{\nSystem.out.println(\"Number \"+n+\" is not an armstrong number.\");\n}\n}\n}<\/mark>\n<\/pre>\n\n\n\nOutput<\/strong><\/h4>\n\n\n\n
Enter a number which you want to check whether that is armstrong or not:\n407\nNumber 407 is an armstrong number.<\/pre>\n\n\n\n
<\/figure>\n\n\n\n7. Floyd Triangle<\/a><\/strong><\/h3>\n\n\n\n
import java.util.Scanner;\n\npublic class FloydTriangle{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter the number of rows which you want in your Floyd Triangle: \");\nint r = in.nextInt();\nint n=0;\nfor(int i=0; i<r; i++){\nfor(int j=0; j<=i; j++){\nSystem.out.print(++n+\" \");\n}\nSystem.out.println();\n}\n}\n}<\/mark>\n<\/pre>\n\n\n\nOutput<\/strong><\/h4>\n\n\n\n
Enter the number of rows which you want in your Floyd Triangle:\n5\n1\n2 3\n4 5 6\n7 8 9 10\n11 12 13 14 15\n
\n<\/pre>\n\n\n\n8. Palindrome of String or reverse a String.<\/a><\/strong><\/h3>\n\n\n\n
import java.util.Scanner;\n\npublic class PalindromeString{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter the string which you want to check whether that is palindrome or not: \");\nString s = in.next();\nString r = \"\";\nfor(int i=s.length()-1; i>=0; i--){\nr = r+s.charAt(i);\n}\nSystem.out.println(\"Reverse of entered string \"+s+\" is \"+r);\nif(r.equals(s)){\nSystem.out.println(\"String \"+s+\" is palindrome.\");\n}else{\nSystem.out.println(\"String \"+s+\" is not palindrome.\");\n}\n}\n}\n<\/mark><\/pre>\n\n\n\nOutput<\/strong><\/h4>\n\n\n\n
Enter the string which you want to check whether that is palindrome or not:\nselenium\nReverse of entered string selenium is muineles\nString selenium is not palindrome.\n<\/pre>\n\n\n\n
9. Binary Search<\/a><\/strong><\/h3>\n\n\n\n
import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class BinarySearch{\npublic static void main(String[] args){\nScanner in = new Scanner(System.in);\nSystem.out.println(\"Enter the size of the array which should be greater than zero else it will throw InputMismatchException : \");\nint size = in.nextInt();\nint[] array = new int[size];\nSystem.out.println(\"Enter the elements of the array: \");\nfor(int i=0; i<size; i++){\narray[i] = in.nextInt();\n}\nSystem.out.println(\"Enter the search element: \");\nint s = in.nextInt();<\/mark>\n\nArrays.sort(array); \/\/binary search will work on sorted array only so sort first\nint first, last, middle;\nfirst=0;\nlast = size-1;\nmiddle = (first+last)\/2;\nint i=0;\nfor(; i<size; i++){\nif(s>array[middle]){\nfirst = middle+1;\n}else if(s<array[middle]){\nlast = middle-1;\n}else{\nprintArray(array);\nSystem.out.println(\"Element \"+s+\" found in the array.\");\nbreak;\n}\nmiddle= (first+last)\/2;\n}\nif(i==size){\nprintArray(array);\nSystem.out.println(\"Element \"+s+\" is not found in the array\");\n}\n}\npublic static void printArray(int[] a){\nSystem.out.println(\"Array of elements: \");\nSystem.out.print(\"{\");\nfor(int i:a){\nSystem.out.print(i+\",\");\n}\nSystem.out.println(\"}\");\n}\n}<\/mark>\n<\/pre>\n\n\n\n10. Bubble Sort – last but not least in the list of top 10 Java Programs for freshers<\/a><\/strong><\/h3>\n\n\n\n
package SeleniumMakeItEasy;\n\nimport org.apache.commons.lang3.ArrayUtils;\n\npublic class BubbleSort{\npublic static void main(String[] args){\nint[] a = {2,3,2,5,3,3,6,1,2,5};\nint l = a.length;\n\nfor(int i=0;i<l; i++){\n\nfor(int j=0; j<l-1; j++){\nif(a[j]>a[j+1]){\na[j] = a[j] + a[j+1];\na[j+1] = a[j] - a[j+1];\na[j] = a[j] - a[j+1];\n}else if(a[j]==a[j+1]){\na = ArrayUtils.remove(a,j);\nl = a.length;\n}\n}\n}\nfor(int s: a){\nSystem.out.println(s);\n}<\/mark>\n\n}\n}\n[maxbutton id=\"3\"]<\/mark><\/pre>\n\n\n\n