Scribd
Upload
415 views

Isc 2012 Computer Science Practical Question Paper PDF

Uploaded by

Dipanjan Pramanik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
415 views

Isc 2012 Computer Science Practical Question Paper PDF

Uploaded by

Dipanjan Pramanik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

COMPUTER SCIENCE

Paper – 2
(PRACTICAL)
(Reading Time: 15 minutes)
(Planning Session AND Examination Session: Three Hours)

———————————————————————————————-------------————

The total time to be spent on the Planning and the Examination Session is Three hours.
After completing the Planning Session, the candidate may begin with the Examination Session.
A maximum of 90 minutes is permitted to begin the Examination Session.
However, if candidates finish earlier, they are to be permitted to begin the Examination Session.
(Maximum Marks: 80)
———————————————————————————————-------------————

As it is a practical examination the candidate is expected to do the following:

1. Write an algorithm for the selected problem. [10]


(Algorithm should be expressed clearly using any standard scheme such as pseudo
code or in steps which are simple enough to be obviously computible.)
2. Write a program in JAVA language. The program should follow the algorithm and [20]
should be logically and syntactically correct.
3. Document the program using mnemonic names / comments, identifying and clearly [10]
describing the choice of data types and meaning of variables.
4. Code / Type the program on the computer and get a printout (hard copy). Typically, [10]
this should be a program that compiles and runs correctly.
5. Test run the program on the computer using the given sample data and get a printout [20]
of the output in the format specified in the problem.
6. Viva-Voce on the Selected Problem. [20]

This Paper consists of 4 printed pages.


1212-868B © www.javaforschool.com Turn over
Solve any one of the following Problems:

Question 1

A prime palindrome integer is a positive integer (without leading zeros) which is prime as
well as a palindrome. Given two positive integers m and n, where m < n, write a program to
determine how many prime-palindrome integers are there in the range between m and n
(both inclusive) and output them.

The input contains two positive integers m and n where m < 3000 and n < 3000. Display
the number of prime-palindrome integers in the specified range along with their values in the
format specified below:

Test your program with the sample data and some random data:

Example 1

INPUT: m = 100

n = 1000

OUTPUT: THE PRIME PALINDROME INTEGERS ARE:


101, 131, 151, 181, 191, 313, 353, 373, 383, 727, 757, 787, 797, 919, 929
FREQUENCY OF PRIME PALINDROME INTEGERS : 15

Example 2

INPUT: m = 100

n = 5000

OUTPUT: OUT OF RANGE

Question 2

Write a program to accept a sentence as input. The words in the string are to be
separated by a blank. Each word must be in upper case. The sentence is terminated by
either “.”,”!” or “?”. Perform the following tasks:

(i) Obtain the length of the sentence (measured in words).

(ii) Arrange the sentence in alphabetical order of the words.

2
1212-868B © www.javaforschool.com
Test your program with the sample data and some random data:

Example 1

INPUT:
NECESSITY IS THE MOTHER OF INVENTION.

OUTPUT:
LENGTH : 6
REARRANGED SENTENCE

INVENTION IS MOTHER NECESSITY OF THE

Example 2

INPUT:
BE GOOD TO OTHERS.

OUTPUT:
LENGTH : 4
REARRANGED SENTENCE

BE GOOD OTHERS TO

Question 3

Write a program to declare a matrix A [ ] [ ] of order (MXN) where ‘M’ is the


number of rows and ‘N’ is the number of columns such that both M and N must be
greater than 2 and less than 20. Allow the user to input integers into this matrix.
Perform the following tasks on the matrix:

(a) Display the input matrix

(b) Find the maximum and minimum value in the matrix and display them along
with their position.

(c) Sort the elements of the matrix in ascending order using any standard sorting
technique and rearrange them in the matrix.

(d) Output the rearranged matrix.

3
1212-868B © www.javaforschool.com Turn over
Test your program with the sample data and some random data:

Example 1

INPUT : M=3

N=4

8 7 9 3

-2 0 4 5

1 3 6 -4

OUTPUT :

ORIGINAL MATRIX

8 7 9 3

-2 0 4 5

1 3 6 -4

LARGEST NUMBER : 9

ROW = 0
COLUMN = 2

SMALLEST NUMBER : -4

ROW = 2
COLUMN = 3

REARRANGED MATRIX

-4 -2 0 1

3 3 4 5

6 7 8 9

Example 2

INPUT : M=3

N = 22

OUTPUT : SIZE OUT OF RANGE

4
1212-868B © www.javaforschool.com

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy