1.

public class PrintString {

public static void main(String[] args) {

String n="a1b10";
char a[];
char charValue = 0;
int i,j,count=0,numberValue=0;
a=n.toCharArray();
for(i=0;i<a.length;i++) {

if(Character.isDigit(a[i]))
{
while(Character.isDigit(a[i]))
{
numberValue=Character.getNumericValue(a[i]);
count=(count*10)+numberValue;
i++;
if(i>(a.length-1))
{
i--;
break;
}

}
while(Character.isAlphabetic(a[i]))
{
i--;
break;
}

for(j=0;j<count;j++) {
System.out.print(charValue+" ");
}
count=0;
}
else
{
charValue=a[i];
}

}
}

}
======================================
public class CrossPattern {

public static void main(String[] args) {

String a= "12345";
int j;

j=a.length()-1;
char[] charArray=a.toCharArray();
for(int i=0;i<a.length();i++)
{
for(int k=0;k<a.length();k++)
{
 if(k==i)
{
System.out.print(charArray[k]+" ");
}
else if(k==j){
System.out.print(charArray[k]+" ");
}
else
{
System.out.print(" ");
}
}
System.out.println("");
j--;
}
}

}
============================
DIAMOND PATTERN

import java.util.Scanner;
public class Main
{
public static void main(String args[])
{
int n, i, j, space = 1;
System.out.print("Enter the number of rows: ");
Scanner s = new Scanner(System.in);
n = s.nextInt();
space = n - 1;
for (j = 1; j <= n; j++)
{
for (i = 1; i <= space; i++)
{
System.out.print(" ");
}
space--;
for (i = 1; i <= 2 * j - 1; i++)
{
System.out.print("*");
}
System.out.println("");
}
space = 1;
for (j = 1; j <= n - 1; j++)
{
for (i = 1; i <= space; i++)
{
System.out.print(" ");
}
space++;
for (i = 1; i <= 2 * (n - j) - 1; i++)
{
System.out.print("*");
}
System.out.println("");
}
}
}
==========================
MATRIX

import java.util.*;
import java.lang.*;

public class Main

{
private static final int N = 4;

public static Boolean isUpperTriangularMatrix(int mat[][])

{
for (int i = 1; i < N ; i++)
for (int j = 0; j < i; j++)
if (mat[i][j] != 0)
return false;
return true;
}

// driver function
public static void main(String argc[]){
int[][] mat= { { 1,0},
{1,1}};

if (isUpperTriangularMatrix(mat))
System.out.println("Upper Triangular Matrix");
else
System.out.println("Lower Triangular Matrix");
}
}
==================================
2)
import java.util.Scanner;

public class Main

{
public static void main(String args[])
{
Scanner in = new Scanner(System.in);
int[] arr = new int[20];
System.out.println("Enter the array size: ");

int size = in.nextInt();

System.out.println("Enter the array elements: ");

for(int i=0; i<size; i++)
arr[i] = in.nextInt();

int[] ascend = new int[size/2];

int[] descend = new int[(size)-(size/2)];

int k =0 , l =0;
for(int i=0; i<size; i++)
{
if(i%2 == 0)
{
 descend[k] = arr[i];
k++;
}
else
{
ascend[l] = arr[i];
l++;
}
}

for(int i=0; i<descend.length; i++)

for(int j=i+1; j<descend.length; j++)
if(descend[i] < descend[j])
{
int temp = descend[i];
descend[i] = descend[j];
descend[j] = temp;
}
for(int i=0; i<ascend.length; i++)
for(int j=i+1; j<ascend.length; j++)
if(ascend[i] > ascend[j])
{
int temp = ascend[i];
ascend[i] = ascend[j];
ascend[j] = temp;
}

k =0;
l =0;
for(int i=0; i<size; i++)
{
if(i%2 == 0)
{
System.out.print(descend[k]+",");
k++;
}
else
{
System.out.print(ascend[l]+",");
l++;
}
}
}
}
================================
4)

import java.util.Scanner;
public class Main
{
public static void main(String args[])
{
Scanner in = new Scanner(System.in);

String str1,str2;

System.out.println("Enter the String1: ");

str1 = in.nextLine();
 System.out.println("Enter the String2: ");
str2 = in.nextLine();
int signal = 1;

for(int i=0; i<=(str1.length()-str2.length()); i++)

{
int flag = 1;

for(int j=0; i<str1.length() && j<str2.length(); j++,i++)

{
if(str2.charAt(j) != str1.charAt(i))
{
flag = 0;
break;
}
}
if(flag == 1)
{
signal = 0;
System.out.println(i-str2.length());
}

}
if(signal == 1)
System.out.println("-1");
}
}
=================================
5)
import java.util.Scanner;

public class Main

{
public static void main(String artgs[])
{
Scanner in = new Scanner(System.in);

int[] array1 = {2,4,5,6,7,9,10,13};

int[] array2 = {2,3,4,5,6,7,8,9,11,15};

int[] array3 = new int[array1.length+array2.length];

for (int i=0; i<array1.length; i++)

array3[i] = array1[i];

for (int i=array1.length,j=0; i<array1.length+array2.length; i++,j++)

array3[i] = array2[j];
for(int i=0; i<array3.length; i++)
for(int j=i+1; j<array3.length; j++)
if(array3[i] > array3[j])
{
int temp = array3[i];
array3[i]= array3[j];
array3[j]= temp;
}
for(int i=0; i<array3.length; i++)
{
int flag = 1;
 for(int j=0; j<i; j++)
{
if(array3[j] == array3[i])
{
flag = 0;
break;
}
}
if(flag == 1)
System.out.print(array3[i]+ ",");
}
}
}
=================================