Home

Computer Applications ICSE Solved Papers, Sample Papers, Model Solutions, Solved Theory Questions, Operators, Precedence, Arrays, Wrapper Classes, Inheritance, Polymorphism, etc.

Dear Students

This portal covers the Computer Applications ICSE syllabus for Standard IX and X. It includes Computer Applications ICSE Board Papers, Computer Applications ICSE Solved Papers, Bonus Questions, likely ICSE computer applications projects, and sample questions.

The mission is simple: to help the student prepare and maximize his return for the Computer Applications I.C.S.E. examination.

Your feedback is appreciated and I can be reached on pheru8a@gmail.com.

Regards

Ajay Pherwani

42 thoughts on “Home

    1. I cant predict the questions. They become tougher each year. Please go through my set of sample questions and solved papers.

  1. Please include more output programs and snippets especially on iterations. It will help me seek a solution to the major problems I face. Please post them as soon as possible.
    My ICSE exam is drawing nearer.

  2. This was really very very very helpfull for my revision just 1 day before the exam so really hats off :))))))))))

  3. hats off for your great effort.
    Sir,I wanted to know whether I can ask my doubts from you and will you reply the solutions?? .Please reply if possible as board exams are nearing!!thanks.

      1. thank you very much sir.
        I am finding difficulty in making the following program–>
        Find the prime number which is nearest to the entered number.
        1)FOR EXAMPLE–>number entered=25
        OUTPUT–>Nearest prime number is 23.
        2)1)FOR EXAMPLE–>number entered=28
        OUTPUT–>Nearest prime number is 29.
        Sir,tomorrow I have a test and i expect this question to come for 15 marks.
        I would be highly pleased and obliged if you can reply today itself.

        1. import java.util.Scanner;
          class prime_number
          {
          boolean check_for_prime(int n)
          {
          int factor=0;
          for(int i=n-1;i>1;i–)
          {
          if(n%i==0)
          {
          factor++;
          break;
          }
          }
          if(factor==0)
          {
          return true;
          }
          else
          {
          return false;
          }
          }
          public static void main(String[] args)
          {
          Scanner s = new Scanner(System.in);
          prime_number p = new prime_number();
          System.out.println(“Enter the number”);
          int n=s.nextInt();
          int lower_prime=0,upper_prime=0,lower_difference=0,upper_difference=0;
          for(int i =n-1;i>1;i–)
          {
          if(p.check_for_prime(i))
          {
          lower_prime=i;
          lower_difference=n-lower_prime;
          break;
          }
          }
          for(int i=n+1;;i++)
          {
          if(p.check_for_prime(i))
          {
          upper_prime=i;
          upper_difference=upper_prime-n;
          break;
          }
          }
          if(upper_difference<lower_difference)
          {
          System.out.println(upper_prime);
          }
          else
          {
          System.out.println(lower_prime);
          }
          }

          }

        2. Let n be the input.

          int diff1 = 0, diff2=0;
          for(int I = n; i >0; i++)
          If( isPrime(i) ){
          diff1 = i – n;break;}

          for(int I = n; i >0; i–)
          If( isPrime(i) ){
          diff1 = n – i;break;}

          If( diff1 > diff2 )
          System.out.println(“Nearest prime number is “+ (n + diff2) );
          Else
          System.out.println(“Nearest prime number is “+ (n + diff1) );

  4. IT’S NOT FAIR ;;.We are still in 10th std and for us you have given such HUGE programs .that we cannot learn also and so confusing .its all complicated and really damn bad.. ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

    1. Dear Akash

      You need to practice, young man. It is best to get difficult questions here than in the examination!

      regards

      Ajay

    1. Dear Goutham

      The chances of Journal and Bonus questions coming is remote. The rest are likely candidates. I believe the questions get tougher each year and I have made some sample papers intentionally tough

      regards
      Ajay

  5. Sir,

    Is it OK if we learn only the 2 types of sort and 2 types of search techniques for boards for Array Programs.

    1. Dear Raj Shah

      I believe so, yes. But you need to learn them for all primitive data types, not just int.

      regards

      Ajay

  6. Dear Ajay sir,
    I am posting my program for checking the nearest prime of the entered number.
    Its a request,please do check it and please tell if there are any errors and what improvisations can be made.
    Regards,
    Vansh Sodhi.

    class nearestprime
    {
    public int prime(int num)
    {
    int c=0;
    for(int i=2;i<num;i++)
    {
    if(num%i==0)
    c++;
    }
    if(c==0)
    return 0;
    else
    return 1;
    }
    public static void main(int n)
    {
    int a=0,b=0,f=0;
    nearestprime ob1=new nearestprime();
    nearestprime ob2=new nearestprime();
    a=b=n;
    do
    {
    a–;
    b++;
    if(ob1.prime(a)==0&&(ob2.prime(b)!=0))
    {
    System.out.println("Nearest prime="+a);
    f=1;
    break;
    }
    else if((ob1.prime(a)!=0)&&ob2.prime(b)==0)
    {
    System.out.println("Nearest prime="+b);
    f=1;
    break;
    }
    else if(ob1.prime(a)==0&&ob2.prime(b)==0)
    {
    System.out.println("Nearest primes="+a+" and "+b);
    f=1;
    break;
    }
    }
    while(f==0);
    }
    }

    1. Yeah your programme is absolutely correct. But your programme be that lengthy , you can cut it short by reducing the last 2 conditions to 1, and need not declare f=1.

      1. Hey, thanks Srinijay!!!I couldn’t understand how to reduce the last two conditions to 1???Can you please send an explanation as a reply?
        Regards,
        Vansh Sodhi.

    2. The prime number can be checked much more efficiently if we check for 2 exclusively because it’s the only even prime number. Then instead of taking the loop from 1 to n, the loop should be taken from 3 to the sqrt(n) or n/2 in steps of 2. Upto square root because after the square root the factors repeat. If 100 is 115 is divisible by 5 (5×23) why divide it by 23?
      Also since even number other than 2 cannot be prime why divide it by even numbers?
      I wrote a blog post on this logic once which can be found at http://www.vinaysingh.info/prime-time/

      1. Thanks Vinay. I have kept the solution simple taking into account the age group of the students.

  7. Dear Sir,

    Could you please explain to me a bit more intricately about this question from icse 2013?
    Please follow suit:
    int ctr = 0;
    for(int i=1;i<=5;i++)
    for(int j=1;j<=5;j+=2)
    ++ctr;

  8. Hi,
    On 14th march 2014 I am going to write my 10th exam, plz tell what are the important questions which I should revise.

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>