Scribd
Upload
2 views3 pages

ISC Computer Project Programs

The document outlines a series of Java programming tasks for an ISC Computer Project. It includes programs for generating Super Prime numbers, identifying Prime Palindromes, filling a Double Dimension Array with Fibonacci series, and various other tasks involving number combinations, palindromes, and string manipulations. Each task provides specific input and output examples to guide implementation.

Uploaded by

Anustup Naskar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
2 views3 pages

ISC Computer Project Programs

The document outlines a series of Java programming tasks for an ISC Computer Project. It includes programs for generating Super Prime numbers, identifying Prime Palindromes, filling a Double Dimension Array with Fibonacci series, and various other tasks involving number combinations, palindromes, and string manipulations. Each task provides specific input and output examples to guide implementation.

Uploaded by

Anustup Naskar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 3

ISC COMPUTER PROJECT PROGRAMS

1. Write a program in Java to print the first ‘n’ Super Prime numbers. A Super Prime number is a prime
number that occurs at a prime position in the set of all the Prime Numbers. For example,
Input: n = 5
Output: 3 5 11 17 31

Input: n = 6
Output: 3 5 11 17 31 41

2. Design a class ‘PrimePalindrome’ with the following specifications:


a. Data members: int start, end
b. Member Methods:
i. prime_palin() //Constructor
ii. void read() //To accept start and end
iii. void generate() //To print all the numbers between start and end which are
prime and palindromes
iv. void main() //Create an object of the class and call the appropriate methods
v. int prime() //To check if the number is a prime number or not
vi. int palin() //To check if the number is a palindrome or not

3. Write a program in Java to fill a Double Dimension Array (DDA) of dimensions mxn with the
fibonacci series. For example,
Input: m = 3, n = 4
Output: 1 1 2 3
5 8 13 21
34 55 89 144

4. Write a program in Java to find all the possible combinations of consecutive numbers that add up to
‘n’. For example,
Input: n = 15
Output: 1 2 3 4 5
456
78

5. Write a program in Java to print a sentence input by the user in the following manner:
Input: HOW GOOD IS THIS
Output:
H G I T

O O S H

W O I

D S
6. Write a program in Java to print all the numbers between m and n whose binary equivalent is a
palindrome. For example,
Input: m = 10, n = 20
Output: 15 1111
17 10001

7. Write a program in Java to input a number and print the sum of the smallest and largest combination
possible from the digits of the number. For example,
Input: n = 231
Output: 123
321
444

8. Write a program in Java to input ‘n’ number of words in lowercase and print those words which have
3 or more consonants in a row. For example,
Input: n = 5; cloud, apple, computers, orange, sky
Output:
cloud no
apple yes
computers no
orange no
sky yes

9. Write a program in Java to input ‘n’ numbers. The numbers can only be 1 or 2 or 3. Print the
combinations of 1 2 3 as many times as possible and then print 2 3 and so on.
Input: 10
1322213322
Output:
123
123
23
2
2

10. Write a program in Java to input numbers in a Double Dimensional Array of size nxn in a sorted
manner except for the last element. Then, take a number input from the user and insert it into the array
at the correct position.
Input: n = 5; Number to insert = 4
1 2 3

5 6 7

8 9 0
Output:
1 2 3

4 5 6

7 8 9

11. Write a program in Java to input a string from the user and arrange its words in increasing order of its
ASCII summations. For example,
Input: HOW DO YOU DO?
Output:
HOW – 238
DO – 147
YOU – 253
DO – 147

DO DO HOW YOU

12. Write a program in Java to input a word from the user and print all its variations by rotating its letters.
Also print the largest and smallest combination so formed. For example,
Input: ROTATE
Output:
ROTATE
OTATER
TATERO
ATEROT
TEROTA
EROTAT

Biggest: TEROTA
Smallest: ATEROT

You might also like