ICSE JAVA PROGRAMS 2019: SECTION B QUESTION 8 SOLVED

 

ICSE JAVA PROGRAMS 2019: SECTION B QUESTION 8

Programming for school students ( upper to middle/secondary school)

Write a program to input s sentence and convert it into uppercase and display the total number of words starting with letter 'A'.

Example:

INPUT: Advancement and application of Information Technology are ever changing.

OUTPUT: ADVANCEMENT AND APPLICATION OF INFORMATION TECHNOLOGY ARE EVER CHANGING.

Number of word(s)starting with A is/are: 4

JAVA CODE

import java.util.Scanner;

public class ISCJava{

       public static void main(String[] args) {

       String sentence;

       int counterStartingA = 0;

       Scanner in = new Scanner(System.in);

       System.out.println("Enter your sentence:");

       sentence = in.nextLine();

       System.out.println();

       System.out.println("OUTPUT:");

       System.out.println("ORIGINAL STATEMENT:");

       System.out.println(sentence);

       System.out.println();

       System.out.println("AFTER CHANGING TO UPPER CASE:");

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

              char c = sentence.charAt(i);

              if(c >= 'a' && c <= 'z') {

                     c -= 32;

                     System.out.print(c);

              }

              else

              System.out.print(c);   

       }

       //counting number of words staring with A

       System.out.println();

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

              if (sentence.charAt(i) == 'A' || sentence.charAt(i) == 'a') {

                     if(i==0)

                            counterStartingA++; 

                     else if(sentence.charAt(i-1) == ' ')

                            counterStartingA++;

              }

       System.out.println("Number of word(s)starting with A is/are: "+counterStartingA);

       in.close();

       }

}

PYTHON CODE

counterStartingA = 0

sentence = str(input("Enter the sentence: "))

print("OUTPUT:")

print("ORIGINAL STATEMENT:")

print(sentence)

print("AFTER CHANGING TO UPPER CASE:")

for i in range(len(sentence)):

    c = (sentence[i])

    if (c >= 'a' and c <= 'z'):

        t = ord(c) -32

        print(chr(t),end="")

    else:

        print(c,end="")

for i in range(len(sentence)):

    if sentence[i] == 'A' or sentence[i] == 'a':

        if i == 0:

            counterStartingA +=1

        elif sentence[i-1] == ' ':

            counterStartingA +=1

print()

print("Number of word(s)starting with A is/are:",counterStartingA)

ICSE JAVA PROGRAMS 2019: SECTION B QUESTION 7 SOLVED

ICSE JAVA PROGRAMS 2019: SECTION B QUESTION 7

Programming for school students ( upper to middle/secondary school)

Design a class to overload a function series() as follows:

(a) void series (int x, int n) - To display the sum of the series given below:

x+x²+x³+........+xⁿ

(b) void series (int p) - To display the following series:

0, 7, 26, 63, ........ upto p terms

(c) void series () - To display the sum of the series given below

&frac12 + 1⁄3 +&frac14 +.......+1⁄10

import java.util.Scanner;

public class ISCJava{

       public static void main(String[] args) {

       Scanner in = new Scanner(System.in);

       Series obj = new Series();

       int choice;

       System.out.println("Enter your choice(1/2/3):");

       choice = in.nextInt();

       switch(choice){

              case 1:

              int x, n;

              System.out.println("Enter the value of x:");

              x = in.nextInt();

              System.out.println("Enter the value of n:");

              n = in.nextInt();

              obj.series(x,n);

              break;

              case 2:

              int p;

              System.out.println("Enter the value of p:");

              p = in.nextInt();

              obj.series(p);

              break;

              case 3:

              obj.series();

              break;

              default:

              System.out.println("Wrong Choice:");

       }

       in.close();

       }

}

class Series {

       public void series(int x, int n) {

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

                     sumOfSeries += Math.pow((double)x,(double)i);

              System.out.println("Sum of the series is:"+sumOfSeries);

       }

       public void series(int p) {

              System.out.println("The series is");

              for(int i = 1; i<= p; i++)

                     if (i != p)

                            System.out.print((int)Math.pow(i, 3)-1+",");

                     else

                            System.out.println((int)Math.pow(i, 3)-1);       

       }

       public void series() {

              for (int i = 2; i<= 10 ;i++)

                     sumOfSeries += (1.0/i);

              System.out.println("Sum of the series is:"+sumOfSeries);

       }

       Series() {

              this.sumOfSeries = 0.0;

       }

       private double sumOfSeries;

}

       

PYTHON CODE

Note: Function overloading is not available in Python.

class Series:

    def seriesOne(self,x,n):

        for i in range(n):

            i +=1

            self.__sumOfSeries += x**i

        print("Sum of the series is:",self.__sumOfSeries)

    def seriesTwo(self,p):

        for i in range(p):

            i +=1

            if i<p:

                print(i**3-1, end =",")

            else:

                print(i**3-1, end =" ")

    def seriesThree(self):

        for i in range(9):

            i +=2

            self.__sumOfSeries += (1.0/(i+1))

        print("Sum of the series is:",self.__sumOfSeries)

    def __init__(self):

       self.__sumOfSeries = 0

    __sumOfSeries = float(0)

# main program    

obj = Series()

try:

    N = int(input("Enter your choice(1/2/3):"))

    if N > 3:

        print("Your choice in invalid")   

    elif N==1:

        x = int(input("Enter the value of x:"))

        n = int(input("Enter the value of n:"))

        obj.seriesOne(x,n)

    elif N==2:

        p = int(input("Enter the value of p:"))

        obj.seriesTwo(p) 

    else:

        obj.seriesThree()    

except ValueError as e:

    print("Your choice is invalid")

Python program to enter 10 numbers in list and how many of them are ending with 5: Python

PYTHON PROGRASM FOR BEGINNERS

SCHOOL LEVEL PROGRAMMING

Write a Python program to enter 10 numbers in list and how many of them are ending with 5. Display all the numbers ending with 5 and the total of such numbers. If there are no numbers ending with 5 display "NIL".

Both Java and Python codes are given below.

In this program you will learn:

i. Taking input

ii. Adding numbers to list using append() method

iii. for loop

iv. using boolean variables

v. using if statements

PYTHON CODE

#Python program to enter 10 numbers in list and how many of them are ending with 5

numberList = []

for i in range(10):

    print("Enter the element at the position: ",i+1)

    numberList.append(int(input("Enter the value:")))

counter = 0

flagEndingFive = False

print("Numbers ending with 5 is/are:")

for i in numberList:

    if i%10 == 5:

        counter +=1

        flagEndingFive = True

        print(i)

if flagEndingFive == False:

    print("NIL")

print("Total number of numbers ending with 5 = ",counter)

JAVA CODE

import java.util.Scanner;

public class NumbersEndingFive{

       public static void main(String[] args) {

        int[] numberList;

        boolean flagEndingFive = false;

        int counter = 0;

        Scanner in = new Scanner(System.in);

        numberList = new int[10];

        for(int i = 0; i< 10; i++){

               System.out.println("Enter the element at the position:"+(i+1));

               numberList[i] = in.nextInt();

       }

       System.out.println("Numbers ending with 5 is/are:");

       for(int i = 0; i< 10; i++) 

              if(numberList[i]%10 == 5) {

                     flagEndingFive = true;

                     counter++;

                     System.out.println(numberList[i]);

              }

       if(!flagEndingFive)

              System.out.println("NIL");

       System.out.println("Total number of numbers ending with 5 = "+counter);

       in.close();

       }

}

ISC COMPUTER SCIENCE PRACTICAL SPECIMEN PAPER 2021: QUESTION 3 MOBIUS FUNCTION

Question 3

A MOBIUS function M(N) returns the value -1 or 0 or 1 for a natural number (N) by the following conditions are defined :

When,

M ( N ) = 1 if N=1.

M ( N ) = 0 if any prime factor of N is contained more than once.

M ( N ) = ( -1 )^P if N is the product of ‘P’ distinct prime factors.

Write a program to accept a positive natural number (N) and display the MOBIUS result with proper message. Design your program which will enable the output in the format given below:

Sample 1

INPUT:78

OUTPUT: 78 = 2 x 3 x 13

NUMBER OF DISTINCT PRIME FACTORS = 3

M(78) = -1

Sample 2

INPUT:34

OUTPUT: 34 = 2 x 17

NUMBER OF DISTINCT PRIME FACTORS = 2

M(34) = 1

Sample 3

INPUT:12

OUTPUT: 12 = 2 x 2 x 3

DUPLICATE PRIME FACTORS

M(12) = 0

Sample 4

INPUT:1

OUTPUT: 1 = 1

NO PRIME FACTORS

M(1) = 1

ISC COMPUTER SCIENCE PRACTICAL SPECIMEN PAPER 2021

ENTER A POSITIVE INTEGER:

 class Mobius:

    def mobiusCalculation(self):

        indexFlag = True

        if self.__number == 1:

            return 1

        else:

            for i in range(self.__numberOfPrimeFactors):

                if self.__primeIndex[i] > 1:

                    indexFlag = False

                    break

                if (indexFlag == False):

                    return 0

                else:

                    return (-1**self.__numberOfPrimeFactors)

    def primeFactorisation(self):

        index = 0

        tempNumber = 0

        print("Number of distinct prime factors:",self.__numberOfPrimeFactors)

        # finding the prime factors

        for i in range(int(self.__number/2)):

            i +=2

            if (self.__number % i == 0 and self.isPrime(i)):

                self.__primeFactors.append(i)

        # finding powers of the prime factors

        tempNumber = self.__number

        for i in range(self.__numberOfPrimeFactors):

            index = 0

            while tempNumber%self.__primeFactors[i] == 0:

                index +=1

                tempNumber = tempNumber/self.__primeFactors[i]

            self.__primeIndex.append(index)

        # printing the prime factorisation

        for i in range(self.__numberOfPrimeFactors):

            if i < self.__numberOfPrimeFactors-1:        

                print(self.__primeFactors[i],"^",self.__primeIndex[i],end="*"),

            else:

                print(self.__primeFactors[i],"^",self.__primeIndex[i])

    def numberOfPrimeFactorsMethod(self):

        counter = 0

        for i in range (int(self.__number/2)):

            i +=2

            if ((self.__number) % i == 0 and self.isPrime(i)):

                counter +=1

        self.__numberOfPrimeFactors = counter   

        return counter        

    def isPrime(self, numb):

        primeFlag = True

        if numb == 2:

            return True

        else:

            for i in range (int(numb/2)):

                i +=2

                if numb%i == 0:

                    primeFlag = False

                    break

            return (primeFlag)

    def __init__(self,N):

       self.__number = N

       self.__numberOfPrimeFactors = 0

    __number = int(0)

    __numberOfPrimeFactors = int(0)

    __primeFactors = []

    __primeIndex = []

try:

    N = int(input("Enter a positive integer:"))

    if N <= 0:

        print("Your input in invalid")   

    else: 

        obj = Mobius(N)

        if obj.isPrime(N) or N ==1:

            if N == 1:

                print("Number of distinct prime factors:",0)

            else:

                print("Number of distinct prime factors:",1)

            print("Mobius(",N,")","=",1)

        else:

            obj.numberOfPrimeFactorsMethod()

            obj.primeFactorisation()

            print("Mobius(",N,")","=",obj.mobiusCalculation())

except ValueError as e:

    print("Your input in invalid")

 import java.util.Scanner;

public class ISC2021SPECIMENQUESTION3{

       public static void main(String[] args) {

       String N;

       Scanner in = new Scanner(System.in);

       boolean integerFlag;

       do {

              integerFlag = true;

              System.out.println("Enter a positive integer");

              N = in.nextLine();

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

                     if(!Character.isDigit(N.charAt(i))){

                            integerFlag = false;

                            System.out.println("You must enter an integer:");

                            break;

                     }

       }while(!integerFlag);

       in.close();        

       Mobius obj = new Mobius(Long.parseLong(N));

       if(obj.isPrime(Long.parseLong(N)) || Long.parseLong(N) == 1 ) {

              if (Long.parseLong(N)==1)

                     System.out.println("Number of distinct prime factors:"+"0");

              else

                     System.out.println("Number of distinct prime factors:"+"1");

              System.out.println("Prime Factorisation of "+Long.parseLong(N)+"="+Long.parseLong(N));

              System.out.println("Mobius("+Long.parseLong(N)+")="+"1");

              }

       else {

              System.out.println("Prime Factorisation of "+Long.parseLong(N));

              obj.primeFactorization();

              System.out.println();

              System.out.println("Mobius("+Long.parseLong(N)+")="+obj.mobiusCalculation());

              }

       }

}

class Mobius{

       public  int mobiusCalculation(){

              boolean indexFlag = true;

              if (number == 1)

                     return 1;

              else {

                     for(int i=0; i<numberOfPrimeFactors; i++)

                            if(primeIndex[i] > 1)

                                   indexFlag = false;       

                     if(!indexFlag)                       

                            return 0;

                     else   

                            return ((int)Math.pow((-1),numberOfPrimeFactors));

              }

       }

       public void primeFactorization() {

              int index=0;

              long tempNumber;

              System.out.println("Number of distinct prime factors:"+numberOfPrimeFactors);

              // finding the prime factors

              for(int i = 2; i<=(int)(number/2);i++)

                     if(number%i == 0 && isPrime(i))

                            primeFactors[index++] = i;

              // finding the powers of prime factors              

              tempNumber = number;

              for(int i=0; i<numberOfPrimeFactors; i++){

                     index = 0;

                     do {

                        index++;

                        tempNumber /= primeFactors[i];                                       

                     }while(tempNumber%primeFactors[i]==0);

                     primeIndex[i]=index;

              } 

              // printing the prime factorsiation

              for(int i = 0; i<numberOfPrimeFactors; i++)

                     if(i < numberOfPrimeFactors-1)

                            System.out.print(primeFactors[i]+"^"+primeIndex[i]+"*");

                     else

                            System.out.print(primeFactors[i]+"^"+primeIndex[i]);

       }

       private int numberOfPrimeFactorsMethod(long number) {

              int counter = 0;

              for(int i = 2; i<=(int)(number/2);i++)

                     if(number%i == 0 && isPrime(i)) 

                            counter++;  

              return (counter);

       }

       public boolean isPrime(long numb){

              boolean primeFlag = true;

              for(int i = 2; i<=(int)(numb/2);i++){

                     if(numb%i == 0) {

                            primeFlag = false;

                            break;

                     }

              }

              return (primeFlag);

       }

       Mobius(long N){

              this.number = N;

              this.numberOfPrimeFactors = numberOfPrimeFactorsMethod(number);

              this.primeFactors = new int[this.numberOfPrimeFactors];

              this.primeIndex = new int[this.numberOfPrimeFactors]; 

       }

       private long number;

       private int numberOfPrimeFactors;

       private int[] primeFactors;

       private int[] primeIndex;       

}