Scribd
Upload
4 views3 pages

Tap Academy Top10 Java Coding Programs

The document outlines ten Java coding programs, each demonstrating a specific algorithm or functionality. Programs include reversing a string, checking for palindromes, determining prime numbers, generating Fibonacci sequences, calculating factorials, finding the largest and second largest elements in an array, removing duplicates, performing linear search, and implementing bubble sort. Each program is presented with its respective code and a brief description of its purpose.

Uploaded by

1ep22cs022.dharshini
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
4 views3 pages

Tap Academy Top10 Java Coding Programs

The document outlines ten Java coding programs, each demonstrating a specific algorithm or functionality. Programs include reversing a string, checking for palindromes, determining prime numbers, generating Fibonacci sequences, calculating factorials, finding the largest and second largest elements in an array, removing duplicates, performing linear search, and implementing bubble sort. Each program is presented with its respective code and a brief description of its purpose.

Uploaded by

1ep22cs022.dharshini
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

Tap Academy Style - Top 10 Java Coding Programs

1. Reverse String
import [Link];

public class Main {

public static void reverseString(String str){

String rev="";

for(int i=[Link]()-1;i>=0;i--){
rev=rev+[Link](i);
}

[Link](rev);
}

public static void main(String[] args){


Scanner sc=new Scanner([Link]);
String str=[Link]();
reverseString(str);
}
}

2. Palindrome
import [Link];

public class Main {

public static void palindrome(String str){


String rev="";
for(int i=[Link]()-1;i>=0;i--){
rev=rev+[Link](i);
}
if([Link](rev))
[Link]("Palindrome");
else
[Link]("Not Palindrome");
}

public static void main(String[] args){


Scanner sc=new Scanner([Link]);
String str=[Link]();
palindrome(str);
}
}

3. Prime Number
public static void prime(int n){
int count=0;
for(int i=1;i<=n;i++)
if(n%i==0) count++;
if(count==2) [Link]("Prime");
else [Link]("Not Prime");
}

4. Fibonacci
public static void fibonacci(int n){
int a=0,b=1;
[Link](a+" "+b+" ");
for(int i=3;i<=n;i++){
int c=a+b;
[Link](c+" ");
a=b;
b=c;
}
}
5. Factorial
public static void factorial(int n){
int fact=1;
for(int i=1;i<=n;i++)
fact*=i;
[Link](fact);
}

6. Largest Element
public static void largest(int arr[]){
int max=arr[0];
for(int i=1;i<[Link];i++)
if(arr[i]>max) max=arr[i];
[Link](max);
}

7. Second Largest
public static void secondLargest(int arr[]){
int largest=Integer.MIN_VALUE;
int second=Integer.MIN_VALUE;
for(int i=0;i<[Link];i++){
if(arr[i]>largest){
second=largest;
largest=arr[i];
}else if(arr[i]>second && arr[i]!=largest){
second=arr[i];
}
}
[Link](second);
}

8. Remove Duplicates
public static void removeDuplicate(int arr[]){
for(int i=0;i<[Link];i++){
boolean duplicate=false;
for(int j=0;j<i;j++){
if(arr[i]==arr[j]){
duplicate=true;
break;
}
}
if(!duplicate)
[Link](arr[i]+" ");
}
}

9. Linear Search
public static void linearSearch(int arr[],int key){
for(int i=0;i<[Link];i++){
if(arr[i]==key){
[Link]("Found at Index "+i);
return;
}
}
[Link]("Not Found");
}

10. Bubble Sort


public static void bubbleSort(int arr[]){
for(int i=0;i<[Link]-1;i++){
for(int j=0;j<[Link]-1-i;j++){
if(arr[j]>arr[j+1]){
int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
for(int i=0;i<[Link];i++)
[Link](arr[i]+" ");
}

You might also like