COMPUTER SCIENCE PRACTICAL SOLVED QUESTIONS - ISC BOARD 2016

-

Question 1:
A Circular Prime is a prime number that remains prime under cyclic shifts of its digits. When the leftmost digit is removed and replaced at the end of the remaining string of digits, the generated number is still prime. The process is repeated until the original number is reached again.
A number is said to be prime if it has only two factors I and itself.

Example:
131
311
113
Hence, 131 is a circular prime.
Test your program with the sample data and some random data:
Example 1
INPUT :N = 197
OUTPUT:
197
971
719
197 IS A CIRCULAR PRIME

Example 2
INPUT :N = 1193
OUTPUT:
1193
1931
9311
3119
1193 IS A CIRCULAR PRIME

Example 3
INPUT :N = 29
OUTPUT:
29
92
29 IS NOT A CIRCULAR PRIME

Programming Code:
import java.util.*;
class CircularPrime_Q1_ISC2016
{
    boolean isPrime(int n) // Function for checking whether a number is prime or not
    {
        int c = 0;
        for(int i = 1; i<=n; i++)
        {
            if(n%i == 0)
                c++;
        }
        if(c == 2)
            return true;
        else
            return false;
    }
     
    int circulate(int n) //Function for circulating the digits to form new number
    {
        String s = Integer.toString(n);
        String p = s.substring(1)+s.charAt(0);
        int a = Integer.parseInt(p);
        return a;
    }
     
    void isCircularPrime(int n) //Function to check for circular prime
    {
        int f = 0,a = n;
        do
        {
            System.out.println(a);
            if(isPrime(a)==false)
            {
                f = 1;
                break;
            }
            a = circulate(a);
        }while(a!=n);
         
        if(f==1)
            System.out.println(n+" IS NOT A CIRCULAR PRIME");
        else
            System.out.println(n+" IS A CIRCULAR PRIME");
    }
     
    public static void main(String args[])
    {
        CircularPrime_Q1_ISC2016 ob = new CircularPrime_Q1_ISC2016();
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a number : ");
        int n = sc.nextInt();
        ob.isCircularPrime(n);
    }
}

--------------------------*--------------------------

Question 2:

Write a program to declare a square matrix A[][] of order (M x M) where ‘M’ must be greater than 3 and less than 10. Allow the user to input positive integers into this matrix. Perform the following tasks on the matrix:
(a) Sort the non-boundary elements in ascending order using any standard sorting technique and rearrange them in the matrix.
(b) Calculate the sum of both the diagonals.
(c) Display the original matrix, rearranged matrix and only the diagonal elements of the rearranged matrix with their sum.
Test your program with the sample data and some random data:
Example 1
INPUT :M = 4
9          2          1          5         
8          13        8          4         
15        6          3          11       
7          12        23        8         
OUTPUT:
ORIGINAL MATRIX
9          2          1          5         
8          13        8          4         
15        6          3          11       
7          12        23        8         
REARRANGED MATRIX
9          2          1          5         
8          3          6          4         
15        8          13        11       
7          12        23        8         
DIAGONAL ELEMENTS
9                                  5         
            3          6                     
            8          13                   
7                                  8                     
SUM OF THE DIAGONAL ELEMENTS = 59
Programming Code:
import java.util.*;
class SortNonBoundary_ISC2016
{
    int A[][],B[],m,n;

    void input() //Function for taking all the necessary inputs
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter the size of the square matrix : ");
        m=sc.nextInt();
        if(m<4 || m>10)
        {
            System.out.println("Invalid Range");
            System.exit(0);
        }
        else
        {
            A = new int[m][m];
            n = (m-2)*(m-2);
            B = new int[n]; //Array to store Non-Boundary Elements
             
            System.out.println("Enter the elements of the Matrix : ");
            for(int i=0;i<m;i++)
            {
                for(int j=0;j<m;j++)
                {
                    System.out.print("Enter a value : ");
                    A[i][j]=sc.nextInt();
                }
            }
        }
    }

    /* The below function stores Non-Boundary elements
     * from array A[][] to array B[] if s = 1
     * else stores the Non-Boundary elements in array A[][] from array B[]
     */
    void convert(int s)
    {
        int x=0;
        for(int i=0;i<m;i++)
        {
            for(int j=0;j<m;j++)
            {
                if(i != 0 && j != 0 && i != m-1 && j != m-1)
                {
                    if(s==1)
                        B[x] = A[i][j];
                    else
                        A[i][j] = B[x];
                    x++;
                }
            }
        }
    }

    void sortArray() //Function for sorting Non-Boundary elements stored in array B[]
    {
        int c = 0;
        for(int i=0; i<n-1; i++)
        {
            for(int j=i+1; j<n; j++)
            {
                if(B[i]>B[j])
                {
                    c = B[i];
                    B[i] = B[j];
                    B[j] = c;
                }
            }
        }
    }

    void printArray() //Function for printing the array A[][]
    {
        for(int i=0;i<m;i++)
        {
            for(int j=0;j<m;j++)
            {
                System.out.print(A[i][j]+"\t");
            }
            System.out.println();
        }
    }

    void printDiagonal() //Function for printing the diagonal elements and their sum
    {
        int sum = 0;
        for(int i=0;i<m;i++)
        {
            for(int j=0;j<m;j++)
            {
                if(i==j || (i+j)==m-1)
                {
                    System.out.print(A[i][j]+"\t");
                    sum = sum + A[i][j];
                }
                else
                    System.out.print("\t");
            }
            System.out.println();
        }
        System.out.println("Sum of the Diagonal Elements : "+sum);
    }

    public static void main(String args[])
    {
        SortNonBoundary_ISC2016 ob = new SortNonBoundary_ISC2016();
        ob.input();
        System.out.println("*********************");
        System.out.println("The original matrix:");
        System.out.println("*********************");
        ob.printArray(); //Printing the original array
        ob.convert(1); //Storing Non-Boundary elements to a 1-D array
        ob.sortArray(); //Sorting the 1-D array (i.e. Non-Diagonal Elements)
        ob.convert(2); //Storing the sorted Non-Boundary elements back to original 2-D array

        System.out.println("*********************");
        System.out.println("The Rearranged matrix:");
        System.out.println("*********************");
        ob.printArray(); //Printing the rearranged array
        System.out.println("*********************");
        System.out.println("The Diagonal Elements:");
        System.out.println("*********************");
        ob.printDiagonal(); //Printing the diagonal elements and their sum
    }
}


 --------------------------*--------------------------

Question 3:


Write a program to accept a sentence which may be terminated by either’.’, ‘?’or’!’ only. The words may be separated by more than one blank space and are in UPPER CASE.
Perform the following tasks:
(a) Find the number of words beginning and ending with a vowel.
(b) Place the words which begin and end with a vowel at the beginning, followed by the remaining words as they occur in the sentence.
Test your program with the sample data and some random data:
Example 1
INPUT: ANAMIKA AND SUSAN ARE NEVER GOING TO QUARREL ANYMORE.
OUTPUT: NUMBER OF WORDS BEGINNING AND ENDING WITH A VOWEL= 3
ANAMIKA ARE ANYMORE AND SUSAN NEVER GOING TO QUARREL
Example 2
INPUT: YOU MUST AIM TO BE A BETTER PERSON TOMORROW THAN YOU ARE TODAY.
OUTPUT: NUMBER OF WORDS BEGINNING AND ENDING WITH A VOWEL= 2
A ARE YOU MUST AIM TO BE BETTER PERSON TOMORROW THAN YOU TODAY
Example 3
INPUT: LOOK BEFORE YOU LEAP.
OUTPUT: NUMBER OF WORDS BEGINNING AND ENDING WITH A VOWEL= 0
LOOK BEFORE YOU LEAP
Example 4
INPUT: HOW ARE YOU@
OUTPUT: INVALID INPUT

Programming Code:
import java.util.*;
class ISC2016_Q3
{
    boolean isVowel(String w) // Function to check if a word begins and ends with a vowel or not
    {
        int l = w.length();
        char ch1 = w.charAt(0); // Storing the first character
        char ch2 = w.charAt(l-1); // Storing the last character
        if((ch1=='A' || ch1=='E' || ch1=='I' || ch1=='O' || ch1=='U') &&
        (ch2=='A' || ch2=='E' || ch2=='I' || ch2=='O' || ch2=='U'))
        {
            return true;
        }
        else
        {
            return false;
        }
    }

    public static void main(String args[])
    {
        ISC2016_Q3 ob = new ISC2016_Q3();
        Scanner sc = new Scanner(System.in);

        System.out.print("Enter a sentence : ");
        String s = sc.nextLine();
        s = s.toUpperCase();
        int l = s.length();
        char last = s.charAt(l-1); // Extracting the last character

        /* Checking whether the sentence ends with '.' or '?' or not */
        if(last != '.' && last != '?' && last != '!')
        {
            System.out.println("Invalid Input. End a sentence with either '.', '?' or '!' only");
        }
        else
        {
            StringTokenizer str = new StringTokenizer(s," .?!");
            int x = str.countTokens();
            int c = 0;
            String w = "", a = "", b = "";

            for(int i=1; i<=x; i++)
            {
                w = str.nextToken(); // Extracting words and saving them in w

                if(ob.isVowel(w))
                {
                    c++; // Counting all words beginning and ending with a vowel
                    a = a + w + " "; // Saving all words beginning and ending with a vowel in variable 'a'
                }
                else
                    b = b + w + " "; // Saving all other words in variable 'b'  
            }
            System.out.println("OUTPUT : \nNUMBER OF WORDS BEGINNING AND ENDING WITH A VOWEL = " + c);
            System.out.println(a+b);

        }
    }
}


Comments

Post a Comment

Popular posts from this blog

ICSE Class 10 - Computer Application Important Program (15 Marks)

-
Program 1-  Define a class called Library with the following description: Instance variables/data members: Int acc_num – stores the accession number of the book String title – stores the title of the book stores the name of the author Member Methods: (i) void input() – To input and store the accession number, title and author. (ii)void compute – To accept the number of days late, calculate and display and fine charged at the rate of Rs.2 per day. (iii) void display() To display the details in the following format: Accession Number Title Author Write a main method to create an object of the class and call the above member methods. Solution -  public class Library {     int acc_num;     String title;     String author;     public void input() throws IOException {         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));  ...
Read more

ICSE Class 10 - Computer Application Important Questions & Answers (2 Marks)

-
02 (Two) Marks Questions  Question 1- Give one example each of a primitive data type and a composite data type. Ans.  Primitive Data Types – byte, short, int, long, float, double, char, boolean Composite Data Type – Class, Array, Interface Question 2- Give one point of difference between unary and binary operators.  Ans.  A unary operator requires a single operand whereas a binary operator requires two operands. Examples of Unary Operators – Increment ( ++ ) and Decrement ( — ) Operators Examples of Binary Operators – +, -, *, /, % Question 3- Differentiate between call by value or pass by value and call by reference or pass by reference. Ans.  In call by value, a copy of the data item is passed to the method which is called whereas in call by reference, a reference to the original data item is passed. No copy is made. Primitive types are passed by value whereas reference types are passed by reference. Question 4-...
Read more

COMPUTER SCIENCE PRACTICAL SOLVED QUESTIONS - ISC BOARD 2018

-
Image
QUESTION -1 A Goldbach number is a positive even integer that can be expressed as the sum of two odd primes. Note: All even integer numbers greater than 4 are Goldbach numbers. Example: 6 = 3 + 3 10 = 3 + 7 10 = 5 + 5 Hence, 6 has one odd prime pair 3 and 3. Similarly, 10 has two odd prime pairs, i.e. 3 and 7, 5 and 5. Write a program to accept an even integer ‘N’ where N > 9 and N < 50. Find all the odd prime pairs whose sum is equal to the number ‘N’. Test your program with the following data and some random data: Example 1: INPUT: N = 14 OUTPUT: PRIME PAIRS ARE: 3, 11 7, 7 Example 2: INPUT: N = 30 OUTPUT: PRIME PAIRS ARE 7, 23 11, 19 13, 17 Example 3: INPUT: N = 17 OUTPUT: INVALID INPUT. NUMBER IS ODD. Example 4: INPUT: N = 126 OUTPUT: INVALID INPUT. NUMBER OUT OF RANGE. import java.util.*; public class Goldbach {     boolean isPrime(int n)     {         if(n<=1)        /...
Read more

Address Calculation in Single and Double Dimension Array - ISC Computer Science

-
Image
Address Calculation in single (one) Dimension Array: Array of an element of an array say “A[ I ]” is calculated using the following formula: Address of A [ I ] = B + W * ( I – LB ) Where, B  = Base address W  = Storage Size of one element stored in the array (in byte) I  = Subscript of element whose address is to be found LB  = Lower limit / Lower Bound of subscript, if not specified assume 0 (zero) Example: Given the base address of an array  B[1300…..1900]  as 1020 and size of each element is 2 bytes in the memory. Find the address of  B[1700] . Solution: The given values are: B = 1020, LB = 1300, W = 2, I = 1700 Address of A [ I ] = B + W * ( I – LB ) = 1020 + 2 * (1700 – 1300) = 1020 + 2 * 400 = 1020 + 800 = 1820  [Ans] Address Calculation in Double (Two) Dimensional Array: While storing the elements of a 2-D array in memory, these are allocated contiguous memory locations. Therefore, a 2-D array mus...
Read more

ICSE CLASS 10 COMPUTER APPLICATION - Chapter 1: Concept of Objects

-
1.   Give two examples of real-world objects. Also specify their characteristics and behaviour. Ans. Real Life Objects Example1: Object Name:    Pen Characteristics: Company made, Colour, Body Shape and Nip. Behaviour: 1)       Used for writing. 2)       Used for correction 3)       Used for drawing or sketching Example 2: Object Name:      Dog Characteristics: Name, Colour and Breed. Behaviour: 1)       Barking 2)       Wagging its tail 3)       Running speed 2.   What do you understand by state of an object? Explain with an example. Ans. State of an object refers to the condition in which an object is in. Thus the values/attributes of its characteristics is represented For example, a book is an object, which may be either in “ope...
Read more

ISC Computer Science - Propositional Logic

-
Propositional Logic Logic  is a formal method of reasoning. A  proposition  is an elementary atomic sentence that may either be true or false but may take no other value. A  simple proposition  is one that does not contain any other proposition as a part. A  compound proposition  is one with two or more simple propositions as parts. An  operator  or  connective  joins simple propositions into compounds. Following are the various types of connectives: 1.     Disjunctive (OR) : It means at least one of the two arguments is true. OR is represented by + or ∨ . 2.     Conjunctive (AND) : It means that both the arguments are true. AND is represented by or & or ∧ . 3.     Conditional (Implication or If Then) : It means that if one argument is true then other argument is true. Implication is represented by ⇒ or → or ⊃ . 4.     Bi-conditional (Equivalen...
Read more

ICSE CLASS 10 COMPUTER APPLICATION - Chapter 2: The Java Phenomenon

-
1.   What is the significance of WWW? Ans. WWW or World Wide Web allows a huge pool of information (as web pages) to shared by multiple users over a World Wide Network (Internet) and the introduction of Java makes the web pages dynamic and interactive in a secured manner. 2.   What is Browsing? Ans. Browsing over the internet allows surfing through the internet, thus enabling the users to see information in different pages and interact with it. 3.   Name two types of Java programs. 4.   Why is Java choice for the Web? Ans. The introduction of active web pages makes Java an attractive addition to the web page. When we click on a web page containing a Java applet, it is not that we just read it, listen to it, or watch it– we can interact with it. The dynamic, interactive content to the web was brought about by Java: So much so web applications made in Java runs as if it is a computer program installed in the local computer. ...
Read more

Computer Science Paper 1 (Theory) - ISC 2018

-
Image
Computer Science Paper 1 (Theory) - ISC 2018 - Page-1 Computer Science Paper 1 (Theory) - ISC 2018 - Page-2 Computer Science Paper 1 (Theory) - ISC 2018 - Page-3 Computer Science Paper 1 (Theory) - ISC 2018 - Page-4 Computer Science Paper 1 (Theory) - ISC 2018  - Page-5 Computer Science Paper 1 (Theory) - ISC 2018 - Page-6 Computer Science Paper 1 (Theory) - ISC 2018 - Page-7 Computer Science Paper 1 (Theory) - ISC 2018 - Page-8 Computer Science Paper 1 (Theory) - ISC 2018 - Page-9
Read more

Important Programme in JAVA for Class 10 ICSE Board

-
Programme List 1-  Write a  program to print the first 15 numbers of the Pell series in JAVA Prgramming Language In mathematics, the Pell numbers are an infinite sequence of integers. The sequence of Pell numbers starts with 0 and 1, and then each Pell number is the sum of twice the previous Pell number and the Pell number before that.: thus, 70 is the companion to 29, and 70 = 2 × 29 + 12 = 58 + 12. The first few terms of the sequence are : 0, 1, 2, 5, 12, 29, 70, 169, 408, 985, 2378, 5741, 13860 2-  Write a programme to check whether a number is a MAGIC number or not?  
Read more