## Std 9 Computer Project, 2014

0

- 10 Java Programs covering up the programs as listed below.
- The programs are to be written in Java with Blue J as environment.
- You need to submit complete project work, incomplete assignments won’t be accepted.
- The first page of the Project Work (Cover Page) must contain your name, class, section, roll number along with header COMPUTER PROJECT WORK clearly printed in bold.
- Page 3 must be the Contents Page of your project work.
- An Introduction to the project follows the Contents Page.
- All pages must be numbered starting with 1 as the Intro.
- All programs must be furnished with —
- Program Question
- Source Code
- Sample Input / Output

- Variable Description this is not compulsory.
- All projects must be printed in B/W or color (handwritten projects will not be accepted).
- Avoid usage of unwanted illustrations and decorations.
- The project question contents can be downloaded from https://nilabja.wordpress.com/loyola/std9-project-2014/
- Date of submission of project work is
**15**^{th}December 2014.

PROJECT PROGRAMS FOR STD 9

- Write a program in Java to input a number and check whether it is a
**Prime Number**or not. A Prime Number is one which has got only two factors (1 & itself) e.g. 3, 5, 7 etc… any number having more than two factors is called a Composite Number e.g. 10, 12, 100 etc…

- Write a program in Java to input a number and check whether it is a
**Buzz Number**or not, A Buzz number is one which is either divisible by 7 or ends with 7 or both, e.g. 21, 17, 77 etc…

- Write a program in Java to input a number and check whether it is a
**Perfect Number**or not, a Perfect Number is one whose sum of factors excluding the number is equal to the number, e.g. 6 as factors of 6 excluding 6 is 1,2,3 and 1+2+3 = 6.

- Write a program in Java to input a number and check whether it is a
**Krishnamurthy Number**or not, a Krishnamurthy number is one whose sum of factorial of digits of the number is equal to the number, e.g. 145 as, 1! + 4!+ 5! = 1 + 24 + 120 = 145.

- Write a program in Java to input a number and check whether it is an
**Armstrong Number**or not, an Armstrong Number is one whose sum of cubes of digits of the number is equal to the number, e.g. 153 as we see that 1^{3}+ 5^{3}+ 3^{3 }= 1 + 125 + 27 = 153.

- Write a program in Java to input a number and check whether it is a
**Palindrome Number**or not, a Palindrome Number is one which reads the same from both the ends, e.g. 121, 555 etc…

- Write a program in Java to input a number and check whether it is a
**A****micable Number Pair**or not, an Amicable Pair is one in which the sum of factors of the first number excluding itself is equal to the second number and the sum of factors of the second number excluding itself is equal to the first e.g. 220 and 284.

- Write a program in Java to input a number and check whether it is an
**Automorphic Number**or not, ‘n’ is an Automorphic number if the digits of the square of the number (n^{2}) matches from the right hand side with that of the original number, e.g. 25 as we can see that, 25^{2}= 625 where the last two digits (25) matches the original number.

- Write a program in Java to input two number and check whether it is
**Twin Prime Number**or not, a Twin Prime number is one in which both the numbers are Prime and the difference between the numbers is equal to 2, for e.g. 5 and 7 as they both are Prime and the difference between them is equal to 2.

- Write a program in Java to input a number and check whether it is a
**Sunny Number**or not, a Sunny number is one which is one less than a perfect square (a perfect square is one whose square root is a whole number with no fractional part) for e.g. 8 as we see that 9 is a perfect square coz, √9 = 3.0 and 9 – 1 = 8 so 8 is a Sunny Number.