These questions will be answnered under Java language. 1. How to sort an array o
ID: 3602452 • Letter: T
Question
These questions will be answnered under Java language.
1. How to sort an array of integer or strings or chars.
2. Find out prime numbers.
3. How to print patterns like
*
**
***
****
4. Calculate Circle Area using Java Example
5. Calculate Circle Perimeter using Java Example
6. Calculate Rectangle Area using Java Example
7. Calculate Rectangle Perimeter using Java Example
8. Even Odd Number Example
9. Find Largest and Smallest Number in an Array Example
10. Java Factorial Example
11. Java Factorial Using Recursion Example
12. Reverse Number using Java
13. Swap Numbers Java Example
14. Swap Numbers Without Using Third Variable Java Example
15. How to correctly identify if the string is Email or Not(Regex)
16. Write a java program to prove that strings are immutable in java?
17. How do you find first repeated and non-repeated character in the given string in java?
18. Fibbonacci
19. Given String is Palindrome or not
20. How to print first non repeated character in the String?
Explanation / Answer
Ans1: Sorting a string
import java.util.*;
import java.lang.*;
import java.io.*;
class sorting
{
public static void main (String[] args) throws java.lang.Exception
{
String original = "edcba";
int j=0;
char temp=0;
char[] chars = original.toCharArray();
for (int i = 0; i <chars.length; i++) {
for ( j = 0; j < chars.length; j++) {
if(chars[j]>chars[i]){
temp=chars[i];
chars[i]=chars[j];
chars[j]=temp;
}
}
}
for(int k=0;k<chars.length;k++){
System.out.println(chars[k]);
}
}
}
Ans2: import java.util.*;
import java.lang.*;
import java.io.*;
class Prime
{
public static void main (String[] args) throws java.lang.Exception
{
int s1, s2, s3, flag = 0, i, j;
Scanner s = new Scanner(System.in);
System.out.println ("Enter the lower limit :");
s1 = s.nextInt();
System.out.println ("Enter the upper limit :");
s2 = s.nextInt();
System.out.println ("The prime numbers in between the entered limits are :");
for(i = s1; i <= s2; i++)
{
for( j = 2; j < i; j++)
{
if(i % j == 0)
{
flag = 0;
break;
}
else
{
flag = 1;
}
}
if(flag == 1)
{
System.out.println(i);
}
}
}
}
Ans3.
import java.util.*;
import java.lang.*;
import java.io.*;
class Star
{
public static void main (String[] args) throws java.lang.Exception
{
int i,j;
for(i=1; i<=6; i++)
{
for(j=1; j<i; j++)
{
System.out.print("*");
}
System.out.println();
}
}
}
Ans4.
import java.util.*;
import java.lang.*;
import java.io.*;
class Circle_Area
{
public static void main(String[] args)
{
int r;
double pi = 3.14, area;
Scanner s = new Scanner(System.in);
System.out.print("Enter radius of circle:");
r = s.nextInt();
area = pi * r * r;
System.out.println("Area of circle:"+area);
}
}
Ans5.
import java.util.*;
import java.lang.*;
import java.io.*;
class Perimeter_circle
{
public static void main(String[] args)
{
int r;
double pi = 3.14,perimeter;
Scanner s = new Scanner(System.in);
System.out.print("Enter radius of circle:");
r = s.nextInt();
perimeter = 2 * pi * r;
System.out.println("Perimeter of circle:"+perimeter);
}
}
Ans 6.
import java.util.*;
import java.lang.*;
import java.io.*;
class Rectangle
{
public static void main(String[] args)
{
int l,b,area;
Scanner s = new Scanner(System.in);
System.out.print("Enter Length of rectangle:");
l = s.nextInt();
System.out.print("Enter breadth of rectangle:");
b = s.nextInt();
area = l*b;
System.out.println("Area of rectangle :"+area);
}
}
Ans7.
import java.util.*;
import java.lang.*;
import java.io.*;
class Perimeter_rectangle
{
public static void main(String[] args)
{
System.out.print("Enter length of rectangle:");
l = s.nextInt();
System.out.print("Enter breadth of rectangle:");
b = s.nextInt();
perimeter = 2 * (l + b);
System.out.println("Perimeter of rectangle:"+perimeter);
}
}
Ans8.
Ans 9.
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;
class LargestSmallest
{
public static void main(String[] args)
{
int a[] = new int[] { 23, 34, 13, 64, 72, 90, 10, 15, 9, 27 };
int min = a[0]; // assume first elements as smallest number
int max = a[0]; // assume first elements as largest number
for (int i = 1; i < a.length; i++)
{
if (a[i] > max)
{
max = a[i];
}
if (a[i] < min)
{
min = a[i];
}
}
System.out.println("Largest Number in a given array is : " + max);
System.out.println("Smallest Number in a given array is : " + min);
}
}
Ans10. import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;
class FactorialExample2{
public static void main(String args[]){
int i,fact=1,number;
Scanner s=new Scanner(System.in);
number =s.nextInt();
for(i=1;i<=number;i++){
fact=fact*i;
}
System.out.println("Factorial of "+number+" is: "+fact);
}
}
Ans 11.
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;
class FactorialExample2{
static int factorial(int n){
if (n == 0)
return 1;
else
return(n * factorial(n-1));
}
public static void main(String args[]){
int i,fact=1,number;
Scanner s=new Scanner(System.in);
number =s.nextInt();
fact = factorial(number);
System.out.println("Factorial of "+number+" is: "+fact);
}
}
Ans12.
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;
class FactorialExample2{
public static void main(String args[]){
int i,fact=1,num,reversed=0;
Scanner s=new Scanner(System.in);
num =s.nextInt();
while(num != 0) {
int digit = num % 10;
reversed = reversed * 10 + digit;
num /= 10;
}
System.out.println("Reversed Number: " + reversed);
}
}
Ans13.
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;
class FactorialExample2{
public static void main(String args[]){
int x, y, temp;
System.out.println("Enter x and y");
Scanner in = new Scanner(System.in);
x = in.nextInt();
y = in.nextInt();
System.out.println("Before Swapping x = "+x+" y = "+y);
temp = x;
x = y;
y = temp;
System.out.println("After Swapping x = "+x+" y = "+y);
}
}
Ans14.
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;
class FactorialExample2{
public static void main(String args[]){
int x, y, temp;
System.out.println("Enter x and y");
Scanner in = new Scanner(System.in);
x = in.nextInt();
y = in.nextInt();
System.out.println("Before swapping:");
System.out.println("x value: "+x);
System.out.println("y value: "+y);
x = x+y;
y=x-y;
x=x-y;
System.out.println("After swapping:");
System.out.println("x value: "+x);
System.out.println("y value: "+y);
}
}
Ans15.
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;
class EmailValidation {
public static void main(String[] args)
{
Scanner input= new Scanner(System.in);
String email;
int count=0;
int countP=0;
System.out.println("Enter the email address");
email = input.next();
for(int i = 0; i<email.length();i++)
{
if(email.charAt(i)=='@')
count++;
}
if (count==1)
{
int index = email.indexOf('@');
String temp = email.substring(index);
for(int i = 0; i<temp.length();i++)
{
if(temp.charAt(i)=='.')
countP++;
}
if(countP>0)
{
System.out.println("Valid");
}
else
{
System.out.println("Invalid");
}
}
}
}
Ans16.
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;
class EmailValidation {
public static void main(String[] args)
{
Scanner s= new Scanner(System.in);
String s1 = "JAVA";
String s2 = "JAVA";
System.out.println(s1 == s2); //Output : true
s1 = s1 + "J2EE";
System.out.println(s1 == s2); //Output : false
}
}
Ans17. import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.HashMap;
import java.util.Scanner;
class repeated_Nonrepeated
{
static void firstRepeatedNonRepeatedChar(String inputString)
{
HashMap<Character, Integer> charCountMap = new HashMap<Character, Integer>();
char[] strArray = inputString.toCharArray();
for (char c : strArray)
{
if(charCountMap.containsKey(c))
{
charCountMap.put(c, charCountMap.get(c)+1);
}
else
{
charCountMap.put(c, 1);
}
}
for (char c : strArray)
{
if (charCountMap.get(c) == 1)
{
System.out.println("First Non-Repeated Character In '"+inputString+"' is '"+c+"'");
break;
}
}
for (char c : strArray)
{
if (charCountMap.get(c) > 1)
{
System.out.println("First Repeated Character In '"+inputString+"' is '"+c+"'");
break;
}
}
}
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter the string :");
String input = sc.next();
firstRepeatedNonRepeatedChar(input);
}
}
Ans18.
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.HashMap;
import java.util.Scanner;
class Fibonacci
{
public static void main(String[] args)
{
int n, a = 0, b = 0, c = 1;
Scanner s = new Scanner(System.in);
System.out.print("Enter value of n:");
n = s.nextInt();
System.out.print("Fibonacci Series:");
for(int i = 1; i <= n; i++)
{
a = b;
b = c;
c = a + b;
System.out.print(a+" ");
}
}
}
Ans19.
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;
class ChkPalindrome
{
public static void main(String args[])
{
String str, rev = "";
Scanner sc = new Scanner(System.in);
System.out.println("Enter a string:");
str = sc.nextLine();
int length = str.length();
for ( int i = length - 1; i >= 0; i-- )
rev = rev + str.charAt(i);
if (str.equals(rev))
System.out.println(str+" is a palindrome");
else
System.out.println(str+" is not a palindrome");
}
}
Ans20.
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;
import java.util.LinkedHashMap;
import java.util.Map;
class NonRepeatedCharacter {
public static void main(String[] args) {
String s = "chegg.com";
Map<Character, Integer> map = new LinkedHashMap<Character, Integer>();
char c[] = s.toCharArray();
for (char ch : c) {
if (map.containsKey(ch)) {
int count = map.get(ch);
map.put(ch, count + 1);
} else {
map.put(ch, 1);
}
}
for (char ch : c) {
if (map.get(ch) == 1) {
System.out.println("First non repeated characted in the String is:"+ ch);
break;
}
}
}
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.