Professional Documents
Culture Documents
Algorithm:
Step 1 :
Start of algorithm
Step 2 :
Step 3 :
Create an integer square array of size n*n which will be the circular matrix
Step 4 :
Declare and initialize variables k = 0 (for filling the matrix), c1 = 0 (for storing index of first column),
c2 = n-1 (for storing index of last column), r1 = 0 (for storing index of first row),
r2 = n-1 (for storing index of last row)
Step 5 :
Step 6 :
(a)
(b)
Start a for loop from i = c1 to c2, where i increases by 1 every time and perform step (b)
Store the natural numbers in the first row using A[r1][i] = k++
(a)
(b)
Start a for loop from j = r1+1 to r2, where j increases by 1 every time and perform step (b)
Store the natural numbers in the last column using A[j][c2] = k++
(a)
Start a for loop from i = c2-1 to c1, where i decreases by 1 every time and perform step (b)
Step 7 :
Step 8 :
Yuw4
public rturturst
c2--;
r1++;
r2--;
}
/* Printing the Circular matrix */
System.out.println("The Circular Matrix is:");
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
{
System.out.print(A[i][j]+ "\t");
}
System.out.println();
}rturtdyswruttu
Question:
A Palindrome is a word that may be read the same way in either direction.
Accept a sentence in UPPER CASE which is terminated by either . , ? or ! .
Each word of the sentence is separated by a single blank space.
Perform the following tasks:
(a) Display the count of palindromic words in the sentence.
(b) Display the Palindromic words in the sentence.
MOM
DAD
NOON
Step 1 :
Start of algotithm
Step 2 :
Step 3 :
Step 4 :
Create a StringTokenizer object str to extract tokens (words) from the sentence using space and other
the punctuation marks namely ., ?, !
Step 5 :
Count the number of tokens (words) and store it in an integer variable c. Also create a String array
word[ ] of size c
Step 6 :
Start a for loop from i = 0 to less than c and store the tokens of the sentence into the word [ ] array
Step 7 :
Step 8 :
Step 9 :
Call the function isPalin() as : ob.isPalin(word[i]). If the returned value is true then increase the count
variable and print the word.
Step 10 :
If count of palindromic words is not equal to zero, then print the value stored in the variable count
Step 11 :
Step 1 :
Step 2 :
Step 3 :
Declare and initialize a String variable rev= for storing the reverse of the String s
Step 4 :
Step 5 :
Extract characters from the end of the original string and add them to the variable rev
Step 6 :
false.
If the reverse word obtained (rev) is equal to the original String (s), then return true, otherwise return
Step 7 :
Similarly if you have more functions, then just write their algorithms in a similar fashion one after the
other.
import java.io.*;
import java.util.*;
class Palin_ISC2013
{
static BufferedReader br=new BufferedReader (new InputStreamReader (System.in));
boolean isPalin(String s)
{
int l=s.length();
String rev="";
for(int i=l-1; i>=0; i--)
{
rev=rev+s.charAt(i);
}
if(rev.equals(s))
return true;
else
return
false;
}
public static void main(String args[])throws IOException
{
Palin_ISC2013 ob=new Palin_ISC2013();
System.out.print("Enter any sentence : ");
String s=br.readLine();
s=s.toUpperCase();
StringTokenizer str = new StringTokenizer(s,".?! ");
int w=str.countTokens();
String word[]=new String[w];
for(int i=0;i<w;i++)
{
word[i]=str.nextToken();
}
int count=0;
System.out.print("OUTPUT : ");
for(int i=0; i<w; i++)
{
if(ob.isPalin(word[i])==true)
{
count++;
System.out.print(word[i]+" ");
}
}
if(count==0)
System.out.println("No Palindrome Words");
else
System.out.println("nNumber of Palindromic Words : "+count);
}
}
This is how you can write algorithms in your ISC Practical Examination. So, as you see, this is nothing
but step wise solution to the given program in English language.