Trending ▼  

ISC Specimen 2016 Computer Science Paper 2

4 pages, 3 questions, 1 questions with responses, 1 total responses
Isc
Indian School Certificate Examination (ISC), New Delhi
+Fave Message
 Home > isc >

Formatting page ...
 

COMPUTER SCIENCE Paper 2 (PRACTICAL) (Three hours) Maximum Marks: 30 (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. 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) [3] 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, this should be a program that compiles and runs correctly. [2] 5. Test run the program on the computer using the given sample data and get a print out of the output in the format specified in the problem. [5] 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 ISC SPECIMEN QUESTION PAPER 2016

Formatting page ...
 

Solve any one of the following Problems. Question 1 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 ---------------------------------------------------------------------------------------------------------------------------2 ISC SPECIMEN QUESTION PAPER 2016

Top Contributors
to this ResPaper
(answers/comments)


American Badass

(1)

Formatting page ...
 

Question 2 The encryption of alphabets are to be done as follows: A=1 B=2 C=3 . . . Z = 26 The potential of a word is found by adding the encrypted value of the alphabets. Example: KITE Potential = 11 + 9 + 20 + 5 = 45 Accept a sentence which is terminated by either . , ? or ! . Each word of sentence is separated by single space. Decode the words according to their potential and arrange them in ascending order. Output the result in format given below: Example 1 INPUT : THE SKY IS THE LIMIT. POTENTIAL : OUTPUT : IS THE THE SKY LIMIT INPUT : LOOK BEFORE YOU LEAP. POTENTIAL : OUTPUT : THE SKY IS THE LIMIT = = = = = 33 55 28 33 63 Example 2 LOOK BEFORE YOU LEAP = = = = 53 51 61 34 LEAP BEFORE LOOK YOU ---------------------------------------------------------------------------------------------------------------------------3 ISC SPECIMEN QUESTION PAPER 2016

Formatting page ...
 

Question 3 Given a square matrix M [ ] [ ] of order n . The maximum value possible for n is 10. Accept three different characters from the keyboard and fill the array according to the instruction given below. Fill the upper and lower elements formed by the intersection of the diagonals by character 1. Fill the left and right elements formed by the intersection of the diagonals by character 2. Fill both the diagonals by character 3. Output the result in format given below: Example 1 ENTER SIZE : 4 INPUT : FIRST CHARACTER SECOND CHARACTER THIRD CHARACTER OUTPUT : # ? ? # * # # * * # # * * ? # # ? ? # Example 2 ENTER SIZE : 5 INPUT : FIRST CHARACTER SECOND CHARACTER THIRD CHARACTER OUTPUT : $ ! @ @ $ $ $ @ ! @ $ @ ! ! ! @ ! ! ! @ $ @ ! @ $ $ $ @ Example 3 ENTER SIZE : 65 OUTPUT : SIZE OUT OF RANGE ---------------------------------------------------------------------------------------------------------------------------4 ISC SPECIMEN QUESTION PAPER 2016

 

  Print intermediate debugging step

Show debugging info


 


Tags : ISC Board, Council for the Indian School Certificate Examinations, ISC 2016 - 2017 Examination, 2017, 2016, 2015, 2014, 2013, 2012, 2011, ISC Solved Specimen Question Papers 2016 - 2017, ISC Solved Mock Guess Exam Papers, ISC Board Model Paper with Answers, Detailed Solutions & Explanations, isc sample question bank, past / old / last year online test papers, syllabus, online coaching.  

© 2010 - 2017 ResPaper. Terms of ServiceContact Us Advertise with us

 

NEW: Save page on Android App
isc chat