0% found this document useful (0 votes)
25 views13 pages

Java String Manipulation Exercises

The document contains multiple Java class assignments focused on string manipulation, array processing, and object-oriented programming. Each assignment includes methods for tasks such as removing whitespace, checking for palindromes, finding leap years, and calculating grades. The main method in each class demonstrates the functionality of the implemented methods.

Uploaded by

rohaneha1502
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)
25 views13 pages

Java String Manipulation Exercises

The document contains multiple Java class assignments focused on string manipulation, array processing, and object-oriented programming. Each assignment includes methods for tasks such as removing whitespace, checking for palindromes, finding leap years, and calculating grades. The main method in each class demonstrates the functionality of the implemented methods.

Uploaded by

rohaneha1502
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

String

Exercise-1
class Tester{

public static String removeWhiteSpaces(String str){

str=[Link](" ","");

return str;

public static void main(String args[]){

String str = "Hello How are you ";

str = removeWhiteSpaces(str);

[Link](str);

} }

Assignment No-1
class Tester{

public static String moveSpecialCharacters(String str){

String str1=new String();

String str2=new String();

for(int i=0;i<[Link]();i++)

if([Link](i)>='a' && [Link](i)<='z' || [Link](i)>='A' && [Link](i)<='Z')

str1=str1+[Link](i);

else

str2=str2+[Link](i);

return str1+str2;

public static void main(String args[]){

String str = "He@#$llo!*&";

[Link](moveSpecialCharacters(str));

} }
Assignment-2
class Tester{

public static boolean checkPalindrome(String str){

//Implement your code here and change the return value accordingly

String str1=new String();

for(int i=[Link]()-1;i>=0;i--)

str1=str1+[Link](i);

if([Link](str))

return true;

else

return false;

public static void main(String args[]){

String str = "radar";

if(checkPalindrome(str))

[Link]("The string is a palindrome!");

else

[Link]("The string is not a palindrome!");

}
Assignment-3
class Tester {

String str1=new String();

public static String reverseEachWord(String str){

String str3=new String();

//Implement your code here and change the return value accordingly

String[] word=[Link](" ");

for(int i=0;i<[Link];i++)

String str1=word[i];

String str2="";

for(int j=[Link]()-1;j>=0;j--)

str2=str2+[Link](j);

str3=str3 + str2+" ";

//return str3;

return [Link](0,([Link]()-1));

public static void main(String args[]){

String str = "all cows eat grass";

[Link](reverseEachWord(str));

}
Assignment-4
class Tester {

public static int findHighestOccurrence(String str){

int[] count=new int[[Link]()];

int max=0;

for(int i=0; i<[Link]();i++)

for(int j=0;j<=[Link]()-1;j++)

if([Link](i)==[Link](j))

count[i]++;

for(int k=0;k<=[Link]-1;k++)

if(max<count[k])

max=count[k];

return max;

public static void main(String args[]){

String str = "success";


[Link](findHighestOccurrence(str));

Assignment-5
class Tester{

public static String removeDuplicatesandSpaces(String str){

//Implement your code here and change the return value accordingly

str=[Link](" ","");

char[] str1=[Link]();

char[] str2=new char[[Link]];

int j,k=0;

for(int i=0;i<[Link];i++)

for( j=0;j<i;j++)

if(str1[i]==str1[j])

break;

if(j==i)

str2[k++]=str1[i];

str=[Link](str2);

str=[Link]();

return str;

public static void main(String args[]){

String str = "object oriented programming";

[Link](removeDuplicatesandSpaces(str));

}
ARRAY
Assignment-2
class Tester {

public static double[] findDetails(double[] salary) {

//Implement your code here and change the return value accordingly

double[] details=new double[3];

for(int i=0;i<[Link];i++)

details[0]=details[0]+salary[i];

details[0]=details[0]/[Link];

for(int j=0;j<[Link];j++)

if(salary[j]>details[0])

details[1]++;

else if(salary[j]<details[0])

details[2]++;

return details;

public static void main(String[] args) {

double[] salary = { 23500.0, 25080.0, 28760.0, 22340.0, 19890.0 };

double[] details = findDetails(salary);

[Link]("Average salary: "+ details[0]);

[Link]("Number of salaries greater than the average salary: "+ details[1]);

[Link]("Number of salaries lesser than the average salary: "+ details[2]);

}
Assignment-3
class Tester {

public static int[] findLeapYears(int year) {

// Implement your code here and change the return value accordingly

int[] leapYear=new int[15];

int i=0;

while(i<15)

if(year%4==0 && (year%100!=0 ||year%400==0))

leapYear[i]=year;

i++;

year++;

return leapYear;

public static void main(String[] args) {

int year = 2000;

int[] leapYears;

leapYears=findLeapYears(year);

for ( int index = 0; index<[Link]; index++ ) {

[Link](leapYears[index]);

}
Assignment-4
class Student{

//Implement your code here

private int[] marks;

private char[] grade;

public Student(int[] marks)

[Link]=marks;

public int[] getMarks() {

return marks;

public void setMarks(int[] marks) {

[Link] = marks;

public char[] getGrade() {

return grade;

public void setGrade(char[] grade) {

[Link] = grade;

public void findGrade() {

[Link] =new char[[Link]];

for(int i=0;i<[Link];i++)

if([Link][i]>=92)

[Link][i]='E';

else if([Link][i]>=85 && [Link][i]<92)

[Link][i]='A';
else if([Link][i]>=70 && [Link][i]<85)

[Link][i]='B';

else if([Link][i]>=65 && [Link][i]<70)

[Link][i]='C';

else if([Link][i]<65)

[Link][i]='D';

class Tester{

public static void main(String[] args) {

int[] marks = { 79, 87, 97, 65, 78, 99, 66 };

Student student = new Student(marks);

[Link]();

[Link]("Grades corresponding to the marks are : ");

char[] grades = [Link]();

for (int index = 0; index < [Link]; index++) {

[Link](grades[index] + " ");

}
Assignment-5
class Tester {

public static int[] findNumbers(int num1, int num2) {

int[] numbers = new int[6];

int j=0;

if(num1<num2)

for(int i=num1;i<=num2;i++)

if(i%5==0)

int dummy=i;

int sum=0;

while(dummy!=0)

int rem=dummy%10;

dummy=dummy/10;

sum=sum+rem;

if(sum%3==0 && i<100 && i>0)

if(j<[Link])

numbers[j]=i;

j++;

} } } }

return numbers;

public static void main(String[] args) {

int num1 = 100;

int num2 = 300;

int[] numbers = findNumbers(num1, num2);

if (numbers[0] == 0) {

[Link]("There is no such number!");


} else {

for (int index = 0; index <= [Link] - 1; index++) {

if (numbers[index] == 0) {

break;

[Link](numbers[index]);

} } }

Assignment-6

class Tester {

public static int findTotalCount(int[] numbers) {

//Implement your code here and change the return value accordingly

int count=0;

for(int i=0,j=1;j<[Link];i++,j++)

if(numbers[i]==numbers[j])

count++;

return count;

public static void main(String[] args) {

int[] numbers = { 1, 1, 5, 100, -20, -20,6, 0, 0 };

[Link]("Count of adjacent occurrence: "+findTotalCount(numbers));

}
Assignment-7

class Tester{

public static String[] findPermutations(String str){

//Implement your code here and change the return value accordingly

char[] character=[Link]();

String s1,s2,s3,s4,s5,s6;

if(character[0]==character[1] && character[1]==character[2])

s1=character[0] +""+ character[1] + ""+character[2];

s2=null;

s3=null;

s4=null;

s5=null;

s6=null;

else if(character[0]==character[1] || character[0]==character[2] ||


character[1]==character[2])

s1=character[0] +""+ character[1] + ""+character[2];

s2=character[2] +""+ character[0]+ ""+character[1];

s3=character[1] +""+ character[2] + ""+character[0];

s4=null;

s5=null;

s6=null;

else

s1 = character[0] +""+ character[1] + ""+character[2];

s2 = character[0] +""+ character[2] + ""+character[1];

s3 = character[1] +""+ character[0] + ""+character[2];


s4 = character[1] +""+ character[2] + ""+character[0];

s5 = character[2] +""+ character[0] + ""+character[1];

s6 = character[2] +""+ character[1] + ""+character[0];

String[] s= {s1,s2,s3,s4,s5,s6};

return s;

public static void main(String args[]){

String str = "EYE";

String permutations[] = findPermutations(str);

for(String permutation: permutations){

if (permutation!=null)

[Link](permutation);

You might also like