Formatting page ...
FIRST PRELIMINARY EXAMINATION NOVEMBER 2018 COMPUTER SCIENCE PAPER 2 (PRACTICAL) Class : XII - ISC Marks: 30 Time : 3 Hrs. Date : 21/11/2018 (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) ---------------------------------------------------------------------------------------------------------------------------The total time to be spent on the Planning session and Examination session is Three hours. Planning session: 90 minutes. Examination session: 90 minutes Note: Candidates are to be permitted to proceed to the Examination Session only after the 90 minutes of the Planning Session are over. ---------------------------------------------------------------------------------------------------------------------------This paper consists of three problems from which candidates are required to attempt any one problem. This paper Consists of 4 printed pages. Candidates are expected to do the following : 1. Write an algorithm for the selected problem. (Algorithm should be expressed clearly using any standard scheme such as pseudo code [3] or in steps which are simple enough to be obviously computable) 2. Write a program in JAVA language. The program should follow the algorithm and should be logically and syntactically correct [5] 3. Document the program using mnemonic names / comments, identifying and clearly describing the choice of data types and meaning of variables [2] 4. Code / Type the program on the computer and get a print out ( Hard Copy ). Typically, [2] 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 print out of [5] the output in the format specified in the problem. 6. Viva-Voce on the Selected Problem [3] In addition to the above, the practical file of the candidate containing the practical work related to programming assignments done during the year is to be evaluated as follows: Programming assignments done throughout the year (by the Teacher) [5] Programming assignments done throughout the year (by the Visiting Examiner) [5] (1) Solve any one of the following Problems. Question 1. A number is said to be permutable prime or absolute prime, if it is a prime number with at least two distinct digits which remains prime on every rearrangement (permutation) of the digits. A number is said to be prime if it has only two factors 1 and itself. Example, 337 is a permutable prime because each of 337, 373, and 733 are prime. Accept a positive integer N from the user and check if it is a permutable prime or not. The number itself and all numbers derived by rearrangement of its digit should also be displayed. An appropriate error message should be displayed, if the input integer is a single digit or all the digits of the number entered are same. Test your program with sample data and some random data: Example 1 : INPUT : N = 337 OUTPUT : ORIGINAL NUMBER = 337 NUMBER DERIVED BY REARRANGMENT OF THE DIGITS ARE 373 733 ALL THE ABOVE NUMBERS ARE PRIME SO 337 IS PERMUTABLE PRIME Example 2 : INPUT : N = 111 OUTPUT : ORIGINAL NUMBER = 111 INVALID INPUT AS MORE THEN 2 DIGITS ARE SAME!!! Example 3 : INPUT : N = 199 OUTPUT : ORIGINAL NUMBER = 199 NUMBER DERIVED BY REARRANGMENT OF THE DIGITS ARE 991 191 ALL THE ABOVE NUMBERS ARE PRIME SO 199 IS PERMUTABLE PRIME Example 4 : INPUT : N = 7 OUTPUT: INVALID INPUT!!! (2) Question 2. Write a program to declare a matrix A[ ] [ ] of order (M x N ). Both M and N must be greater than 2 and less than 10. M indicates number of rows and N indicates number of columns. Allow the user to input positive integers into this matrix. Check if the given matrix is Toepliz or not. You need to return 1 if the matrix is Toepliz else return -1. A matrix is "Toepliz" if each descending diagonal from left to right is constant. Test your program for the following sample data and some random data: Example 1 : INPUT : M = 4 N=5 6 7 8 9 2 4 6 7 8 9 1 4 6 7 8 0 1 4 6 7 OUTPUT: 1 Example 2 : INPUT : M = 2 N=5 OUTPUT: THE MATRIX SIZE IS OUT OF RANGE. Example 3: INPUT : M = 3 N=4 3 5 7 9 17 12 5 32 21 5 8 4 OUTPUT: -1 (3) Question 3. Encryption is a technique of coding messages to maintain their secrecy. A String array of size n where n is greater than 1 and less than 10, stores single sentences ( each sentence with a full stop) in each row of the array. Write a program to accept the size of the array. Display an appropriate message if the size is not satisfying the given condition. Define a String array of inputted size and fill it with sentences row-wise. Change the sentence of the odd rows with an encryption of two characters ahead of the original character. Also change the sentence of the even rows by storing the reverse of the each word. Display the encrypted sentences as per the sample data given below: Test your program with the sample data and some random data: Example 1 : INPUT: n = 4 IT IS CLOUDY. IT MAY RAIN. THE WEATHER IS FINE. IT IS COOL. OUTPUT: KV KU ENQWFA. TA YAM NIAR. VCG YGCVJGT KU HKPG. TI SI LOOC. Example 2: INPUT: n = 13 OUTPUT: INVALID ENTRY. Example 3: INPUT: n = 3 THIS IS A STRING PROGRAM. IT IS INTERESTING. IT IS EASY. OUTPUT: VJKU KU C UVTKPI RTQITCO. TI SI GNITSERETNI. KV KU GCUA. =================== XXXXXXX =================== (4)
|
