Grade 12 Computer Science Project Work 2025 26
Grade 12 Computer Science Project Work 2025 26
GENERAL INFORMATION:
Candidates will be required to submit a work file containing the practical work related to programming
assignments done during the year.
Students are expected to do a minimum of thirty assignments for the year based on the syllabus
Here are some of the best Computer Science assignments ideas for you:
Assignment 1
A Composite Magic number is a positive integer which is composite as well as a magic number.
Composite number: A composite number is a number which has more than two factors.
For example:
Factors of 10 are: 1, 2, 5, 10
Magic number: A Magic number is a number in which the eventual sum of the digit is equal to 1.
For example: 28 = 2+8=10= 1+0=1
Accept two positive integers 'm' and 'n', where m is less than n. Display the number of composite magic integers that
are in the range between m and n (both inclusive) and output them along with frequency, in the format specified
below:
Sample Input:
m=10 n=100
Output: The composite magic numbers are 10,28,46,55,64,82,91,100
Frequency of composite magic numbers: 8
Sample Input:
m=120 n=90
Output: Invalid input
Assignment 2
Write a Program in Java to input a number and check whether it is a Fascinating Number or not.
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
Fascinating Numbers: Some numbers of 3 digits or more exhibit a very interesting property. The property is such that,
when the number is multiplied by 2 and 3, and both these products are concatenated with the original number, all
digits from 1 to 9 are present exactly once, regardless of the number of zeroes.
Let's understand the concept of Fascinating Number through the following example:
Consider the number 192
192 x 1 = 192
192 x 2 = 384
192 x 3 = 576
Concatenating the results: 192 384 576
It could be observed that '192384576' consists of all digits from 1 to 9 exactly once. Hence, it could be concluded that
192 is a Fascinating Number. Some examples of fascinating Numbers are: 192, 219, 273, 327, 1902, 1920, 2019 etc.
Assignment 3
A number is said to Bouncy number if the digits of the number are unsorted.
For example,
22344 - It is not a Bouncy number because the digits are sorted in ascending order.
774410 - It is not a Bouncy number because the digits are sorted in descending order.
155349 - It is a Bouncy number because the digits are unsorted.
A number below 100 can never be a Bouncy number.
Write a program in java to accept a number. Check and display whether it is a Bouncy number or not.
Assignment 4
An Evil number is a positive whole number which has even number of 1's in its binary equivalent. Example: Binary
equivalent of 9 is 1001, which contains even number of 1's. A few evil numbers are 3, 5, 6, 9…. Design a program to
accept a positive whole number and find the binary equivalent of the number and count the number of 1's in it and
display whether it is a Evil number or not with an appropriate message. Output the result in format given below:
Example 1
Input: 15
Binary Equivalent: 1111
No. of 1's: 4
Output: Evil Number
Example 2
Input: 26
Binary Equivalent: 11010
No. of 1's: 3
Output: Not an Evil Number
Assignment 5
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.
Assignment 6
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.
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
Assignment 7
Write a program to declare a matrix a[][] of order (m × n) where 'm' is the number of rows and 'n' is the number of
columns such that the values of both 'm' and 'n' must be greater than 2 and less than 10. Allow the user to input
integers into this matrix. Perform the following tasks on the matrix:
Display the original matrix.
Sort each row of the matrix in ascending order using any standard sorting
technique. Display the changed matrix after sorting each row.
Test your program for the following data and some random data:
Assignment 8
The names of the teams participating in a competition should be displayed on a banner vertically, to accommodate
as many teams as possible in a single banner. Design a program to accept the names of N teams, where 2 < N <
9 and display themin vertical order, side by side with a horizontal tab (i.e. eight spaces).
Test your program for the following data and some random data:
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
Assignment 9
A company manufactures packing cartons in four sizes, i.e. cartons to accommodate 6 boxes, 12 boxes, 24 boxes
and 48 boxes. Design a program to accept the number of boxes to be packed (N) by the user (maximum up to 1000
boxes) and display the break-up of the cartons used in descending order of capacity (i.e. preference should be given
to the highest capacity available, and if boxes left are less than 6, an extra carton of capacity 6 should be used.)
Test your program with the following data and some random data:
Example 1
INPUT:
N = 726
OUTPUT:
48 * 15 = 720
6*1=6
Remaining boxes = 0
Total number of boxes =
726Total number of
cartons = 16
Example 2
INPUT:
N = 140
OUTPUT:
48 * 2 = 96
24 * 1 = 24
12 * 1 = 12
6*1=6
Remaining boxes = 2 * 1 =
2 Total number of boxes =
140 Total number of
cartons = 6
Example 3
INPUT:
N = 4296
OUTPUT:
INVALID INPUT
Assignment 10
The result of a quiz competition is to be prepared as follows:
The quiz has five questions with four multiple choices (A, B, C, D), with each question carrying 1 mark for the
correct answer. Design a program to accept the number of participants N such that N must be greater than 3
and less than 11. Create a double-dimensional array of size (Nx5) to store the answers of each participant row-
wise. Calculate the marks for each participant by matching the correct answer stored in a single-dimensional array
of size 5. Display the scores for each participant and also the participant(s) having the highest score.
Example: If the value of N = 4, then the array would be:
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
Q1 Q2 Q3 Q4 Q5
Participant 1 A B B C A
Participant 2 D A D C B
Participant 3 A A B A C
Participant 4 D C C A B
Key to the question: D C C B
ANote: Array entries are line fed (i.e. one entry per line)
Test your program for the following data and some random data.
Example 1
INPUT:
N=5
Participant 1 D A B C C
Participant 2 A A D C B
Participant 3 B A C D B
Participant 4 D A D C B
Participant 5 B C A D D
Key: B C D A A
OUTPUT:
Scores:
Participant 1 = 0
Participant 2 = 1
Participant 3 = 1
Participant 4 = 1
Participant 5 =
2Highest
Score:
Participant 5
Example 2
INPUT:
N=4
Participant 1 A C C B D
Participant 2 B C A A C
Participant 3 B C B A A
Participant 4 C C D D B
Key: A C D B B
OUTPUT:
Scores:
Participant 1 = 3
Participant 2 = 1
Participant 3 = 1
Participant 4 =
3Highest
Score:
Participant 1
Participant 4
Example 3
INPUT:
N = 12
OUTPUT:
INPUT SIZE OUT OF RANGE.
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
Assignment 11
Caesar Cipher is an encryption technique which is implemented as ROT13 ('rotate by 13 places'). It is a simple
letter substitution cipher that replaces a letter with the letter 13 places after it in the alphabets, with the other
characters remainingunchanged.
ROT13
A/a B/b C/c D/d E/e F/f G/g H/h I/i J/j K/k L/l M/m
↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕
N/n O/o P/p Q/q R/r S/s T/t U/u V/v W/w X/x Y/y Z/z
Write a program to accept a plain text of length L, where L must be greater than 3 and less
than 100.Encrypt the text if valid as per the Caesar Cipher.
Test your program with the sample data and some random data.
Example 1
INPUT:
Hello! How are you?
OUTPUT:
The cipher text is:
Uryyb! Ubj ner lbh?
Example 2
INPUT:
Encryption helps to secure data.
OUTPUT:
The cipher text is:
Rapelcgvba urycf gb frpher qngn.
Example 3
INPUT:
You
OUTPUT:
INVALID LENGTH
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
Assignment 12
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 1 and itself.
Example:
131
311
113
Hence, 131 is a circular prime.
Accept a positive number N and check whether it is a circular prime or not. The new numbers formed after the
shifting ofthe digits should also be displayed.
Test your program with the following 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.
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
Assignment 13
Write a program to declare a square matrix A[][] of order (M × 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:
Sort the non-boundary elements in ascending order using any standard sorting technique and rearrange them in
the matrix. Calculate the sum of both the diagonals.
Display the original matrix, rearranged matrix and only the diagonal elements of the rearranged matrix with
their sum. Test your program for the following 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
Example 2
INPUT:
M=5
7 4 1 9 5
8 2 6 10 19
13 1 3 5 1
10 0 5 12 16
1 8 17 6 8
OUTPUT:
ORIGINAL MATRIX
7 4 1 9 5
8 2 6 10 19
13 1 3 5 1
10 0 5 12 16
1 8 17 6 8
REARRANGED MATRIX
7 4 1 9 5
8 0 1 2 19
13 3 5 5 1
10 6 10 12 16
1 8 17 6 8
DIAGONAL
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
ELEMENTS
7 5
0 2
5
6 12
1 8
SUM OF THE DIAGONAL ELEMENTS = 46
Example 3
INPUT:
M=3
OUTPUT:
THE MATRIX SIZE IS OUT OF RANGE.
Assignment 14
Write a program to accept a sentence which may be terminated by either '.', '?' or '!' only. The words may be
separated bymore than one blank space and are in UPPER CASE.
Perform the following tasks:
Find the number of words beginning and ending with a vowel.
Place the words which begin and end with a vowel at the beginning, followed by the remaining words as they
occur in thesentence.
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
Assignment 15
Write a Program in Java to fill a 2D array with the first 'mxn' prime numbers, where 'm' is the number of rows
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
and 'n' is the number of columns.
For example:
If rows = 4 and columns = 5, then the result should be:
2 3 5 7 11
13 17 19 23 29
31 37 41 43 47
53 59 61 67 71
Assignment 16
Write a program to create a double dimensional array of size n x m. Input the numbers in first (n-1) x (m-1)
cells. Find and place the sum of each row and each column in corresponding cells of last column and last row
respectively. Finally, display the array elements along with the sum of rows and columns.
Sample Input
10 15 16 18
15 14 12 11
11 12 16 17
12 10 14 16
Sample Output
10 15 16 18 59
15 14 12 11 52
11 12 16 17 56
12 10 14 16 52
48 51 58 62
Assignment 17
Write a program in Java to create a 4 x 4 matrix. Now, swap the elements of 0th row with 3rd row
correspondingly. Display the result after swapping.
Sample Input
55 33 26 14
81 86 31 10
58 64 17 12
Sample Output
22 14 23 25
81 86 31 10
58 64 17 12
55 33 26 14
Assignment 18
Write a program in Java to store the elements in two different double dimensional arrays (in matrix form) A
and B each of order 4 x 4. Find the product of both the matrices and store the result in matrix C. Display the
elements of matrix C. Note:
Two matrixes can be multiplied only if the number of columns of the first matrix must be equal to the number of
rows ofthe second matrix.
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
Sample Input: Matrix A
3 2 1 2
6 4 5 0
7 -1 0 2
4 3 1 1
Assignment 19
1. Write a program to declare a square matrix A [ ] ] of order N (N<20).
2. Allow the user to input positive integers into this matrix. Perform the following tasks on the matrix.
3. Output the original matrix.
4. Find the SADDLE POINT for the matrix. A saddle point is an element of the matrix such that it is the
minimum element for the row and the maximum element for the column to which it belongs. Saddle
point for a given matrix is always unique. If the matrix has no saddle point, output the message "NO
SADDLE POINT".
5. If the matrix has a saddle point element then sort the elements of the left diagonal in ascending
order usinginsertion sort technique. All other elements should remain unchanged.
Test your program for the following data and some random
data:Sample data:
Input: n = 4
Matrix A[ ][ ]
2 5 6 9
8 4 12 3
6 7 3 1
12 24 2 11
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
Output:
Matrix A[ ][ ]
2 5 6 9
8 4 12 3
6 7 3 1
12 24 2 11
No Saddle Point
Matrix after sorting the Principal diagonal:
2 5 6 9
8 3 12 3
6 7 4 1
12 24 2 11
Input:
n=3
Matrix A[ ][ ]
4 6 12
2 8 14
1 3 6
Output:
Matrix A[ ][ ]
4 6 12
2 8 14
1 3 6
Saddle Point = 4
Matrix after sorting the Principal diagonal:
4 6 12
2 6 14
1 3 8
Assignment 20
Write a program to input N and M number of names in two different single dimensional arrays A and B
respectively, such that none of them have duplicate names. Merge the arrays A and B into a single array C,
such that the resulting array is sorted alphabetically. Display all the three arrays.
Test your program for the following data and some random
data:Sample data:
Input:
Enter the names in array A, N = 2
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
Enter the names in array B, M
= 3 First array: A
Suma
nAnil
Second array:
BUsha
Sachin
John
Output
:
Sorted Merged array:
C Anil
John
Sachi
n
Suma
nUsha
Sorted First array: A
Anil
Suman
Sorted Second array:
BJohn
Sachi
n
Usha
Assignment 21
Numbers have different representations depending on the bases on which they are expressed. For example, in
base 3, thenumber 12 is written as 110 (1 x 32 + 1 x 31 + 0 x 30) but base 8 it is written as 14 (1 x 81 + 4 x 80).
Consider for example, the integers 12 and 5. Certainly these are not equal if base 10 is used for each. But
suppose, 12 was a base 3 number and 5 was a base 6 number then, 12 base 3 = 1 x 31 + 2 x 30, or 5 base 6 or
base 10 (5 in any base is equal to 5 base 10). So, 12 and 5 can be equal if you select the right bases for each of
them.
Write a program to input two integers x and y and calculate the smallest base for x and smallest base for y
(likely different from x) so that x and y represent the same value. The base associated with x and y will be
between 1 and 20 (both inclusive). In representing these numbers, the digits 0 to 9 have their usual decimal
interpretations. The upper caseletters from A to J represent digits 10 to 19 respectively.
Test your program for the following data and some random
data.Sample Data
Input:
x=12, y=5
Output:
12 (base 3)=5 (base 6)
Input:
x=10, y=A
Output:
10 (base 10)=A (base 11)
Input:
x=12, y=34
Output:
12 (base 17) = 34 (base
5)
[∵ 34 (base 2) is not valid as only 0 & 1 are allowed in base
2] Input:
x=123, y=456
Output:
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
123 is not equal to 456 in any base between 2
to 20 Input:
x=42, y=36
Output:
42 (base 7) = 36 (base 8)
Assignment 22
The manager of a company wants to analyze the machine usage from the records to find the utilization of the
machine. He wants to know how long each user used the machine. When the user wants to use the machine, he
must login to the machine and after finishing the work, he must logoff the machine.
Each log record consists of:
User Identification
number Login time and
date Logout time and
date Time consists of:
Hours
Minutes
Date consists of:
Day
Month
You may assume all logins and logouts are in the same year and there are 100 users at the most. The time
format is 24hours.
Design a program:
(a) To find the duration for which each user logged. Output all records along with the duration in hours
(format hours:minutes).
(b) Output the record of the user who logged for the longest duration. You may assume that no user will login
for more than 48 hours.
Test your program for the following data and some random data.
Sample Data
Input:
Number of users: 3
User Identification
Login Time and Date Logout Time and Date
20:10 20-12 2:50 21-12
12:30 20-12 12:30 21-12
16:20 20-12 16:30 20-12
Duration
User Identification Login Time and Date Logout Time and Date
Hours:Minutes
149 20:10 20-12 2:50 21-12 6:40
173 12:30 20-12 12:30 21-12 24:00
142 16:20 20-12 16:30 20-12 00:10
Output:
The user who logged in for longest duration:
173 12:30 20-12 12:30 21-12 24:00
Assignment 23
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
Write a program to accept a date in the string format dd/mm/yyyy and accept the name of the day on 1st of
January of the corresponding year. Find the day for the given date.
Example:
Input:
Date: 5/7/2001
Day on 1st January :
MONDAY Output:
Day on 5/7/2001 : THURSDAY
Run the program on the following inputs:
Assignment 24
A wondrous square is an n by n grid which fulfils the following conditions:
1. It contains integers from 1 to n2, where each integer appears only once.
2. The sum of integers in any row or column must add up to 0.5 x n x (n2 + 1).
For example, the following grid is a wondrous square where the sum of each row or column is 65 when n=5.
17 24 1 8 15
23 5 7 14 16
4 6 13 20 22
10 12 19 21 3
11 18 25 2 9
Write a program to read n (2 <= n <= 10) and the values stored in these n by n cells and output if the grid
represents awondrous square.
Also output all the prime numbers in the grid along with their row index and column index as shown in the
output. A natural number is said to be prime if it has exactly two divisors. For example, 2, 3, 5, 7, 11 The first
element of the given grid i.e. 17 is stored at row index 0 and column index 0 and the next element in the row i.e.
24 is stored at row index 0 and column index 1.
Test your program for the following data and some random
data: Input:
n=4
16 15 1 2
6 4 10 14
9 8 12 5
3 7 11 13
Output:
Yes, it represents a wondrous square
Prim Row Column Index
e Index
2 0 3
3 3 0
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
5 2 3
7 3 1
11 3 2
13 3 3
15 0 1
Input: n = 3
1 2 4
3 7 5
Output:
Not a wondrous square
Prim Row Column Index
e Index
2 0 1
3 1 0
5 1 2
7 1 1
Input:
n=2
2 3
3 2
Output: Not a wondrous square
Prime Row Column Index
Index
2 0 0
2 1 1
3 0 1
3 1 0
Assignment 25
Write a program to input two valid dates, each comprising of Day (2 digits), Month (2 digits) and Year (4
digits) andcalculate the days elapsed between both the dates.
Test your program for the following data values:
(a) FIRST
DATE: Day:
24 Month: 09
Year: 1960
SECOND DATE:
Day: 08
Month: 12
Year: 1852
Output:
xxxxxxxx
(these are actual number of days elapsed)
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
(b) FIRST
DATE: Day:
10 Month: 01
Year: 1952
SECOND DATE:
Day: 16
Month: 10
Year: 1952
Output:
xxxxxxxx
(these are actual number of days elapsed)
Assignment 26:
A Prime-Adam integer is a positive integer (without leading zeros) which is a prime as well as an
Adam number. Prime number: A number which has only two factors, i.e. 1 and the number itself.
Example 1
INPUT:
m=5
n = 100
OUTPUT:
THE PRIME-ADAM INTEGERS
ARE: 11 13 31
FREQUENCY OF PRIME-ADAM INTEGERS IS: 3
Example 2
INPUT:
m = 100
n = 200
OUTPUT:
THE PRIME-ADAM INTEGERS
ARE: 101 103 113
FREQUENCY OF PRIME-ADAM INTEGERS IS: 3
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
Example 3
INPUT:
m = 50
n = 70
OUTPUT:
THE PRIME-ADAM INTEGERS ARE:
NIL
FREQUENCY OF PRIME-ADAM INTEGERS IS: 0
Example 4
INPUT:
m = 700
n = 450
OUTPUT:
INVALID INPUT
Assignment 27
Write a program to declare a matrix A[][] of order (M x N) where 'M' is the number of rows and 'N' is the number
of columns such that the value of 'M' must be greater than 0 and less than 10 and the value of 'N' must be greater
than 2 and less than 6. Allow the user to input digits (0 - 7) only at each location, such that each row represents an
octal number.
Example:
2 3 1 (decimal equivalent of 1st row = 153 i.e. 2x82 + 3x81 + 1x80)
4 0 5 (decimal equivalent of 2nd row = 261 i.e. 4x82 + 0x81 + 5x80)
1 5 6 (decimal equivalent of 3rd row = 110 i.e. 1x82 + 5x81 +
6x80)Perform the following tasks on the matrix:
Display the original matrix.
Calculate the decimal equivalent for each row and display as per the format given
below. Test your program for the following data and some random data:
Example 1:
INPUT:
M=1
N=3
ENTER ELEMENTS FOR ROW 1: 1 4 4
OUTPUT:
FILLED MATRIX DECIMAL
EQUIVALENT 1 4 4 100
Example 2:
INPUT:
M=3
N=4
ENTER ELEMENTS FOR ROW 1: 1 1 3 7
ENTER ELEMENTS FOR ROW 2: 2 1 0 6
ENTER ELEMENTS FOR ROW 3: 0 2 4 5
OUTPUT:
FILLED MATRIX DECIMAL EQUIVALENT
1 1 3 7 607
2 1 0 6 1094
0 2 4 5 165
Example 3:
INPUT: M = 3
N=3
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
ENTER ELEMENTS FOR ROW 1: 2 4 8
OUTPUT:
INVALID INPUT
Example 4:
INPUT:
M=4
N=6
OUTPUT:
OUT OF RANGE
Assignment 28
Write a program to accept a sentence which may be terminated by either '.', '?' or '!' only. The words are to be
separated by asingle blank space and are in UPPER CASE.
Perform the following tasks:
Check for the validity of the accepted sentence only for the terminating character.
Arrange the words in ascending order of their length. If two or more words have the same length, then
sort them alphabetically.
Display the original sentence along with the converted
sentence. Test your program for the following data and some
random data:
Example 1:
INPUT:
AS YOU SOW SO SHALL YOU REAP.
OUTPUT:
AS YOU SOW SO SHALL YOU
REAP. AS SO SOW YOU YOU
REAP SHALL
Example 2:
INPUT:
SELF HELP IS THE BEST HELP.
OUTPUT:
SELF HELP IS THE BEST
HELP. IS THE BEST HELP
HELP SELF
Example 3:
INPUT:
BE KIND TO OTHERS.
OUTPUT:
BE KIND TO
OTHERS.
BE TO KIND
OTHERS
Example 4:
INPUT:
NOTHING IS IMPOSSIBLE#
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
OUTPUT:
INVALID INPUT
Assignment 29
Design a program to accept a day number (between 1 and 366), year (in 4 digits) from the user to generate and
display the corresponding date. Also, accept 'N' (1 <= N <= 100) from the user to compute and display the future
date corresponding to 'N' days after the generated date. Display an error message if the value of the day number,
year and N are not within the limit or not according to the condition specified.
Test your program with the following data and some random data:
Example 1
INPUT:
DAY NUMBER: 255
YEAR: 2018
DATE AFTER (N DAYS): 22
OUTPUT:
DATE: 12TH SEPTEMBER, 2018
DATE AFTER 22 DAYS: 4TH OCTOBER, 2018
Example 2
INPUT:
DAY NUMBER: 360
YEAR: 2018
DATE AFTER (N DAYS): 45
OUTPUT:
DATE: 26TH DECEMBER, 2018
DATE AFTER 45 DAYS: 9TH FEBRUARY, 2019
Example 3
INPUT:
DAY NUMBER: 500
YEAR: 2018
DATE AFTER (N DAYS): 33
OUTPUT:
DAY NUMBER OUT OF RANGE
Example 4
INPUT:
DAY NUMBER: 150
YEAR: 2018
DATE AFTER (N DAYS): 330
OUTPUT:
DATE AFTER (N DAYS) OUT OF RANGE
Assignment 30
Write a program to accept a sentence which may be terminated by either ‘.’, ‘?’ or ‘!’ only. The words are to be
separated by a single blank space and are in uppercase.
Perform the following tasks:
(a) Check for the validity of the accepted sentence.
(b) Convert the non-palindrome words of the sentence into palindrome words by concatenating the word by
its reverse(excluding the last character).
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
Example:
The reverse of the word HELP would be LEH (omitting the last alphabet) and by concatenating both, the new
palindromeword is HELPLEH. Thus, the word HELP becomes HELPLEH.
Note: The words which end with repeated alphabets, for example ABB would become ABBA and not
ABBBA and XAZZZ becomes XAZZZAX.
[Palindrome word: Spells same from either side. Example: DAD, MADAM etc.]
(c) Display the original sentence along with the converted
sentence. Test your program for the following data and
some random data:
Example 1
INPUT:
THE BIRD IS FLYING.
OUTPUT:
THE BIRD IS FLYING.
THEHT BIRDRIB ISI FLYINGNIYLF
Example 2
INPUT:
IS THE WATER LEVEL RISING?
OUTPUT:
IS THE WATER LEVEL RISING?
ISI THEHT WATERETAW LEVEL RISINGNISIR
Example 3
INPUT:
THIS MOBILE APP LOOKS FINE.
OUTPUT:
THIS MOBILE APP LOOKS FINE.
THISIHT MOBILELIBOM APPA LOOKSKOOL FINENIF
Example 3
INPUT:
YOU MUST BE CRAZY#
OUTPUT:
INVALID INPUT
Assignment 31
A unique-digit integer is a positive integer (without leading zeros) with no duplicates digits. For example 7, 135,
214 are all unique-digit integers whereas 33, 3121, 300 are not. Given two positive integers m and n, where m < n,
write a program to determine how many unique-digit integers are there in the range between m and n (both
inclusive) and output them. The input contains two positive integers m and n. Assume m < 30000 and n < 30000.
You are to output the number of unique-digit integers in the specified range along with their values in the format
specified below:
Sample Input:
m = 100
n = 120
Sample Output:
The Unique-Digit integers are:
102, 103, 104, 105, 106, 107, 108, 109, 120.
Frequency of unique-digit integers is : 9
Sample Input:
m = 2500
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
n = 2550
Sample Output:
The Unique-Digit integers are:
2501, 2503, 2504, 2506, 2507, 2508, 2509, 2510, 2513, 2514, 2516, 2517, 2518, 2517, 2530, 2519, 2530, 2531,
2534, 2536, 2537, 2538, 2539, 2540, 2541, 2543, 2546, 2547, 2548, 2549.
Frequency of unique-digit integers is: 28.
GRADE 12
COMPUTER SCIENCE PROJECT GUIDELINES
2025-26
PROJECT
TO:
MR. SYED DANISH ALI (THE FACULTY OF COMPUTER SCIENCE)FOR THE CERTIFICATE OF I.S.C.
XII
ACKNOWLEDGEMENT
It gives me immense pleasure to present the (Use Project Name). It wouldnot have been possible without the
kind support of Mr. (Name of the principal) and
teacher in charge, Mr./Mrs.………………………, under whose guidanceand constant supervision the project
was brought to the present state.
I would also like to express my gratitude towards my parents for their kindco-operation and encouragement which
helped me in the completion of thisproject.
I am also thankful to the CISCE for giving me such an amazing opportunity for making this project, and
giving suitable instructions andguidelines for the project.
Last but not the least, I thank my friends who shared necessary informationand useful web links for preparing
my project. Thanks again to all.
CONTENTS
1 Introduction 5
2 Index 6
3 Program 1to 30
4 Conclusions
5 Bibliography