Java Program

class arraydemo
{
static int i;
static int j;
static int k;
static int l;
static int max(int x[])
{
System.out.println("\n");
System.out.println("single dimention array:");
int max=x[0];
for(i=0;i<x.length;i++)
{
System.out.print("\t"+x[i]);
if(max<x[i])
max=x[i];
}
return(max);
}
static int min(int x[])
{
int min=x[0];
{
if(min>x[i])
min=x[i];
}
return(min);
}
static int max_d(int x[][])
{
int max=x[0][0];
System.out.println("double dimention array:");
{
for(j=0;j<x.length;j++)
{
if(max<x[i][j])
max=x[i][j];
System.out.print("\t"+x[i][j]);
}
System.out.println();
}
return(max);
}
static int min_d(int x[][])

{
int min=x[0][0];
{
{
if(min>x[i][j])
min=x[i][j];
}
}
return(min);
}
static void sortA(int x[])
{
for(i=0;i<x.length-1;i++)
{
for(j=0;j<x.length-1;j++)
{
if(x[j]>x[j+1])
{
int temp=x[j];
x[j]=x[j+1];
x[j+1]=temp;
}
}
}
System.out.println("sorted array in assending order:");
System.out.println(x[i]);
}
static void sortD(int x[])
{
for(i=0;i<x.length-1;i++)
{
for(j=0;j<x.length-1;j++)
{
if(x[j]<x[j+1])
{
int temp=x[j];
x[j]=x[j+1];
x[j+1]=temp;
}
}
}
System.out.println("sorted array in dissending:");
System.out.println(x[i]);
}
static void sort2A(int x[][])
{
int temp;
int first=0;
{
int loc=0;
temp=x[i][first];
{
if(temp>x[i][j])
{
temp=x[i][j];
loc=j;
}
}
x[i][loc]=x[i][first];
x[i][first]=temp;
// first++;
}
{
{
System.out.print("\t"+x[i][j]);
}
}
static void merge(int x[],int y[])

{
int z[];
int p=0;
int q=x.length;
int n=x.length+y.length;
z=new int[n];
System.out.println("two array are:");
for(i=0;i<y.length;i++)
System.out.print("\t"+y[i]);
for(i=0;i<n;i++)
{
if(i<x.length)
z[i]=x[i];
if(i<y.length)
z[q+i]=y[i];
}
System.out.println("merge two array:");
for(i=0;i<n;i++)
System.out.println(z[i]);
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1;j++)
{
if(z[j]>z[j+1])
{
int temp=z[j];
z[j]=z[j+1];
z[j+1]=temp;
}
}
}
for(i=0;i<n;i++)
}
static void unian(int x[],int y[])

{
int z[];
int q=x.length;
int n=x.length+y.length;
z=new int[n];
int j=0;
{
if(x[i]!=y[i])
{
z[i]=x[i];
z[q+i]=y[i];
}
else
{
z[i]=x[i];
j++;
}
}
System.out.println("unian two array:");
for(i=0;i<n-j;i++)
}
static void inter(int x[],int y[])

{
int z[];
int n=0;
z=new int[x.length];
{
for(int j=0;j<y.length;j++)
if(x[i]==y[j])
{
z[n]=x[i];
n=n+1;
}
}
System.out.println("intersection two array:");
for(i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(z[i]==z[j])
z[j]=0;
}
}
for(i=0;i<n;i++)
{
if(z[i]!=0)
}
}
static void matrix_sum(int x[][],int y[][])
{
int i,j;
System.out.println("First Matrix is:");
{
{
System.out.print(x[i][j]);
System.out.print(" \t");
}
}
System.out.print("Second Matrix is:-");
{
for(j=0;j<y.length;j++)
{
System.out.print(y[i][j]);
System.out.print("\t ");
}
}
System.out.print("Operation:-Matix Sum");
{
for(j=0;j<x[i].length;j++)
{
System.out.print(x[i][j]+y[i][j]);
System.out.print("\t");
}
}
}
static void matrix_add(int x[][])
{
int i,j,temp,diag=0;
System.out.println("Matrix is:");
{
{
}
}
System.out.print("Matix rows and coloum Addition :");
{
temp=0;
{
if(i==j)
diag=diag+x[i][j];
temp=temp+x[i][j];
System.out.print(x[i][j]+"\t");
}
System.out.print(":"+temp);
}
System.out.println("|
|
| ");
{
temp=0;
{
temp=temp+x[j][i];
}
System.out.print(temp);
}
System.out.println(diag);
}
static void matrix_multi(int x[][],int y[][])
{
int i,j,k;
int c[][]=new int[3][3];
System.out.println("First Matrix is:-");
{
{
}
}
System.out.print("Second Matrix is:-");
{
for(j=0;j<y[i].length;j++)
{
System.out.print(y[i][j]);
System.out.print("\t ");
}
}
System.out.print("Matix Multiplication");
for(i=0;i<c.length;i++)
{
for(j=0;j<c[i].length;j++)
{
for(k=0;k<c[i].length;k++)
c[i][j]=c[i][j]+x[i][k]*y[k][j];
System.out.print(c[i][j]);
}
}
}
static void triangle_A(int x[][])
{
int i,j,temp=x[0][0],temp1=x[0][0],temp2=0;
System.out.println("\t\t***Triangle A operation:***");
System.out.println("Matrix is:-");
{
{
}
}
for(j=i;j<x[i].length;j++)
{
temp2=temp2+x[i][j];
if(temp<x[i][j])
{
temp=x[i][j];
}
if(temp1>x[i][j])
temp1=x[i][j];
}
System.out.println("\t\t ****PROGRAM:-14****\n");
System.out.println("maximum value of tringle A:"+temp);
System.out.print("minimum value of tringle A:"+temp1);
System.out.print("sum of tringle A:"+temp2);
}
static void triangle_B(int x[][])

{
int i,j,temp=x[0][0],temp1=x[0][0],temp2=0;
System.out.println("\t\t***Triangle B operation:***");
System.out.println("Matrix is:-");
{
{
}
}
for(j=0;j<i+1 && j<x[i].length;j++)
{
temp2=temp2+x[i][j];
if(temp<x[i][j])
{
temp=x[i][j];
}
if(temp1>x[i][j])
temp1=x[i][j];
}
System.out.println("maximum value of tringle B:"+temp);
System.out.print("minimum value of tringle B:"+temp1);
System.out.print("sum of tringle B:"+temp2);
}
public static void main(String... s)
{
int r=max(new int[]{90,10,70,100,3,80});
System.out.println("max values is="+r);
int r1=min(new int[]{90,10,70,100,3,80});
System.out.println("min values is="+r1);
int r3=max_d(new int[][]{{300,900,70},{100,3,800},{1000,2,300}});
System.out.println("max values is="+r3);
int r4=min_d(new int[][]{{900,400,70},{100,3,800},{1000,2,300}});
System.out.println("min values is="+r4);
sortA(new int[]{90,10,70,100,3,80});
System.out.println("\t\t**** PROGRAM:-6****\n");
sortD(new int[]{90,10,70,100,3,80});
sort2A(new int[][]{{900,400,70},{100,3,800},{300,200,1000}});
merge(new int[]{90,10,70,100,3,80},new int[]{20,40,50,30,45,15,25});
unian(new int[]{90,10,70,100,45,15},new int[]{20,40,50,30,45,15});
inter(new int[]{1,2,3,4,5,6},new int[]{3,3,5,4,4,8});
matrix_sum(new int[][]{{1,2,3},{4,5,6},{7,8,9}},new int[][]{{10,20,30},{40,50,60},{70,80,90}});
matrix_add(new int[][]{{1,2,3},{4,5,6},{7,8,9}});
matrix_multi(new int[][]{{1,2,3},{4,5,6},{7,8,9}},new int[][]{{10,20,30},{40,50,60},{70,80,90}});
triangle_A(new int[][]{{900,400,70},{100,3,800},{300,200,1000}});
triangle_B(new int[][]{{900,400,70},{100,3,800},{300,2,1000}});
}
}
class StringDemo
{
static int wordCount(String s)
{
int i;
int count=1;
for(i=0;i<s.length();i++)
{
char ch=s.charAt(i);
if(ch==' ')
{
count++;
}
}
return(count);
}
static int spaceCount(String s)
{
int i;
int count=0;
{
if(ch==' ')
{
count++;
}
}
return(count);
}
static int charCount(String s)
{
int i;
int count=0;
{
if(ch==' ')
{
count++;
}
}
return(s.length()-count);
}
static void reverse(String s)
{
int i;
for(i=s.length()-1;i>=0;i--)
{
System.out.print(ch);
}
}
static void polindram(String s)
{
int i;
int j=0;
char riverse[]=new char[20];
char original[]=new char[20];
{
original[i]=s.charAt(i);
}
String s1=new String(original);

System.out.println(s1);
{
riverse[j]=s.charAt(i);
j++;
}
String s2=new String(riverse);
System.out.println(s2);
if(s1.equals(s2))
System.out.println("it is polindram string");
else
System.out.println("it is not polindram string");
}
static void LTrim(String s)

{
int i;
int j=0;
int k=0;
int count=s.length();
char st1[]=new char[count];
System.out.println("String before left trim="+s);
{
if(ch==' ');
else{
j=i;
break;
}
}
for(i=j;i<s.length();i++)
{
st1[k]=s.charAt(i);
k++;
}
String s4=new String(st1);
System.out.println("String after left trim="+s4);
}
static void RTrim(String s)

{
int i;
int j=0;
System.out.print("String before reight trim="+s);
System.out.println("hi");
{
if(ch==' ');
else{
j=i;
break;
}
}
char st1[]=new char[j+1];
for(i=0;i<=j;i++)
{
st1[i]=s.charAt(i);
}
System.out.print("String after right trim="+s4);
}
static void AllTrim(String s)

{
int i;
int j=0;
int k=0;
int l=0;
System.out.print("String before L&R trim="+s);
{
if(ch==' ');
else{
j=i;
break;
}
}
{
if(ch==' ');
else{
k=i;
break;
}
}
char st1[]=new char[(k+1)-j];
for(i=j;i<=k;i++)
{
st1[l]=s.charAt(i);
l++;
}
System.out.print("String after L&R trim="+s4);
}
static void squeeze(String s)

{
int i;
int j=0;
char st[]=new char[count];
System.out.println("String before all trim="+s);
{
if(ch==' ');
else{
st[j]=s.charAt(i);
j++;}
}
String s3=new String(st);
System.out.println("String after all trim="+s3);
}
static void vowelCount(String s)

{
int i;
int j=0;
int count=0;
System.out.println("given String="+s);
{
if(ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')
count++;
}
System.out.println("no.of vowels in string="+count);
}
static void Slength(String s)

{
int i;
int j=0;
for(i=0;i<200;i++)
{
if(ch==' ')
{
break;
}
else{
j++;
}
}
System.out.println("String length="+j);
}
static void sequence(String s)
{
int i;
int j=1;
System.out.println("Given String="+s);
{
st[i]=s.charAt(i);
}
{
int temp=1;
for(j=i+1;j<s.length();j++)
{
if(st[i]==st[j])
{
temp++;
i++;
}
else
break;
}
System.out.println("="+temp);
}
}
static void frequencyCount(StringBuffer s)

{
int i;
int j=1;
int k=1;
char st1[]=new char[count];
{
st[i]=s.charAt(i);
}
{
int temp=1;
{
if(st[i]==st[j])
{
temp++;
}
}
System.out.println("="+temp);
}
}
static void changeCase(String s)
{
int i;
for (i=0;i<s.length();i++)
{
char c=s.charAt(i);
int j= (int) c;
if(j>64&&j<97)
{
st[i]=Character.toLowerCase(c);
System.out.print(st[i]);
}
else if(j>=97)
{
st[i]=Character.toUpperCase(c);
}
}
}
static void singleOccurence(String s)

{
int i;
int j=1;
{
st[i]=s.charAt(i);
}
{
int temp=1;
{
if(st[i]==st[j])
{
temp++;
i++;
}
else
break;
}
}
}
static void sortedOrder(String s)
{
int i;
int j=1;
{
st[i]=s.charAt(i);
}
for(i=0;i<count;i++)
{
for(j=i;j<count;j++)
{
if(st[i]>st[j])
{
char temp=st[i];
st[i]=st[j];
st[j]=temp;
}
}
}
}
/* static void sortedWord(String s)
{
int i;
int j=1;
{
st[i]=s.charAt(i);
}
{
for(j=i;j<s.length();j++)
{
char ch=s.charAt(j);
if(ch==' ')
{
if(st[i]<st[j])
count++;
}
}
{
for(j=i;j<count;j++)
{
if(st[i]>st[j])
{
char temp=st[i];
st[i]=st[j];
st[j]=temp;
}
}
}
} */
static void tringle(String s)
{
int i;
int j=1;
{
st[i]=s.charAt(i);
}
{
for(j=0;j<i+1;j++)
{
System.out.print(st[j]);
}
}
}
static void tringle1(String s)
{
int i;
int j=1;
{
st[i]=s.charAt(i);
}
for(i=s.length();i>0;i--)
{
for(j=0;j<i;j++)
{
}
}
}
{
int i,k;
int j=1;
{
st[i]=s.charAt(i);
}
{
for(j=0;j<i;j++)
{
}
for(k=i;k<=s.length();k++)
{
System.out.print(" ");
}
}
}
{
int i,k;
int j=1;
{
st[i]=s.charAt(i);
}
{
for(j=0;j<i;j++)
{
}
//System.out.println();
for(k=i;k<s.length();k++)
{
}
for(j=0;j<i;j++)
{
}
}
}
{
int i,k;
int j=1;
int temp=0;
{
st[i]=s.charAt(i);
}
{
for(j=0;j<i;j++)
{
}
for(k=i;k<s.length();k++)
{
}
for(j=temp;j<s.length();j++)
{
}
temp++;
}
}
static void compair(String s1,String s2)
{
int i;
int count1=s1.length();
char st1[]=new char[count1];
int temp=0;
System.out.println("Given String1="+s1);
System.out.println("Given String2="+s1);
for (i=0;i<s1.length();i++)
{
char c1=s1.charAt(i);
int j= (int) c1;
char c2=s2.charAt(i);
int k= (int) c2;
if(j==k)
{
temp++;
}
else if(j<k)
{
System.out.println("second is greater then first");
break;
}
else
{
System.out.println("first is greater then second");
break;
}
}
if(temp==s1.length())
{
System.out.print("both are same");
}
}
/* static void wordfrequency(String s)

{
int i,k,l,m;
int j=0;
int count=1;
int temp1=0;
int z=0;
int temp[]=new int[20];
{
if(ch==' ')
{
temp[j]=i+1;
j++;
}
}
for(l=0;l<=j;l++)
{
for(i=0;i<=j;i++)
{
for(k=l;k<temp[i]-2;i++)
{
char c1=s.charAt(k);
int p= (int) c1;
char c2=s.charAt(temp[i]+k);
int q= (int) c2;
if(p==q)
{
temp1++;
}
}
if(temp1==temp[i]-2)
{
z++;
}
}
for(m=0;m<temp[i]-2;m++)
{
System.out.println(s.charAt(m));
}
System.out.println("="+z);
}
}*/
public static void main(String... arg)
{
System.out.println("********PROGRAM:-1********");
int a=wordCount("amit kumar gupta is good boy");
System.out.println("TOTAL WORDS IN STRING 'amit kumar gupta is good boy' ="+a);
int b=spaceCount("amit kumar gupta is good boy");
System.out.println("TOTAL SPACES IN STRING 'amit kumar gupta is good boy' ="+b);
int c=charCount("amit kumar gupta is good boy");
System.out.println("TOTAL CHARECTORS IN STRING 'amit kumar gupta is good boy' ="+c);
System.out.print("Recerse of string 'amit' is = ");
reverse("amit");
polindram("madam");
LTrim("
am it");
RTrim(" am it
");
AllTrim(" am it
");
squeeze("
a m it");
vowelCount("amit kumar gupta");
Slength("amit kumar ");
sequence("aammaimttmttaa");
StringBuffer st1=new StringBuffer("amitamitaamm");
frequencyCount(st1);
changeCase("AmItGupTa");
singleOccurence("aammiitt");
sortedOrder("manish kumar");
tringle("amit");
tringle1("amit");
tringle2("amit");
tringle3("amit");
tringle4("amit");
compair("amit","amit");
/* System.out.println("\n");
wordfrequency("amit kumar gupta amit kumar gupta");*/

}
}
#include <stdio.h>
int main()
{
int c, sum, t;
char n[1000];
printf("Input an integer\n");
scanf("%s", n);
sum = c = 0;
while (n[c] != '\0') {
t = n[c] - '0'; // Converting character to integer
sum = sum + t;
c++;
}
printf("Sum of digits of %s = %d\n", n, sum);
return 0;
}
#include <stdio.h>
int add_digits(int);
int main()
{
int n, result;
scanf("%d", &n);
result = add_digits(n);
printf("%d\n", result);
return 0;
}
int add_digits(int n) {
static int sum = 0;
if (n == 0) {
return 0;
}
sum = n%10 + add_digits(n/10);
return sum;
}
#include <stdio.h>
int main() {
int a, b, x, y, t, gcd, lcm;
printf("Enter two integers\n");
scanf("%d%d", &x, &y);
a = x;
b = y;
while (b != 0) {
t = b;
b = a % b;
a = t;
}
gcd = a;
lcm = (x*y)/gcd;
printf("Greatest common divisor of %d and %d = %d\n", x, y, gcd);
printf("Least common multiple of %d and %d = %d\n", x, y, lcm);
return 0;
}
#include <stdio.h>
long gcd(long, long);

int main() {
long x, y, hcf, lcm;
printf("Enter two integers\n");
scanf("%ld%ld", &x, &y);
hcf = gcd(x, y);
lcm = (x*y)/hcf;
printf("Greatest common divisor of %ld and %ld = %ld\n", x, y, hcf);
printf("Least common multiple of %ld and %ld = %ld\n", x, y, lcm);
return 0;
}
long gcd(long a, long b) {
if (b == 0) {
return a;
}
else {
return gcd(b, a % b);
}
}
#include <stdio.h>
int main()
{
int n, c, k;
printf("Enter an integer in decimal number system\n");
scanf("%d", &n);
printf("%d in binary number system is:\n", n);
for (c = 31; c >= 0; c--)
{
k = n >> c;
if (k & 1)
printf("1");
else
printf("0");
}
printf("\n");
return 0;
}
#include <stdio.h>
long factorial(int);
long find_ncr(int, int);
long find_npr(int, int);
int main()
{
int n, r;
long ncr, npr;
printf("Enter the value of n and r\n");
scanf("%d%d",&n,&r);
ncr = find_ncr(n, r);
npr = find_npr(n, r);
printf("%dC%d = %ld\n", n, r, ncr);
printf("%dP%d = %ld\n", n, r, npr);
return 0;
}
long find_ncr(int n, int r) {
long result;
result = factorial(n)/(factorial(r)*factorial(n-r));
return result;
}
long find_npr(int n, int r) {
long result;
result = factorial(n)/factorial(n-r);
return result;
}
long factorial(int n) {
int c;
long result = 1;
for (c = 1; c <= n; c++)
result = result*c;
return result;
}
#include <stdio.h>
int main()
{
int n, reverse = 0;
printf("Enter a number to reverse\n");
scanf("%d", &n);
while (n != 0)
{
reverse = reverse * 10;
reverse = reverse + n%10;
n
= n/10;
}
printf("Reverse of entered number is = %d\n", reverse);
return 0;
}
include <stdio.h>
long reverse(long);
int main()
{
long n, r;
scanf("%ld", &n);
r = reverse(n);
printf("%ld\n", r);
return 0;
}
long reverse(long n) {
static long r = 0;
if (n == 0)
return 0;
r = r * 10;
r = r + n % 10;
reverse(n/10);
return r;
}
#include<stdio.h>
main()
{
int n, c, d, num = 1, space;
scanf("%d",&n);
space = n - 1;
for ( d = 1 ; d <= n ; d++ )
{
num = d;
for ( c = 1 ; c <= space ; c++ )
printf(" ");
space--;
for ( c = 1 ; c <= d ; c++ )
{
printf("%d", num);
num++;
}
num--;
num--;
for ( c = 1 ; c < d ; c++)
{
printf("%d", num);
num--;
}
printf("\n");
}
return 0;
}
#include<stdio.h>
main()
{
int n, c = 2;
printf("Enter a number to check if it is prime\n");
scanf("%d",&n);
for ( c = 2 ; c <= n - 1 ; c++ )
{
if ( n%c == 0 )
{
printf("%d is not prime.\n", n);
break;
}
}
if ( c == n )
printf("%d is prime.\n", n);
return 0;
}
#include <stdio.h>
int power(int, int);
int main()
{
int n, sum = 0, temp, remainder, digits = 0;
printf("Input an integer\n");
scanf("%d", &n);
temp = n;
// Count number of digits
while (temp != 0) {
digits++;
temp = temp/10;
}
temp = n;
while (temp != 0) {
remainder = temp%10;
sum = sum + power(remainder, digits);
temp = temp/10;
}
if (n == sum)
printf("%d is an Armstrong number.\n", n);
else
printf("%d is not an Armstrong number.\n", n);
return 0;
}
int power(int n, int r) {
int c, p = 1;
for (c = 1; c <= r; c++)
p = p*n;
return p;
}
/* Fibonacci Series c language */
#include<stdio.h>
int main()
{
int n, first = 0, second = 1, next, c;
printf("Enter the number of terms\n");
scanf("%d",&n);
printf("First %d terms of Fibonacci series are :-\n",n);
for ( c = 0 ; c < n ; c++ )
{
if ( c <= 1 )
next = c;
else
{
next = first + second;
first = second;
second = next;
}
printf("%d\n",next);
}
return 0;
}
#include <stdio.h>
int main()
{
int n, i, c, a = 1;
printf("Enter the number of rows of Floyd's triangle to print\n");
scanf("%d", &n);
for (i = 1; i <= n; i++)

{
for (c = 1; c <= i; c++)
{
printf("%d ",a);
a++;
}
printf("\n");
}
return 0;
}
#include <stdio.h>
long factorial(int);
int main()
{
int i, n, c;
printf("Enter the number of rows you wish to see in pascal triangle\n");
scanf("%d",&n);
for (i = 0; i < n; i++)
{
for (c = 0; c <= (n - i - 2); c++)
printf(" ");
for (c = 0 ; c <= i; c++)
printf("%ld ",factorial(i)/(factorial(c)*factorial(i-c)));
printf("\n");
}
return 0;
}
long factorial(int n)
{
int c;
long result = 1;
for (c = 1; c <= n; c++)
result = result*c;
return result;
}
#include <stdio.h>
int main()
{
int c, first, last, middle, n, search, array[100];
printf("Enter number of elements\n");
scanf("%d",&n);
printf("Enter %d integers\n", n);
for (c = 0; c < n; c++)
scanf("%d",&array[c]);
printf("Enter value to find\n");
scanf("%d", &search);
first = 0;
last = n - 1;
middle = (first+last)/2;
while (first <= last) {

if (array[middle] < search)
first = middle + 1;
else if (array[middle] == search) {
printf("%d found at location %d.\n", search, middle+1);
break;
}
else
last = middle - 1;
middle = (first + last)/2;
}
if (first > last)
printf("Not found! %d is not present in the list.\n", search);
return 0;
}
#include <stdio.h>
int main()
{
int array[100], n, c, d, position, swap;
scanf("%d", &n);
for ( c = 0 ; c < n ; c++ )
scanf("%d", &array[c]);
for ( c = 0 ; c < ( n - 1 ) ; c++ )
{
position = c;
for ( d = c + 1 ; d < n ; d++ )
{
if ( array[position] > array[d] )
position = d;
}
if ( position != c )
{
swap = array[c];
array[c] = array[position];
array[position] = swap;
}
}
printf("Sorted list in ascending order:\n");
for ( c = 0 ; c < n ; c++ )
printf("%d\n", array[c]);
return 0;
}
#include <stdio.h>
int main()
{
int n, array[1000], c, d, t;
scanf("%d", &n);
for (c = 0; c < n; c++) {
scanf("%d", &array[c]);
}
for (c = 1 ; c <= n - 1; c++) {
d = c;
while ( d > 0 && array[d] < array[d-1]) {
t
= array[d];
array[d] = array[d-1];
array[d-1] = t;
d--;
}
}
printf("Sorted list in ascending order:\n");
for (c = 0; c <= n - 1; c++) {
printf("%d\n", array[c]);
}
return 0;
}
#include <stdio.h>
int main()
{
int m, n, p, q, c, d, k, sum = 0;
int first[10][10], second[10][10], multiply[10][10];
printf("Enter the number of rows and columns of first matrix\n");
scanf("%d%d", &m, &n);
printf("Enter the elements of first matrix\n");
for (c = 0; c < m; c++)
for (d = 0; d < n; d++)
scanf("%d", &first[c][d]);
printf("Enter the number of rows and columns of second matrix\n");
scanf("%d%d", &p, &q);
if (n != p)
printf("Matrices with entered orders can't be multiplied with each other.\n");
else
{
printf("Enter the elements of second matrix\n");
for (c = 0; c < p; c++)
for (d = 0; d < q; d++)
scanf("%d", &second[c][d]);
for (c = 0; c < m; c++) {
for (d = 0; d < q; d++) {
for (k = 0; k < p; k++) {
sum = sum + first[c][k]*second[k][d];
}
multiply[c][d] = sum;
sum = 0;
}
}
printf("Product of entered matrices:-\n");
for (c = 0; c < m; c++) {
for (d = 0; d < q; d++)
printf("%d\t", multiply[c][d]);
printf("\n");
}
}
return 0;
}
int compare_strings(char a[], char b[])

{
int c = 0;
while (a[c] == b[c]) {
if (a[c] == '\0' || b[c] == '\0')
break;
c++;
}
if (a[c] == '\0' && b[c] == '\0')
return 0;
else
return -1;
}
int main()
{
char s[100], r[100];
int n, c, d;
printf("Input a string\n");
gets(s);
n = strlen(s);
for (c = n - 1, d = 0; c >= 0; c--, d++)
r[d] = s[c];
r[d] = '\0';
printf("%s\n", r);
return 0;
}
#include <stdio.h>
#include <string.h>
int main()
{
char text[100];
int begin, middle, end, length = 0;
gets(text);
while (text[length] != '\0')
length++;
end = length - 1;
middle = length/2;
for (begin = 0; begin < middle; begin++)
{
if (text[begin] != text[end])
{
printf("Not a palindrome.\n");
break;
}
end--;
}
if (begin == middle)
printf("Palindrome.\n");
return 0;
}
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
char ch, input[100], output[100];
int no[26] = {0}, n, c, t, x;
printf("Enter some text\n");
scanf("%s", input);
n = strlen(input);
/** Store how many times characters (a to z)
appears in input string in array */
for (c = 0; c < n; c++)
{
ch = input[c] - 'a';
no[ch]++;
}
t = 0;
/** Insert characters a to z in output string
that many number of times as they appear
in input string */
for (ch = 'a'; ch <= 'z'; ch++)
{
x = ch - 'a';
for (c = 0; c < no[x]; c++)
{
output[t] = ch;
t++;
}
}
output[t] = '\0';
printf("%s\n", output);
return 0;
}
void sort_string(char*);
int main()
{
char string[100];
printf("Enter some text\n");
gets(string);
sort_string(string);
printf("%s\n", string);
return 0;
}
void sort_string(char *s)
{
int c, d = 0, length;
char *pointer, *result, ch;
length = strlen(s);
result = (char*)malloc(length+1);
pointer = s;
for ( ch = 'a' ; ch <= 'z' ; ch++ )
{
for ( c = 0 ; c < length ; c++ )
{
if ( *pointer == ch )
{
*(result+d) = *pointer;
d++;
}
pointer++;
}
pointer = s;
}
*(result+d) = '\0';
strcpy(s, result);
free(result);
}

Java Program

Caricato da

Informazioni sul documento

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Java Program

Caricato da

Copyright:

Formati disponibili

class arraydemo

static int min_d(int x[][])

static void merge(int x[],int y[])

static void unian(int x[],int y[])

static void inter(int x[],int y[])

static void triangle_B(int x[][])

String s1=new String(original);

static void LTrim(String s)

static void RTrim(String s)

static void AllTrim(String s)

static void squeeze(String s)

static void vowelCount(String s)

static void Slength(String s)

static void frequencyCount(StringBuffer s)

static void singleOccurence(String s)

/* static void wordfrequency(String s)

wordfrequency("amit kumar gupta amit kumar gupta");*/

long gcd(long, long);

for (i = 1; i <= n; i++)

while (first <= last) {

int compare_strings(char a[], char b[])

Potrebbero piacerti anche