COMPUTER SCIENCE Paper-2 (PRACTICAL) (Maximum Marks: 30) (Time allowed: Three hours) (Candidates are allowed additional 15 mimutes for only reading the paper. They must NOT start writing during this time.) The total time to be spent on the Planning Session and the 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 90 minutes of the Planning session are over. This paper consists of three problems from which candidates are required lo attempt any one problem. 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 or in steps which are simple enough to be obviously computable.) ge. The program should follow the algorithm and [5] 3 2. Write a program in JAVA langua; should be logically and syntactically correct. 3. Document the program using mnemonic names / comments, identifying and clearly [2] bles, describing the choice of data types and meaning of varia get a printout ( hard copy ). Typically, (2) correctly. 5. Test run the program on the computer using the given sample data and get a printout of — [5] the output in the format specified in the problem. 6. Viva-Voce on the Selected Problem. In addition to the above, the practical file of thé 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] 4. » Code / Type the program on the computer and. this should be a program that compiles and runs 13) inted pages and 1 blank page. Turn over 1219-868B © Copyright reserved,Solve any one of the following Problems, Question 1 Design a program to accept a day number (between | 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 (NDAYS): 22 OUTPUT: DATE: 12 TH SEPTEMBER, 2018 DATE AFTER 22 DAYS: 4TH OCTOBER, 2018 Example 2 INPUT: DAY NUMBER: 360 YEAR: 2018 DATE AFTER (NDAYS): 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. 1219-868B -. vtQuestion 2 Write a program to declare a single dimensional array a[ ] and a square matrix bl } [ ] of size N, where N>2 and N<10. Allow the user to input positive integers into the single dimensional array. Perform the following tasks on the matrix: (@) Sort the elements of the single dimensional array in ascending order using any standard sorting technique and display the sorted elements. (b) Fill the square matrix bf J[ ] in the following format. Ifthe array a] = { 5,2, 8, 1 } then, after sorting af ]= {1, 2, 5, 8} ‘Then, the matrix b[ ][ ] would fill as below: 1 2 5 8 1 a s 1 i 2 £ @ 1 1 2 55 (©) Display the filled matrix in the above format, Test your program for the following data and some random data: Example 1 INPUT: OUTPUT: Example 2 INPUT: OUTPUT: N=3 ENTER ELEMENTS OF SINGLE DIMENSIONAL ARRAY: 3 1 7 SORTED ARRAY: 137 FILLED MATRIX N=13 MATRIX SIZE OUT OF RANGE. 1219-868B Turn over