Hi friend,

Code to solve the problem :
Answer 5 :

public class ArrayExample {

public static void main(String args[])
{
String str[] = "programming java hello".split(" ");
System.out.println(str.length);
String strresult="";
for(int i=str.length-1; i>=0; i--)
{
strresult+=str[i]+" ";
}
System.out.println(strresult);
}

}

Answer 2 :

import java.lang.*;
import java.io.*;

public class BinaryToDecimal{
public static void main(String[] args) throws IOException{
BufferedReader bf= new BufferedReader(new InputStreamReader(System.in));
System.out.print("Enter the Binary value: ");
String str = bf.readLine();
long num = Long.parseLong(str);
long rem;
while(num > 0){
rem = num % 10;
num = num / 10;
if(rem != 0 && rem != 1){
System.out.println("This is not a binary number.");
System.out.println("Please try once again.");
System.exit(0);
}
}
int i= Integer.parseInt(str,2);
System.out.println("Decimal:="+ i);
}
}

Hi friend,


Answer 3 :

class TwoDimensionalArray
{
public static void main(String[] args)
{
int TwoDarray[][]=new int[3][3];
for(int i=0; i<3;i++)
{
for(int j=0; j<3;j++)
{
TwoDarray[i][j] = i+j;

}
}

int sum=0;
for(int i=0; i<3;i++)
{
for(int j=0; j<3;j++)
{
if(i!=j)
{
sum+=TwoDarray[i][j];
}
System.out.print(" "+ TwoDarray[i][j]);

}
System.out.println("");
}

System.out.println("Total Sum of Non diagonal elements : "+ sum);

}
}

Answer :7


import java.util.*;
public class Strtok {

public static void main(String [] args) {

String Demo = "55|7|40|7|7|9|7|2|95|3|";

StringTokenizer Tok = new StringTokenizer(Demo,"|");
int n=Tok.countTokens();
System.out.println("n : " + n);
int num[] = new int[n];
int count=0;
while (Tok.hasMoreTokens())
{

num[count] = Integer.parseInt(Tok.nextToken().toString());
//System.out.println(num[count]);
count++;
}

int numar[] =new int[num.length];
int numcount=0;
for(int i=0;i<num.length;i++)
{
if(num[i]!=7)
{
numar[numcount]=num[i];

//System.out.println( num[i]);
System.out.println( numar[numcount]);
numcount++;

}



}
for(int i=numcount;i<num.length;i++)
{
numar[i]=0;

}


for(int i=0;i<num.length;i++)
{
System.out.println( numar[i]);
}

}
}

Answer : 8

import java.io.*;
import java.util.*;
public class MagicSquareExample {


public static void main(String[] args) throws IOException{
InputStreamReader isr=new InputStreamReader (System.in);
BufferedReader in=new BufferedReader (isr);



int[][]square=getSquare();


print(square);


int c = getConst(square);
}

static int[][] getSquare()throws IOException{


int[][] square1 = {{9,6,3,16}, {4,15,10,5}, {14,1,8,11}, {7,12,13,2}};


int[][] square4 = {{2,13,11,8},{16,3,5,10},{7,12,14,1},{9,6,4,15}};

int[][] square5 = {{3,7,14,16,25},{11,20,23,2,9},{22,4,6,15,18},{10,13,17,24,1},{19,21,5,8,12}};


int[][] square8 = {{1,15,24,8,17},{23,7,16,5,14},{20,4,13,22,6},{12,21,10,19,3},{9,18,2,11,25}};

return square8;
}




static int getConst(int[][]square){

int sum=0;
for(int i=0;i<square.length;i++){
sum+=square[0][i];
}
return sum;
}


static boolean checkLine(int[][] veld) {
boolean returnvalue = true;
for (int rowNumber = 0; rowNumber < veld.length; rowNumber++) {
int som = 0;
for (int colNumber = 0; colNumber < veld.length; colNumber++) {
som += veld[rowNumber][colNumber];
}
//System.out.println("Sum of row " + rowNumber + " is: " + som);
if (som != getConst(veld))
{
System.out.println("Row " + rowNumber + " with values: " + Arrays.toString(veld[rowNumber]) + " adds up to " + som + " instead of " + getConst(veld));
returnvalue = false;
}

}
return returnvalue;
}

static boolean colCheck(int[][]veld){
boolean returnvalue = true;
for(int colNumber=0;colNumber<veld.length;colNumber++){
int som=0;
for(int rowNumber=0;rowNumber<veld.length;rowNumber++){
som+=veld[rowNumber][colNumber];
}
//System.out.println("Sum of column " + colNumber + " is: " + som);
if(som!=getConst(veld))
{
System.out.println("Column " + colNumber + " with values: " + Arrays.toString(veld[colNumber]) + " adds up to " + som + " instead of " + getConst(veld));
returnvalue = false;
}
}
return returnvalue;
}

static int getOrder(int[][] veld)
{

return veld.length;
}

static boolean isAssociative(int[][] veld)
{
int check = checkSum(veld);
System.out.println("Checksum: " + check);
return checkPairs(veld);

}
static int checkSum(int[][] veld)
{
return ((int)Math.pow(getOrder(veld), 2)) + 1;
}

static boolean checkPairs(int[][] veld)
{
// use recursion to walk through array
return (checkPairs_helper(0, 0, veld));
}

static boolean checkPairs_helper(int row, int col, int[][]veld)
{
if(row == getOrder(veld) || col == getOrder(veld) )
{
return true;
}else
{
int rowindex = getOrder(veld)-1-row;
int colindex = getOrder(veld)-1-col;
if(veld[row][col] + veld[rowindex][colindex] == checkSum(veld) )
{
if(row + 1 == getOrder(veld) || col + 1 == getOrder(veld))
return true;
else
return checkPairs_helper(row+1, col, veld) && checkPairs_helper(row, col+1, veld);
}else
{
System.out.println("Sum of values: " + veld[row][col] + " + " + veld[rowindex][colindex] + " is not equal to " + checkSum(veld));
return false;
}
}
}


static boolean diagCheck(int[][] veld) {
int sumD_leftToRight = 0;
int sumD_rightToLeft = 0;
for (int rowNumber = 0; rowNumber < veld.length; rowNumber++) {
sumD_leftToRight += veld[rowNumber][rowNumber];
sumD_rightToLeft += veld[rowNumber][veld.length - 1 - rowNumber];
}

if (sumD_leftToRight == getConst(veld) && sumD_rightToLeft == getConst(veld))
return true;
else
return false;
}


static void print(int [][]square){

for(int row=0;row<square.length;row++){
System.out.print("\n\t ");
for(int col=0;col<square.length;col++){
System.out.print(square[row][col]+"\t ");
}
}
}

}

Answer 1:

class CharacterFrequency
{
static String s = "hello world";
static char []chars = new char[s.length()];
static char []tmp=new char[s.length()];

public static void main(String args[])
{
s.getChars(0,s.length(),chars,0);
tmp=new char[s.length()];
int ccount=0;

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

if(!isVisited(chars[i]))
{
//mcount = matchElement(chars[i],i);
storeVisited(ccount,chars[i]);
ccount+=1;

}
}

for(int i=0;i<ccount;i++)
{
int charcount=0;
for(int j=0;j<s.length();j++)
{
if(tmp[i]==s.charAt(j))
{
// System.out.print(s.charAt(j));
charcount++;
}

}
if(tmp[i]!=' ')
System.out.println(tmp[i] + " : " + charcount);
}
}



public static void storeVisited(int i,char c)
{
tmp[i]=c;
}

public static boolean isVisited(char c)
{
for(int i=0;i<tmp.length;i++)
{
if(c==tmp[i])
{
return true;
}
}
return false;
}

}

Answer 9 :

class StringAr
{
public static void main(String[] args)
{
String str="ram";
char[] cArray = str.toCharArray();
char[] ch = new char[cArray.length];

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

int count=0;
for(int j=i;j<cArray.length;j++)
{
ch[count]=cArray[j];
count++;
}

for(int k=0;k<i;k++)
{
ch[count]=cArray[k];
count++;
}
System.out.println(ch);
}
}
}