2017 ISC Computer Practical Paper Programs With Solutions

• A Company manufacturing packaging cartoons in four sizes, i,e cartoons to accommodate 6 boxes, 12 boxes, 24 boxes and 48 boxes.Design a program to accept the number of boxes to be packed (N) by the user (maximum upto 1000 boxes) and display the break up of the cartoons used in descending order of capacity. (ie preference should be given to the highest capacity available and if boxes left are less than 6. an extra cartoon of capacity 6 should be used.

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

Example 1: 

INPUT= N=726

OUTPUT= 48 X 15=720

6 X 1=6

Remaining boxes= 0

Total number of boxes= 726

Total Number of cartoons= 16

Example 2: 

INPUT= N=140

OUTPUT= 48 X 2=96

24 x 1= 24

12 x 1= 12

6 x 1= 6

Remaining boxes= 2 x 1= 2

Total number of boxes= 140

Total Number of cartoons= 6

Example 2: 

INPUT= N= 4296

OUTPUT= INVALID INPUT

Solution: CLICK HERE

• The result of a quiz competition is to be prepared as follows:

The quiz has five questions with four multiple choices (A, B, C, D), with each question carrying 1 mark for the correct answer. Design a program to accept the number of participants N such that N must be greater than 3 and less than 11. Create a double dimensional array of size (Nx5) to store the answers of each participant row-wise.

Calculate the marks for each participant by matching the correct answer stored in a single dimensional array of size 5. Display the scores for each participant and also the participant(s) having the highest score.

Example: If the value of N = 4, then the array would be:

Note: Array entries are line fed (i.e. one entry per line)

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

Example 1

INPUT : N = 5

Participant 1 D A B C C
Participant 2 A A D C B
Participant 3 B A C D B
Participant 4 D A D C B
Participant 5 B C A D D

Key: B C D A A

OUTPUT : Scores :

Participant 1 D A B C C
Participant 1 = 0
Participant 2 = 1
Participant 3 = 1
Participant 4 = 1
Participant 5 = 2

Highest score: Participant 5

Example 2

INPUT : N = 4

Participant 1 A C C B D
Participant 2 B C A A C
Participant 3 B C B A A
Participant 4 C C D D B

Key: A C D B B

OUTPUT : Scores :

Participant 1 = 3
Participant 2 = 1
Participant 3 = 1
Participant 4 = 3

Highest score:
Participant 1
Participant 4

Example 3

INPUT : N = 12

OUTPUT : INPUT SIZE OUT OF RANGE.

Solution: CLICK HERE

• Caesar Cipher is an encryption technique which is implemented as ROT13
• (‘rotate by 13 places’). It is a simple letter substitution cipher that replaces a
• letter with the letter 13 places after it in the alphabets, with the other characters
• remaining unchanged.




Write a program to accept a plain text of length L, where L must be greater than 3 and less than 100.

Encrypt the text if valid as per the Caesar Cipher.

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

Example 1

INPUT : Hello! How are you?

OUTPUT : The cipher text is:
Uryyb? Ubj ner lbh?

Example 2

INPUT : Encryption helps to secure data.

OUTPUT : The cipher text is:
Rapelcgvba urycf gb frpher qngn.

Example 3

INPUT : You

OUTPUT : INVALID LENGTH

Solution: CLICK HERE

For Solutions along with algorithm and variable descriptions: CLICK HERE

2010 To 2018 Complete 9 Years Papers With 

Solutions: CLICK HERE