ICSE PROJECT CLASS – X
SUB: COMPUTER APPLICATIONS
DATE of SUBMISSION 09.07.2026)
(Procedure/Note: To Be Done in an Oxford File
Make Cover Page Write the program along with its
Make Index of programs with comments, variable description &
page no. output
Write Introduction Write Conclusion &
Acknowledgement
1. 197 is a Keith Number because it follows a specific pattern demonstrated
hereunder: -
197
Step 1
1+9+7
=17
Step 2
9+7+17
=33
Step 3
7+17+33
=57
Step 4
17+33+57
=107
Step 5
33+57+107
=197
2. Declare two double dimensional 4x4 matrices A and B respectively and
using scanner class store sixteen numbers each in both of them. Declare a
third matrix C of 4x4 nature and store the result in it by doing simple
calculation as shown below.
Matrix A Matrix B Resultant Matrix C
10 20 30 40 3 5 7 9
13 25 37 49
50 60 70 80 2 4 9 1
48 56 61 79
80 90 30 50 2 3 5 7
82 93 35 57
40 20 60 90 4 6 8 9
36 14 52 81
Note: Figures in 0 t h and 2 n d row in the resultant matrix C are
obtained by adding corresponding numbers in matrix A and B
whereas figures in 1 s t and 3 r d row in the resultant matrix C are
obtained by subtracting corresponding numbers in matrix A & B.
3. Amicable numbers are two different numbers so related that
the sum of the proper divisors of each is equal to the other nu mber.
For example, the smallest pair of amicable numbers is ( 220, 284); for
the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110,
of which the sum is 284; and the proper divisors of 284 are 1, 2, 4, 71
and 142, of which the sum is 220.
A Happy number is defined by the following process: Starting with
any positive integer, replace the number by the sum of the squares of
its digits, and repeat the process until the number equals 1.
For example, 19 is happy, as the associated sequence is:
12 + 92 = 82
2 2
8 + 2 = 68
2 2
6 + 8 = 100
2 2 2
1 + 0 + 0 =1
Write a menu driven program using switch -case to send either
character ‘A’ or ‘H’ as parameter and input the numbers to check if it
an Amicable Number or Happy number or none of these.
4. Write a program to print the sum of the terms in the series mentioned
below: -
s=x 2 +
Note: The value of n must be an even number. In case if it’s an odd
number then print the message – “Not possible”.
5. n is a perfect number if the sum of the factors of the number includi ng
1 and excluding itself is n.
For example,
6 =1+2+3 and
28=1+2+4+7+14
Define a class called numberProblems which has the following
functions:
int nthPrime(int n) - method that returns the nth prime number
give as parameter.
void perfectNosBelow(int li m) - which first prints out the nth prime numb er
given as limit and then prints all perfect
numbers less than lim.
Each perfect number should be printed on a
separate line along with its factors. For e.g.
the output from perfectNosBelow(500) will be:
500th prime number=3571
6 = (1,2,3)
28 = (1,2,4,7,14)
496= ( (1, 2, 4, 8, 16, 31, 62, 124, 248)
6. Write a program to search a name in the array and print it along with the
roll number. For e.g.
Names in the array are Ashoke, Vijay, Raman, Karim, Aman
Roll numbers in the array are 5, 48, 40, 25, 2
Searched name: Raman
Roll Number 40
7. Write a menu driven program using switch – case so that the computer
prints either a pattern or calculate the sum of the prime factors of a
number input as parameter.
Choice 1 - Choice 2 -
1 To calculate the sum of the
3 2 prime factors of a number input
6 5 4 as parameter
10 9 8 7 For e.g.
Input: 30
(It’s a left aligned pattern) Output:
Sum of the prime factors
=2+3+5
=10
8. Define a class called mobike with the following description:
Instance variable/data members:
int bno - to store the bikes number
int phno - to store the phone number of the customer
String name - to store the name of the customer
int days - to store the number of days the bike is taken on rent
int charge - to calculate and store the rental charge
Member methods:
void input() - to input and store the deta il of the customer
void compute() - to compute the rental charge
The rent for a mobike is charged on the following basis:
First five days - Rs 500 per day
Next five days - Rs 400 per day
Rest of the days- Rs 200 per day
void display() - to display the details in the following format:
Bike No. Phone No. Name No. of Days Charge
---------- ------------- ---------- --------------- ----------
9. Design a class ShowTime to overload a function named display() to produce
the following output:
(i) void display (int x, int n) with two integer arguments and print the sum of
the series,
sum =
(ii) void display (String word) with one String argument & print the
following using String function:
Length of the word
The last letter/character of the word
New word leaving the starting alphabet
For e.g.
Input: Pray
Output:
Length of the word =4
The last letter of the word =y
New string leaving the starting alphabet = ray
[Note: In the second part, use appropriate String functions along with
[Link]() statement to print the output]
10. Write a program to enter a mixture of 10 positive even and odd numbers
in a single dimension array. Break the array into two different parts and
print the numbers in ascending order of even and odd numbers separately.
For e.g.
Input:
77 89 63 258 452 10 846 159 2 74
Output:
Even Array: Odd Array
2 10 74 258 452 846 63 77 89 159
11. Write a program to input 4 names of four characters length in a single
dimension array using scanner class. Add and print the ASCII value of each
letter in individual names as demonstrated in the example . Finally compare
the values and print the name with highest ASCII total. For e.g.
JACK = 74 + 65 + 67 + 75 = 281
SONY = 83 + 79 + 78 + 89 = 329 The Winner is Sony with 329 points
JOHN = 74 + 79 + 72 + 78 = 303
TINA = 84 + 73 + 78 + 65 = 300
While doing the program care must be taken that: -
(i) The names should be of 4 letters only
(ii) Calculation should be done on the basis of all the Upp ercase or Lowercase
letters.
12. Define a class to accept values into an integer array of order 4 x 4 and
check whether it is a DIAGONAL array or not. An array is DIAGONAL if the
sum of the left diagonal elements equals the sum of the right diagonal
elements. Print the appropriate message.
Example:
3425 Sum of the left diagonal elements = 3+5+2+1=11
2523
5327 Sum of the right diagonal elements = 5+2+3+1=11
1371
13. Design a class to overload a function compare() as follows:
void compare(int, int) — to compare two integers values and print the
greater of the two integers.
void compare(char, char) — to compare the numeric value of two
characters and print with the higher numeric
value.
void compare(String, String) — to compare the length of the two strings and
print the longer of the two.
14. Write a program to print the sum of the terms in the series : -
Note:
For denominator operation, find the factorial of denominator first, and
then its square root.
15. A class numMagic contains two methods Niven() and Digit(), the
description of which is given below: -
boolean Niven(int n) - returns true if the number passed as parameter is a
Niven number or returns false if it is not. A Niven
number is divisible by the sum of its digits.
For e.g., if the number is 6804 then the method returns
true since 6804 is divisible by 18, whereas if the number
is 431 then the method returns false.
int Digit(int num) - returns the sum of the number as shown below: -
For e.g. if the number is 563 then it returns,
=5+6+3
=11+3
=14
Write a program in Java to define the above two methods by creating the
object of the class.
16. Write a program to print all the three -digit Keith Numbers. A Smith number
is a composite number, whose sum of the digits is equal to the sum of its
prime factors.
For example:
4, 22, 27, 58, 85, 94, 121 ………. are Smith numbers.
Write a program in Java to enter a number and check whether it is a Smith
number or not.
Sample Input: 666
Sum of the digits: 6 + 6 + 6 = 18
Prime factors are: 2, 3, 3, 37
Sum of the digits of the prime factors: 2 + 3 + 3 + (3 + 7) = 18
Thus, 666 is a Smith Number.
17. Define a class TaxiMeter having the following description:
Data member / instance varia ble
int taxino – to store taxi number
String name – to store passenger’s name
int km – to store number of kilometers travelled
Member functions
TaxiMeter() – constructor to initialize taxino to 0, name to “ ” and b
to 0
input() – to store taxino, name and km
calculate – to calculate bill for a customer according to given
conditions:
Kilometers travelled (km) Rate / km
1 km Rs 25
2 km to 6 km Rs 10 per km
7 km to 12 km Rs 15 per km
13 km to 18 km Rs 20 per km
More than 18 km Rs 25 per km
display() – to display the details in the following format:
Taxino Passenger’s Name Kilometers Travelled Bill Amount
--- --- --- ---
18. Class Specification:
Class Name: Extraordinary
Members:
int number – to store the original number
int reverse – to store the reverse of the number
Constructor:
Extraordinary(int n) – a parameterized constructor to assign number = n and initialize
other members.
Member Methods:
int findReverse(int n) – method to find and return the reverse of a number.
int sumOfSquares(int n) – method to return the sum of the square of digits of a no.
void check() – method to:
Calculate reverse of the number,
Find sum = number + reverse,
Find product = number * reverse,
Find sum of squares of digits of product,
Display app ropriate messages:
If sum == sum of squares th en print "Extraordinary Number"
else print "Not an Extraordinary Number"
Write the main method to:
Create an object of the class by taking user input.
Call the check() method.
Example:
Input: 12
Reverse: 21
Sum = 12 + 21 = 33
Product = 12 × 21 = 252
Sum of squares of digits of product = 2² + 5² + 2² = 4 + 25 + 4 = 33
Since Sum == Sum of Squares → Output: Extraordinary Number
19. Write a program to input nine numbers in a 3x3 matrix using scanner class
and then find out the transpose of the matrix. In a transposed matrix, the numbers
in the row are found in the column and vice – versa. For e.g.
25 3 19 25 36 91
36 27 70 3 27 58
91 58 47 19 70 47
20. Write a program to store a sentence in a string type of varia ble and count the
number of THE present in it after converting it into uppercase.
Example 1:
Input:
The great soccer player nicknamed The Black Pearl was named after the American
inventor Thomas Edison.
Output:
Total number of T HE in the sentence = 3
Example 2:
Input:
The allied forces defeated the Germans in the World War II
Output:
Total number of THE in the sentence = 3
Note: Ignore case while counting total number of ‘THE’.
---Best of Luck---