Q: Question 3Caesar 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.ROT13A/aB/bC/cD/dE/eF/fG/gH/hI/iJ/jK/kL/lM/m↕↕↕↕↕↕↕↕↕↕↕↕↕N/nO/oP/pQ/qR/rS/sT/tU/uV/vW/wX/xY/yZ/zWrite 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 1INPUT:Hello! How are you?OUTPUT:The cipher text is:Uryyb! Ubj ner lbh?Example 2INPUT:Encryption helps to secure data.OUTPUT:The cipher text is:Rapelcgvba urycf gb frpher qngn.Example 3INPUT:YouOUTPUT:INVALID LENGTHSolutionimport java.util.Scanner; public class CaesarCipher { public static void main(String args[]) { Scanner in = new Scanner(System.in); System.out.println("Enter plain text:"); String str = in.nextLine(); int len = str.length(); if (len <= 3 || len >= 100) { System.out.println("INVALID LENGTH"); return; } StringBuffer sb = new StringBuffer(); for (int i = 0; i < len; i++) { char ch = str.charAt(i); if ((ch >= 'A' && ch <= 'M') || (ch >= 'a' && ch <= 'm')) { sb.append((char)(ch + 13)); } else if ((ch >= 'N' && ch <= 'Z') || (ch >= 'n' && ch <= 'z')) { sb.append((char)(ch - 13)); } else { sb.append(ch); } } String cipher = sb.toString(); System.out.println("The cipher text is:"); System.out.println(cipher); } }Output

importjava.util.Scanner;publicclassCaesarCipher{publicstaticvoidmain(Stringargs[]) {Scannerin=newScanner(System.in);System.out.println("Enter plain text:");Stringstr=in.nextLine();intlen=str.length();if(len3||len>=100) {System.out.println("INVALID LENGTH");return; }StringBuffersb=newStringBuffer();for(inti=0; ilen; i++) {charch=str.charAt(i);if((ch>='A'&&ch'M')||(ch>='a'&&ch'm')) { sb.append((char)(ch+13)); }elseif((ch>='N'&&ch'Z')||(ch>='n'&&ch'z')) { sb.append((char)(ch-13)); }else{ sb.append(ch); } }Stringcipher=sb.toString();System.out.println("The cipher text is:");System.out.println(cipher); }}Output

Question 1

Question 1A company manufactures packing cartons in four sizes, i.e. cartons 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 up to 1000 boxes) and display the break-up of the cartons used in descending order of capacity (i.e. preference should be given to the highest capacity available, and if boxes left are less than 6, an extra carton of capacity 6 should be used.)Test your program with the following data and some random data:Example 1INPUT:N = 726OUTPUT:48 * 15 = 7206 * 1 = 6Remaining boxes = 0Total number of boxes = 726Total number of cartons = 16Example 2INPUT:N = 140OUTPUT:48 * 2 = 9624 * 1 = 2412 * 1 = 126 * 1 = 6Remaining boxes = 2 * 1 = 2Total number of boxes = 140Total number of cartons = 6Example 3INPUT:N = 4296OUTPUT:INVALID INPUTSolutionimport java.util.Scanner;

public class CartonBoxes
{
    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);

System.out.print("Enter number of boxes (N): ");
        int n = in.nextInt();
        
        if (n < 1 || n > 1000) {
            System.out.println("INVALID INPUT");
            return;
        }

int cartonSizes[] = {48, 24, 12, 6};

int total = 0;
        int t = n;
        for (int i = 0; i < cartonSizes.length; i++) {
            int cartonCount = t / cartonSizes[i];
            t = t % cartonSizes[i];
            total += cartonCount;
            if (cartonCount != 0) {
                System.out.println(cartonSizes[i] + " * " + cartonCount + 
                    " = " + (cartonSizes[i] * cartonCount));
            }
        }

/*
         * This if check is for the case when
         * boxes left are less than 6. We need
         * one more carton of capacity 6 in this
         * case so total is incremented by 1.
         */
        if (t != 0) {
            System.out.println("Remaining boxes = " + t 
                + " * 1 = " + t);
            total++;
        }
        else {
            System.out.println("Remaining boxes = 0");
        }

System.out.println("Total number of boxes = " + n);
        System.out.println("Total number of cartons = " + total);
    }
}Output

Accepted Answer

importjava.util.Scanner;publicclassCartonBoxes{publicstaticvoidmain(Stringargs[]) {Scannerin=newScanner(System.in);System.out.print("Enter number of boxes (N):");intn=in.nextInt();if(n1||n>1000) {System.out.println("INVALID INPUT");return;        }intcartonSizes[]={48,24,12,6};inttotal=0;intt=n;for(inti=0; icartonSizes.length; i++) {intcartonCount=t/cartonSizes[i];            t=t%cartonSizes[i];            total+=cartonCount;if(cartonCount!=0) {System.out.println(cartonSizes[i]+"*"+cartonCount+"="+(cartonSizes[i]*cartonCount));            }        }/** This if check is for the case when* boxes left are less than 6. We need* one more carton of capacity 6 in this* case so total is incremented by 1.*/if(t!=0) {System.out.println("Remaining boxes ="+t+"* 1 ="+t);            total++;        }else{System.out.println("Remaining boxes = 0");        }System.out.println("Total number of boxes ="+n);System.out.println("Total number of cartons ="+total);    }}Output

Question 2

Question 2The 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: Q1Q2Q3Q4Q5Participant 1ABBCAParticipant 2DADCBParticipant 3AABACParticipant 4DCCABKey to the question:DCCBANote: Array entries are line fed (i.e. one entry per line)Test your program for the following data and some random data.Example 1INPUT:N = 5Participant 1 D A B C CParticipant 2 A A D C BParticipant 3 B A C D BParticipant 4 D A D C BParticipant 5 B C A D DKey: B C D A AOUTPUT:Scores:Participant 1 = 0Participant 2 = 1Participant 3 = 1Participant 4 = 1Participant 5 = 2Highest Score:Participant 5Example 2INPUT:N = 4Participant 1 A C C B DParticipant 2 B C A A CParticipant 3 B C B A AParticipant 4 C C D D BKey: A C D B BOUTPUT:Scores:Participant 1 = 3Participant 2 = 1Participant 3 = 1Participant 4 = 3Highest Score:Participant 1Participant 4Example 3INPUT:N = 12OUTPUT:INPUT SIZE OUT OF RANGE.Solutionimport java.util.Scanner; public class QuizCompetition { public static void main(String args[]) { Scanner in = new Scanner(System.in); System.out.print("Enter the Number of Participants (N): "); int n = in.nextInt(); if (n <= 3 || n >= 11) { System.out.println("INPUT SIZE OUT OF RANGE."); return; } char answers[][] = new char[n][5]; char key[] = new char[5]; System.out.println("Enter answers of participants"); for (int i = 0; i < n; i++) { System.out.println("Participant " + (i+1)); for (int j = 0; j < 5; j++) { answers[i][j] = in.next().charAt(0); } } System.out.println("Enter Answer Key:"); for (int i = 0; i < 5; i++) { key[i] = in.next().charAt(0); } int hScore = 0; int score[] = new int[n]; System.out.println("Scores:"); for (int i = 0; i < n; i++) { for (int j = 0; j < 5; j++) { if (answers[i][j] == key[j]) { score[i]++; } } if (score[i] > hScore) { hScore = score[i]; } System.out.println("Participant " + (i+1) + " = " + score[i]); } System.out.println("Highest Score:"); for (int i = 0; i < n; i++) { if (score[i] == hScore) { System.out.println("Participant " + (i+1)); } } } }Output

Accepted Answer

importjava.util.Scanner;publicclassQuizCompetition{publicstaticvoidmain(Stringargs[]) {Scannerin=newScanner(System.in);System.out.print("Enter the Number of Participants (N):");intn=in.nextInt();if(n3||n>=11) {System.out.println("INPUT SIZE OUT OF RANGE.");return;        }charanswers[][]=newchar[n][5];charkey[]=newchar[5];System.out.println("Enter answers of participants");for(inti=0; in; i++) {System.out.println("Participant"+(i+1));for(intj=0; j5; j++) {                answers[i][j]=in.next().charAt(0);            }        }System.out.println("Enter Answer Key:");for(inti=0; i5; i++) {            key[i]=in.next().charAt(0);        }inthScore=0;intscore[]=newint[n];System.out.println("Scores:");for(inti=0; in; i++) {for(intj=0; j5; j++) {if(answers[i][j]==key[j]) {                    score[i]++;                }            }if(score[i]>hScore) {                hScore=score[i];            }System.out.println("Participant"+(i+1)+"="+score[i]);        }System.out.println("Highest Score:");for(inti=0; in; i++) {if(score[i]==hScore) {System.out.println("Participant"+(i+1));            }        }    }}Output

Question 3

Question 3Caesar 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.ROT13A/aB/bC/cD/dE/eF/fG/gH/hI/iJ/jK/kL/lM/m↕↕↕↕↕↕↕↕↕↕↕↕↕N/nO/oP/pQ/qR/rS/sT/tU/uV/vW/wX/xY/yZ/zWrite 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 1INPUT:Hello! How are you?OUTPUT:The cipher text is:Uryyb! Ubj ner lbh?Example 2INPUT:Encryption helps to secure data.OUTPUT:The cipher text is:Rapelcgvba urycf gb frpher qngn.Example 3INPUT:YouOUTPUT:INVALID LENGTHSolutionimport java.util.Scanner; public class CaesarCipher { public static void main(String args[]) { Scanner in = new Scanner(System.in); System.out.println("Enter plain text:"); String str = in.nextLine(); int len = str.length(); if (len <= 3 || len >= 100) { System.out.println("INVALID LENGTH"); return; } StringBuffer sb = new StringBuffer(); for (int i = 0; i < len; i++) { char ch = str.charAt(i); if ((ch >= 'A' && ch <= 'M') || (ch >= 'a' && ch <= 'm')) { sb.append((char)(ch + 13)); } else if ((ch >= 'N' && ch <= 'Z') || (ch >= 'n' && ch <= 'z')) { sb.append((char)(ch - 13)); } else { sb.append(ch); } } String cipher = sb.toString(); System.out.println("The cipher text is:"); System.out.println(cipher); } }Output

Accepted Answer

importjava.util.Scanner;publicclassCaesarCipher{publicstaticvoidmain(Stringargs[]) {Scannerin=newScanner(System.in);System.out.println("Enter plain text:");Stringstr=in.nextLine();intlen=str.length();if(len3||len>=100) {System.out.println("INVALID LENGTH");return;        }StringBuffersb=newStringBuffer();for(inti=0; ilen; i++) {charch=str.charAt(i);if((ch>='A'&&ch'M')||(ch>='a'&&ch'm')) {                sb.append((char)(ch+13));            }elseif((ch>='N'&&ch'Z')||(ch>='n'&&ch'z')) {                sb.append((char)(ch-13));            }else{                sb.append(ch);            }        }Stringcipher=sb.toString();System.out.println("The cipher text is:");System.out.println(cipher);    }}Output

Solved 2017 Practical Paper ISC Computer Science