Amla Honey – Harvest Natural Honey


Buy Online



https://www.amazon.in/Organic-AMLA-Natural-Honey-Ingredients/dp/B08VF32KBG?dchild=1&keywords=harvest+amla+honey&qid=1620043943&sr=8-5&linkCode=ll1&tag=mannarakkals-21&linkId=7bead561cc7f13da8312114e4e5fd1f4&language=en_IN&ref_=as_li_ss_tl

Real tasty of natural wild honey with amla .

Health Benefits of Amla Honey

*  Natural Blood Purifier
   *   Improves Vision
   *   Prevents from dandruff & supports hair growth

   *   Good for immunity

Usage:

Usage : 

                   1 Spoon Harvest Amla Honey a day.

2D Array – ISC 12th Computer- SOLVED SPECIMEN QUESTION PAPER – 2021


harvestfarmfresh.com

Write a program to declare a square matrix M [ ] [ ] of order ‘N’ where ‘N’ must be greater than 3 and less than 10. Allow the user to accept three different characters from the keyboard and fill the array according to the instruction given below:

(i) Fill the four corners of the square matrix by character 1.
(ii) Fill the boundary elements of the matrix (except the four corners) by character 2.
(iii) Fill the non-boundary elements of the matrix by character 3.

Test your program with the following data and some random data:

Example 1:
INPUT: N = 4
FIRST CHARACTER: @
SECOND CHARACTER: ?
THIRD CHARACTER: #

OUTPUT:
@ ? ? @
? # # ?
? # # ?
@ ? ? @

Example 2: INPUT: N = 5
FIRST CHARACTER: A
SECOND CHARACTER: C
THIRD CHARACTER: X

OUTPUT:
A C C C A
C X X X C
C X X X C
C X X X C
A C C C A

Example 3: INPUT: N = 15
OUTPUT: SIZE OUT OF RANGE

import java.util.*;
class matRIX
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        System.out.println("Enter no.of rows M of a square matrix:");
        int m=sc.nextInt();
         char mat[][] = new char[m][m];
       System.out.println("Enter corner elements - 1st character:");
       char ch1=sc.next().charAt(0);
        System.out.println("Enter boundary except corner elements - 2ndcharacter:");
       char ch2=sc.next().charAt(0);
         System.out.println("Enter  non boundary  - 3rdcharacter:");
       char ch3=sc.next().charAt(0);
      
          for(int i=0; i<m; i++)
            {
                for(int j=0; j<m;j++)
                {
                    //fill corners with char 1
                    if( (i==0||i==m-1) && (j==0 || j==m-1))
                      mat[i][j]=ch1;
                    //fill non-corner boundary elememts with char 2
                    else if(i==0 || j==0 || i==m-1 || j==m-1)
                         mat[i][j]=ch2;
                    //fill rest with char 3
                    else
                        mat[i][j]=ch3;
                }
            }
            
            //print the array
            System.out.println("");
            for(int i=0; i<m; i++)
            {
                for(int j=0; j<m; j++)
                {
                    System.out.print(mat[i][j] + "\t");
                }
                System.out.println();
            }
        
    }
}

OUTPUT:

Enter no.of rows M of a square matrix:
5
Enter corner elements – 1st character:
@
Enter boundary except corner elements – 2ndcharacter:
?
Enter non boundary – 3rdcharacter:
#

@ ? ? ? @
? # # # ?
? # # # ?
? # # # ?
@ ? ? ? @

Converting first character into UpperCase


Write a program to accept a sentence and check whether it is terminated by ‘.’ or ‘? ‘ or ‘!’ . Display the words using default delimiter (space) and the first character of each word should be converted into Upper Case.

Sample Input :

converting first character.

Sample Output:

converting Converting
first First
character Character

import java.util.*;
class strDec
{
public static String firstLetter(String wrd)
    {
        String res="";char ch2=' ';
        int l=wrd.length();
        for(int i=1;i<l;i++)
        {
        char ch1=wrd.charAt(i);
           ch2=wrd.charAt(0);
        if(Character.isLowerCase(ch2))
        {
           ch2 =Character.toUpperCase(ch2);
    
        }
      //System.out.println(ch1);
        res=res +ch1;
        
    }
        res=ch2+res;
        return res;
        //System.out.println(res);
    }
   public static void main(String args[])
  
   {   strDec strd=new strDec();
       String str;
        Scanner sc=new Scanner(System.in);
        System.out.println("Enter a sentence:");
        str=sc.nextLine();
     int l=str.length();
        char c=str.charAt(l-1);
       
       if(c=='.'||c=='?'||c=='!')
       {
        StringTokenizer st=new StringTokenizer( str, " .?!");
        int n=st.countTokens();
         String wrd[]=new String [n];
       
         String ch[]=new String[n];
         
      
         
        for(int i=0;i<n;i++){
            wrd[i]=st.nextToken();
            ch[i]=firstLetter(wrd[i]);
        System.out.println(wrd[i] + "    "+ch[i]+" " );
        }
        
     }
        
     else
        {
         System.out.println("Enter a sentence terminated with . or ? or ! :");
   }
       
    }
}

Output:

Enter a sentence:
the sky is the limit.
the The
sky Sky
is Is
the The
limit Limit

ISC Computer Science Practical – Previous Year 2020 – Solved Paper – Matrix program


Write a program to declare a matrix A[][]of order ( M*N) where ‘M’ is the number of rows and ‘N’ is the number of columns such that the value of “M’ must be greater than 0 and less than 10 and the value of ‘N’ must be greater than 2 and less than 6. Allow the user to input digits (0-7) only at each location, such that each row represents an octal number.

Example: 

231(decimal equivalent of 1st row=153 i.e. 2*8² +3*8¹ +1*8⁰)    
405(decimal equivalent of 1st row=261 i.e. 4*8¹ +0*8¹ +5*8⁰) 
156(decimal equivalent of 1st row=110 i.e. 1*8² +5*8¹ +6*8⁰)

Perform the following tasks on the matrix:
  • Display the original matrix.
  • Calculate the decimal equivalent for each row and display as per the format given below.
Example 1:
Input:
M=1        
N=3            
ENTER ELEMENTS FOR ROW 1: 1   4  4
Output:
FILLED MATRIX   DECIMAL EQUIVALENT 
1  4  4                100



Example 2:
Input:
 M=3           
 N=4            
ENTER ELEMENTS FOR ROW 1: 1 1 3 7           
ENTER ELEMENTS FOR ROW 2: 2 1 0 6            
ENTER ELEMENTS FOR ROW 3: 0 2 4 5
Output:            
FILLED MATRIX   DECIMAL EQUIVALENT                          
1 1 3 7         607                             
2 1 0 6         1094                             
0 2 4 5         165



Example 3:
Input:
ENTER ROW SIZE  M=3           
ENTER COLUMN SIZE N=9
Output:OUT OF RANGE
import java.util.*;
class mat
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        System.out.println("Enter no.of rows M ");
        int m=sc.nextInt();
        System.out.println("Enter no.of rows N ");
        int n= sc.nextInt();
        int flag=0,pow=0;  
        int mat[][]=new int[m][n];
        if((m>0 && m< 10 )&&(n>2 && n<6))          //M >0 AND <10  && N>2 AND <6
        {  
            for(int i=0;i<m;i++)
            {System.out.print("Enter elements for row "+(i+1)+":");
                for(int j=0;j<n;j++)
                {
                     mat[i][j]=sc.nextInt();
                     if(mat[i][j] < 0 ||   mat[i][j]>7)     //ALLOW THE USER TO INPUT ONLY FROM 0 TO 7 (OCTAL)
                    {
                        flag=1;
                        System.out.println("INPUT DIGITS (0 -7) ONLY AT EACH LOCATION");
                        System.exit(1);
                        
                    }
                 
                }
                
            }   
        }
        if(flag==0)
        {
            System.out.println("FILLED MATRIX \t DECIMAL EQUIVALENT");
                      for(int i=0;i<m;i++)
                      {
                         int r=0,sum=0;
                          for(int j=n-1;j>=0;j--)  
                          {   
                                  pow=((int)Math.pow(8,r++)); 
                                  sum=sum+(mat[i][j]*pow);
                    
                           }
                           
                           for(int k=0;k<n;k++)
                           {
                               System.out.print(mat[i][k]+ " " );
                           }
                            System.out.print("\t\t \t" +sum);
                            System.out.println();
                      }
         }       
           
                
else
        System.out.println("Enter valid range"); 
 }
}



        
        

OUTPUT:

Enter no.of rows M
3
Enter no.of rows N
3
Enter elements for row 1:2 3 1
Enter elements for row 2:4 0 5
Enter elements for row 3:1 5 6


FILLED MATRIX DECIMAL EQUIVALENT
2 3 1 153
4 0 5 261
1 5 6 110

Harvest Natural Honey Quality Honey for Better Life… Taste the God’s gift !!!


Taste the God’s Gift !!! You can place a honey bottle through this link.

Honey the precious gift of Nature!!! Only one healthy food that completely dissolve in the Blood.

Purchase Pure and Natural Honey with varieties of Harvest Natural Honey Products such as Amla Honey, Garlic Honey, Thulsi Honey, Brahmi Honey, Cheruthen (Stingless Bee honey), Originial Bees wax face cream

Shop Now : https://www.harvestfarmfresh.com/shop-natural-rawhoney-buy-online

OR

VIA AMAZON BY BELOW LINK

to print possible combinations of numbers (234, 243,324,342,etc)


import java.util.*;
class permutationDigits
{
int count = 0;
void input()
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter a digit: ");
int a= sc.nextInt();
String s=String.valueOf(a); //converting int into string
System.out.println("The Anagrams are : ");
compute("",s);
System.out.println("Total Number of Anagrams = "+count);
}
void compute(String s1, String s2)
{
if(s2.length()<=1)
{
count++;
System.out.println(s1+s2);
}
else
{
for(int i=0; i<s2.length(); i++)
{
String a = s2.substring(i, i+1);
String b = s2.substring(0, i);
String c = s2.substring(i+1);
compute(s1+a, b+c);
}
}
}
public static void main(String args[])
{
permutationDigits ob=new permutationDigits();
ob.input();
}
}

Output:

Enter a digit: 234
The Anagrams are :
234
243
324
342
423
432
Total Number of Anagrams = 6

To print Anagrams (eg: TOP,TPO,POT, etc..)


import java.util.*;
class anagramsWord
{
int count = 0;
void input()
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter a word : ");
String s = sc.next();
System.out.println("The Anagrams are : ");
compute("",s);
System.out.println("Total NO. of Anagrams = "+count);
}

void compute(String s1, String s2)
{
if(s2.length()<=1)
{
count++; // no of combination words
System.out.println(s1+s2);
}
else
{
for(int i=0; i<s2.length(); i++)
{
String a = s2.substring(i, i+1);
String b = s2.substring(0, i);
String c = s2.substring(i+1);
compute(s1+a, b+c); // recursive method
}
}
}
public static void main(String args[])throws Exception
{
anagramsWord ob=new anagramsWord();
ob.input();
}
}

Output:

Enter a word : TOP
The Anagrams are :
TOP
TPO
OTP
OPT
PTO
POT
Total NO. of Anagrams = 6

Printing possible combinations of 4 digit number


import java.util.*;
public class Combinations
 {
public static void main(String[] args)
 {
int[] a = { 1, 5, 3, 6 }; 
for (int w = 0; w < 4; w++) 
{
    for (int x = 0; x < 4; x++) 
     {
        for (int y = 0; y <4; y++) 
        {
          for (int z = 0; z < 4; z++) 
          {
             if (w!=x && x != y && y != z && z != x) 
             { 
             System.out.println(a[w] + ""+a[x] + "" + a[y] + "" + a[z]); 
             } 
          }
        }
     }
  }
}
}

1513
1516
1531
1536
1561
1563
1315
1316
1351
1356
1361
1365
1615
1613
1651
1653
1631
1635
5153
5156
5135
5136
5165
5163 continue….

Evil Number


An Evil number is a positive whole number which has even number of 1’s in its binary equivalent. Eg: Binary equivalent of 9 is 1001, contains even number of 1’s.

Design a program to accept a positive whole number and find the binary equivalent of the number and count the number of 1’s in it and display whether it is an Evil number or not.

Eg:

INPUT : 15
BINARY EQUIVALENT : 1111
NO. OF 1’S : 4
OUTPUT : EVIL NUMBER

import java.util.Scanner;
class bintoDec
{
    int n, a, count1=0;
    String s = "";
    void input()
     {

     Scanner sc = new Scanner(System.in);
     System.out.println("Enter decimal number ");
     n = sc.nextInt();
     System.out.println("INPUT : "+n);
     }
void calculate()
{
    input();
    while(n>0)
{
a = n%2;
if(a == 1)
{
count1++;
}
s = a+" "+s;
n = n/2;
}
System.out.println("BINARY EQUIVALENT:" +s);
System.out.println("NO. OF 1's " +count1);
}
void count()
{
    calculate();
    if( count1 %2 ==0)
    System.out.println("\n EVIL NUMBER");
    else
    System.out.println("\nNOT AN EVIL NUMBER");
    
}
public static void main(String args[])
{
    bintoDec bin=new bintoDec();
    bin.count();
}
}

Enter decimal number
24
INPUT : 24
BINARY EQUIVALENT:1 1 0 0 0
NO. OF 1’s 2

EVIL NUMBER

Enter decimal number
25
INPUT : 25
BINARY EQUIVALENT:1 1 0 0 1
NO. OF 1’s 3

NOT AN EVIL NUMBER