Scribd
Upload
7 views13 pages

Java Programs for String and Array Manipulations

The document contains multiple Java programs that perform various tasks such as finding the longest word in a sentence, checking for 'superspy' numbers, determining if a number is automorphic, sorting arrays, and generating patterns. Each program prompts the user for input and processes it accordingly, demonstrating fundamental programming concepts like loops, conditionals, and array manipulation. Overall, the document serves as a collection of coding exercises for practicing Java programming skills.

Uploaded by

r29110157
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views13 pages

Java Programs for String and Array Manipulations

The document contains multiple Java programs that perform various tasks such as finding the longest word in a sentence, checking for 'superspy' numbers, determining if a number is automorphic, sorting arrays, and generating patterns. Each program prompts the user for input and processes it accordingly, demonstrating fundamental programming concepts like loops, conditionals, and array manipulation. Overall, the document serves as a collection of coding exercises for practicing Java programming skills.

Uploaded by

r29110157
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

1.

import [Link].*;
class String{
public static void main( ) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the sentence:");
String s = [Link]();
s = s + " ";
String w = "", maxW = "";

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


char c = [Link](i);
if (c != ' ') {
w = w + c;
} else {
if ([Link]() > [Link]()) {
maxW = w;
}
w = "";
}
}

[Link]("Longest word: " + maxW);


}
}
2.
import [Link].*;

class Array {
public static void main( ) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the sentence:");
String s = [Link]();
s = s + " ";
String w = "", rev = "";

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


char c = [Link](i);
if (c != ' ') {
w = w + c;
rev = c + rev;
} else {
if ([Link](rev)) {
[Link](w);
}
w = "";
rev = "";
}
}
}
}
3.

import [Link].*;

class superspy {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the number");
int n = [Link]();
int c = 0;
int sum = 0;

while (n > 0) {
int r = n % 10;
sum = sum + r;
c++;
n = n / 10;
}

if (sum == c) {
[Link]("superspy");
} else {
[Link]("Not superspy");
}
}
}
4.

import [Link].*;

class automorphic{
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the number");
int n = [Link]();
int c = 0;
int t = n;

while (n > 0) {
int r = n % 10;

c++;
n = n / 10;
}
int d =(int)[Link](10,c);
int s = t*t;
int l = s%d;

if (l == t) {
[Link]("automorphic");
} else {
[Link]("Not automorphic");
}
}
}
5.

import [Link].*;

class superspy {
public static void main( ) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the number of elements:");
int n = [Link]();
int arr[] = new int[n]; [Link]("Enter the elements:");

for (int i = 0; i < n; i++) {


arr[i] = [Link]();
}

int f = 0;
for (int i = 0; i < n - 1; i++) {
if (arr[i] > arr[i + 1]) {
f = 1;
break;
}
}

if (f == 0) {
[Link]("The array is sorted in ascending order.");
} else {
[Link]("The array is not sorted in ascending order.");
}
}
}
6.
import [Link].*;

class binary {
public static void main( ) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the number of elements:");
int n = [Link]();
int arr[] = new int[n]; [Link]("Enter the elements:");

for (int i = 0; i < n; i++) {


arr[i] = [Link]();
}

[Link]("Enter the element to find:");


int k = [Link]();

int f = 0; // First index


int l = n - 1;
while (f <= l) {
int mid = (f + l) / 2;
if (arr[mid] == k) {
[Link]("Element found at index " + mid);

break;
} else if (arr[mid] > k) {
l = mid - 1;
} else {
f = mid + 1;
}
}

if (f > l) {
[Link]("Element not found");
}
}
}
7.
import [Link].*;

class Array {
public static void main( ) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the size of the array:");
int n = [Link]();
int arr[] = new int[n]; [Link]("Enter the elements:");

for (int i = 0; i < n; i++) {


arr[i] = [Link]();
}

[Link]("Enter the element to be searched:");


int k = [Link]();
int f = -1;

for (int i = 0; i < n; i++) {


if (arr[i] == k) {
f = i;
break; }
}

if (f == -1) {
[Link]("Element not found");
} else {
[Link]("Element found at index: " + f);
}
}
}
8.
import [Link].*;

class spattern {
public static void main( ) {
String s = "ICSE";
int n = [Link]();

for (int i = 1; i <= n; i++) { // Fixed condition: i <= n

for (int j = 1; j <= i; j++) {


[Link]([Link](i-1));
}
[Link]();
}
}
}
9.

import [Link].*;

class Pattern {
public static void main( ) {
Scanner sc = new Scanner([Link]);
[Link]("Enter 1 for pattern 1 and 2 for pattern 2");
int check = [Link]();

switch (check) {
case 1:
for (int i = 1; i <= 5; i++) {
for (int j = 1; j <= i; j++) {
[Link](j % 2);
}
[Link]();
}
break;

case 2:
for (int i = 1; i <= 5; i++) {
for (int j = 1; j <= i; j++) {
[Link]((char) (64 + j));
}
[Link]();
}
break;

default:
[Link]("Invalid choice");
break;
}

}
}

10..
import [Link].*;

class Array {
public static void main( ) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the number of elements:");
int n = [Link]();
int arr[] = new int[n];

[Link]("Enter the elements of the array:");

for (int i = 0; i < n; i++) {


arr[i] = [Link]();
}

for (int i = 0; i < n - 1; i++) {


for (int j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {

int t = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = t;
}
}
}

[Link]("The elements after sorting:");


for (int i = 0; i < n; i++) {
[Link](arr[i]);
}
}
}
11.

import [Link].*;

class string {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the sentence:");
String s = [Link](); // Use nextLine() to read the entire sentence
String res = " ";
s = " "+s;
int l = [Link](' ');
for(int i = 0; i<l; i++)
{
char c = [Link](i);
if(c == '.')
{
res = res+[Link](i+1) + ".";

}
}
res = res+[Link](l);
[Link]("result" +res);
}
}
12.

import [Link].*;

class Pattern {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter 1 for pattern 1 and 2 for pattern 2");
int check = [Link]();

switch (check) {
case 1:
for (int i = 1; i <= 5; i++) {
for (int j = i; j >= 1; j--) {
[Link](j);
}
[Link]();
}
break;

case 2:
for (int i = 1; i <= 5; i++) {
for (int j = 1; j <= i; j++) {
[Link](j%2);
}
[Link]();
}
break;

default:
[Link]("Invalid choice");
break;
}

}
}
13.
import [Link].*;

class Pattern {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter 1 for pattern 1 and 2 for pattern 2:");
int check = [Link]();

switch (check) {
case 1:
// Fibonacci Pattern
int a = 0, b = 1, c = 0;

for (int i = 1; i <= 10; i++) {


[Link](a + " ");
c = a + b;
a = b;
b = c;
}

// For a new line after the sequence


break;

case 2:
// Character Pattern
[Link]("Character Pattern:");
for (int i = 1; i <= 5; i++) {
for (int j = 1; j <= i; j++) {
[Link]((char) (64 + j));
}
[Link]();
}
break;

default:
[Link]("Invalid choice");
break;
}
}
}
14.

import [Link].*;

class StringCounter {
public static void main( ) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the sentence:");
String s = [Link]();
int l= 0, d = 0, sp = 0;

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


char c = [Link](i);
if ([Link](c)) l++;
} else if ([Link](c)) {
d++;
} else{
sp++;
}
}

[Link]("Number of letters: " + l);


[Link]("Number of digits: " + d);
[Link]("Number of special characters: " + sp);
}
}
15.

import [Link].*;
class spattern {
public static void main( ) {
String s = "BLUEJ";
int n = [Link]();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
[Link]([Link](j-1)); }
[Link]();
}
}

You might also like