Question 1

Question 1Design a program to accept a day number (between 1 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 1INPUT:DAY NUMBER: 255YEAR: 2018DATE AFTER (N DAYS): 22OUTPUT:DATE: 12TH SEPTEMBER, 2018DATE AFTER 22 DAYS: 4TH OCTOBER, 2018Example 2INPUT:DAY NUMBER: 360YEAR: 2018DATE AFTER (N DAYS): 45OUTPUT:DATE: 26TH DECEMBER, 2018DATE AFTER 45 DAYS: 9TH FEBRUARY, 2019Example 3INPUT:DAY NUMBER: 500YEAR: 2018DATE AFTER (N DAYS): 33OUTPUT:DAY NUMBER OUT OF RANGEExample 4INPUT:DAY NUMBER: 150YEAR: 2018DATE AFTER (N DAYS): 330OUTPUT:DATE AFTER (N DAYS) OUT OF RANGESolutionimport java.util.Scanner; public class DateCalculator { public static boolean isLeapYear(int y) { boolean ret = false; if (y % 400 == 0) { ret = true; } else if (y % 100 == 0) { ret = false; } else if (y % 4 == 0) { ret = true; } else { ret = false; } return ret; } public static String computeDate(int day, int year) { int monthDays[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; String monthNames[] = {"JANUARY", "FEBRUARY", "MARCH", "APRIL", "MAY", "JUNE", "JULY", "AUGUST", "SEPTEMBER", "OCTOBER", "NOVEMBER", "DECEMBER"}; boolean leap = isLeapYear(year); if (leap) { monthDays[1] = 29; } int i = 0; int daySum = 0; for (i = 0; i < monthDays.length; i++) { daySum += monthDays[i]; if (daySum >= day) { break; } } int date = day + monthDays[i] - daySum; StringBuffer sb = new StringBuffer(); sb.append(date); sb.append("TH "); sb.append(monthNames[i]); sb.append(", "); sb.append(year); return sb.toString(); } public static void main(String args[]) { Scanner in = new Scanner(System.in); System.out.print("DAY NUMBER: "); int dayNum = in.nextInt(); System.out.print("YEAR: "); int year = in.nextInt(); System.out.print("DATE AFTER (N DAYS): "); int n = in.nextInt(); if (dayNum < 1 || dayNum > 366) { System.out.println("DAY NUMBER OUT OF RANGE"); return; } if (n < 1 || n > 100) { System.out.println("DATE AFTER (N DAYS) OUT OF RANGE"); return; } String dateStr = computeDate(dayNum, year); int nDays = dayNum + n; int nYear = year; boolean leap = isLeapYear(year); if (leap && nDays > 366) { nYear = nYear + 1; nDays = nDays - 366; } else if (nDays > 365) { nYear = nYear + 1; nDays = nDays - 365; } String nDateStr = computeDate(nDays, nYear); System.out.println(); System.out.println("DATE: " + dateStr); System.out.println("DATE AFTER " + n + " DAYS: " + nDateStr); } }Output

Accepted Answer

importjava.util.Scanner;publicclassDateCalculator{publicstaticbooleanisLeapYear(inty) {booleanret=false;if(y%400==0) {            ret=true;        }elseif(y%100==0) {            ret=false;        }elseif(y%4==0) {            ret=true;        }else{            ret=false;        }returnret;    }publicstaticStringcomputeDate(intday,intyear) {intmonthDays[]={31,28,31,30,31,30,31,31,30,31,30,31};StringmonthNames[]={"JANUARY","FEBRUARY","MARCH","APRIL","MAY","JUNE","JULY","AUGUST","SEPTEMBER","OCTOBER","NOVEMBER","DECEMBER"};booleanleap=isLeapYear(year);if(leap) {            monthDays[1]=29;        }inti=0;intdaySum=0;for(i=0; imonthDays.length; i++) {            daySum+=monthDays[i];if(daySum>=day) {break;            }        }intdate=day+monthDays[i]-daySum;StringBuffersb=newStringBuffer();        sb.append(date);        sb.append("TH");        sb.append(monthNames[i]);        sb.append(",");        sb.append(year);returnsb.toString();    }publicstaticvoidmain(Stringargs[]) {Scannerin=newScanner(System.in);System.out.print("DAY NUMBER:");intdayNum=in.nextInt();System.out.print("YEAR:");intyear=in.nextInt();System.out.print("DATE AFTER (N DAYS):");intn=in.nextInt();if(dayNum1||dayNum>366) {System.out.println("DAY NUMBER OUT OF RANGE");return;        }if(n1||n>100) {System.out.println("DATE AFTER (N DAYS) OUT OF RANGE");return;        }StringdateStr=computeDate(dayNum, year);intnDays=dayNum+n;intnYear=year;booleanleap=isLeapYear(year);if(leap&&nDays>366) {            nYear=nYear+1;            nDays=nDays-366;        }elseif(nDays>365) {            nYear=nYear+1;            nDays=nDays-365;        }StringnDateStr=computeDate(nDays, nYear);System.out.println();System.out.println("DATE:"+dateStr);System.out.println("DATE AFTER"+n+"DAYS:"+nDateStr);    }}Output

Question 2

Question 2Write a program to declare a single-dimensional array a[] and a square matrix b[][] 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.Fill the square matrix b[][] in the following format:If the array a[] = {5, 2, 8, 1} then, after sorting a[] = {1, 2, 5, 8}Then, the matrix b[][] would fill as below:1258125112121125\begin{matrix} 1 & 2 & 5 & 8 \ 1 & 2 & 5 & 1 \ 1 & 2 & 1 & 2 \ 1 & 1 & 2 & 5 \end{matrix}1111222155128125Display the filled matrix in the above format.Test your program for the following data and some random data:Example 1INPUT:N = 3ENTER ELEMENTS OF SINGLE DIMENSIONAL ARRAY: 3 1 7OUTPUT:SORTED ARRAY: 1 3 7FILLED MATRIX137131113\begin{matrix} 1 & 3 & 7 \ 1 & 3 & 1 \ 1 & 1 & 3 \end{matrix}111331713Example 2INPUT:N = 13OUTPUT:MATRIX SIZE OUT OF RANGEExample 3INPUT:N = 5ENTER ELEMENTS OF SINGLE DIMENSIONAL ARRAY: 10 2 5 23 6OUTPUT:SORTED ARRAY: 2 5 6 10 23FILLED MATRIX25610232561022562525256225610\begin{matrix} 2 & 5 & 6 & 10 & 23 \ 2 & 5 & 6 & 10 & 2 \ 2 & 5 & 6 & 2 & 5 \ 2 & 5 & 2 & 5 & 6 \ 2 & 2 & 5 & 6 & 10 \end{matrix}22222555526662510102562325610Solutionimport java.util.Scanner; public class Array { public static void sortArray(int arr[]) { int n = arr.length; for (int i = 0; i < n - 1; i++) { for (int j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { int t = arr[j]; arr[j] = arr[j+1]; arr[j+1] = t; } } } } public static void main(String args[]) { Scanner in = new Scanner(System.in); System.out.print("ENTER VALUE OF N: "); int n = in.nextInt(); if (n <= 2 || n >= 10) { System.out.println("MATRIX SIZE OUT OF RANGE"); return; } int a[] = new int[n]; int b[][] = new int[n][n]; System.out.println("ENTER ELEMENTS OF SINGLE DIMENSIONAL ARRAY:"); for (int i = 0; i < n; i++) { a[i] = in.nextInt(); } sortArray(a); System.out.println("SORTED ARRAY:"); for (int i = 0; i < n; i++) { System.out.print(a[i] + " "); } for (int i = n - 1, r = 0; i >= 0; i--, r++) { for (int j = 0; j <= i; j++) { b[r][j] = a[j]; } for (int k = n - 1; k > i; k--) { b[r][k] = a[k - i - 1]; } } System.out.println(); System.out.println("FILLED MATRIX:"); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { System.out.print(b[i][j] + " "); } System.out.println(); } } }Output

Accepted Answer

importjava.util.Scanner;publicclassArray{publicstaticvoidsortArray(intarr[]) {intn=arr.length;for(inti=0; in-1; i++) {for(intj=0; jn-i-1; j++) {if(arr[j]>arr[j+1]) {intt=arr[j];                    arr[j]=arr[j+1];                    arr[j+1]=t;                }            }         }    }publicstaticvoidmain(Stringargs[]) {Scannerin=newScanner(System.in);System.out.print("ENTER VALUE OF N:");intn=in.nextInt();if(n2||n>=10) {System.out.println("MATRIX SIZE OUT OF RANGE");return;        }inta[]=newint[n];intb[][]=newint[n][n];System.out.println("ENTER ELEMENTS OF SINGLE DIMENSIONAL ARRAY:");for(inti=0; in; i++) {            a[i]=in.nextInt();        }                sortArray(a);System.out.println("SORTED ARRAY:");for(inti=0; in; i++) {System.out.print(a[i]+"");        }for(inti=n-1, r=0; i>=0; i--, r++) {for(intj=0; ji; j++) {                b[r][j]=a[j];            }for(intk=n-1; k>i; k--) {                b[r][k]=a[k-i-1];            }        }System.out.println();System.out.println("FILLED MATRIX:");for(inti=0; in; i++) {for(intj=0; jn; j++) {System.out.print(b[i][j]+"");            }System.out.println();        }    }}Output

Question 3

Question 3Write a program to accept a sentence which may be terminated by either ‘.’, ‘?’ or ‘!’ only. The words are to be separated by a single blank space and are in uppercase.Perform the following tasks:(a) Check for the validity of the accepted sentence.(b) Convert the non-palindrome words of the sentence into palindrome words by concatenating the word by its reverse (excluding the last character).Example:The reverse of the word HELP would be LEH (omitting the last alphabet) and by concatenating both, the new palindrome word is HELPLEH. Thus, the word HELP becomes HELPLEH.Note: The words which end with repeated alphabets, for example ABB would become ABBA and not ABBBA and XAZZZ becomes XAZZZAX.[Palindrome word: Spells same from either side. Example: DAD, MADAM etc.](c) Display the original sentence along with the converted sentence.Test your program for the following data and some random data:Example 1INPUT:THE BIRD IS FLYING.OUTPUT:THE BIRD IS FLYING.THEHT BIRDRIB ISI FLYINGNIYLFExample 2INPUT:IS THE WATER LEVEL RISING?OUTPUT:IS THE WATER LEVEL RISING?ISI THEHT WATERETAW LEVEL RISINGNISIRExample 3INPUT:THIS MOBILE APP LOOKS FINE.OUTPUT:THIS MOBILE APP LOOKS FINE.THISIHT MOBILELIBOM APPA LOOKSKOOL FINENIFExample 3INPUT:YOU MUST BE CRAZY#OUTPUT:INVALID INPUTSolutionimport java.util.*;

public class Palindrome
{

public static boolean isPalindrome(String word) {
        boolean palin = true;
        
        int len = word.length();
        for (int i = 0; i <= len / 2; i++) {
            if (word.charAt(i) != word.charAt(len - 1 - i)) {
                palin = false;
                break;
            }
        }
        
        return palin;
    }
    
    public static String makePalindrome(String word) {
        int len = word.length();
        char lastChar = word.charAt(len - 1);
        int i = len - 1;
        while (word.charAt(i) == lastChar) {
            i--;
        }
        
        StringBuffer sb = new StringBuffer(word);
        for (int j = i; j >= 0; j--) {
            sb.append(word.charAt(j));
        }
        
        return sb.toString();
    }
    
    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);
        System.out.println("ENTER THE SENTENCE:");
        String ipStr = in.nextLine().trim().toUpperCase();
        int len = ipStr.length();
        
        char lastChar = ipStr.charAt(len - 1);
        if (lastChar != '.' 
            && lastChar != '?' 
            && lastChar != '!') {
                System.out.println("INVALID INPUT");
                return;
        }
        
        String str = ipStr.substring(0, len - 1);
        
        StringTokenizer st = new StringTokenizer(str);
        StringBuffer sb = new StringBuffer();
        
        while (st.hasMoreTokens()) {
            String word = st.nextToken();
            boolean isPalinWord = isPalindrome(word);
            if (isPalinWord) {
                sb.append(word);
            }
            else {
                String palinWord = makePalindrome(word);
                sb.append(palinWord);
            }
            sb.append(" ");
        }

String convertedStr = sb.toString().trim();
        
        System.out.println();
        System.out.println(ipStr);
        System.out.println(convertedStr);
    }
}Output

Accepted Answer

importjava.util.*;publicclassPalindrome{publicstaticbooleanisPalindrome(Stringword) {booleanpalin=true;intlen=word.length();for(inti=0; ilen/2; i++) {if(word.charAt(i)!=word.charAt(len-1-i)) {                palin=false;break;            }        }returnpalin;    }publicstaticStringmakePalindrome(Stringword) {intlen=word.length();charlastChar=word.charAt(len-1);inti=len-1;while(word.charAt(i)==lastChar) {            i--;        }StringBuffersb=newStringBuffer(word);for(intj=i; j>=0; j--) {            sb.append(word.charAt(j));        }returnsb.toString();    }publicstaticvoidmain(Stringargs[]) {Scannerin=newScanner(System.in);System.out.println("ENTER THE SENTENCE:");StringipStr=in.nextLine().trim().toUpperCase();intlen=ipStr.length();charlastChar=ipStr.charAt(len-1);if(lastChar!='.'&&lastChar!='?'&&lastChar!='!') {System.out.println("INVALID INPUT");return;        }Stringstr=ipStr.substring(0, len-1);StringTokenizerst=newStringTokenizer(str);StringBuffersb=newStringBuffer();while(st.hasMoreTokens()) {Stringword=st.nextToken();booleanisPalinWord=isPalindrome(word);if(isPalinWord) {                sb.append(word);            }else{StringpalinWord=makePalindrome(word);                sb.append(palinWord);            }            sb.append("");        }StringconvertedStr=sb.toString().trim();System.out.println();System.out.println(ipStr);System.out.println(convertedStr);    }}Output

Solved 2019 Practical Paper ISC Computer Science