Objects - ISC Class 12 Computer Science Questions with Answers, Page 2

import java.util.Scanner;

class Colsum
{
    int mat[][];
    int m, n;

    Colsum(int mm, int nn)
    {
        m = mm;
        n = nn;
        mat = new int[m][n];
    }

    void readArray()
    {
        Scanner sc = new Scanner(System.in);
        for (int i = 0; i < m; i++)
            for (int j = 0; j < n; j++)
                mat[i][j] = sc.nextInt();
    }

    boolean check(Colsum A, Colsum B)
    {
        for (int j = 0; j < A.n; j++)
        {
            int sumA = 0, sumB = 0;
            for (int i = 0; i < A.m; i++)
            {
                sumA += A.mat[i][j];
                sumB += B.mat[i][j];
            }
            if (sumA != sumB)
                return false;
        }
        return true;
    }

    void print()
    {
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < n; j++)
                System.out.print(mat[i][j] + " ");
            System.out.println();
        }
    }

    public static void main(String[] args)
    {
        Colsum A = new Colsum(3, 3);
        A.readArray();
        Colsum B = new Colsum(3, 3);
        B.readArray();
        if (A.check(A, B))
            System.out.println("Sum of corresponding columns is equal.");
        else
            System.out.println("Sum of corresponding columns is not equal.");
    }
}

class Composite
{
    int arr[][];
    int m, n;

    Composite(int mm, int nn)
    {
        m = mm;
        n = nn;
        arr = new int[m][n];
    }

    int isComposite(int p)
    {
        if (p < 4)
            return 0;
        int count = 0;
        for (int i = 1; i <= p; i++)
            if (p % i == 0)
                count++;
        return (count > 2) ? 1 : 0;
    }

    void fill()
    {
        int num = 3;
        for (int j = 0; j < n; j++)
        {
            for (int i = 0; i < m; i++)
            {
                num++;
                while (isComposite(num) == 0)
                    num++;
                arr[i][j] = num;
            }
        }
    }

    void display()
    {
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < n; j++)
                System.out.print(arr[i][j] + "\t");
            System.out.println();
        }
    }

    public static void main(String args[])
    {
        Composite obj = new Composite(3, 3);
        obj.fill();
        obj.display();
    }
}

import java.util.Scanner;

class Evil
{
    int num;
    String bin;

    Evil()
    {
        num = 0;
        bin = "";
    }

    void acceptNum()
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a positive integer: ");
        num = sc.nextInt();
    }

    void rec_bin(int x)
    {
        if (x > 0)
        {
            rec_bin(x / 2);
            bin = bin + (x % 2);
        }
    }

    void check()
    {
        rec_bin(num);
        int count = 0;
        for (int i = 0; i < bin.length(); i++)
        {
            if (bin.charAt(i) == '1')
                count++;
        }
        if (count % 2 == 0)
            System.out.println(num + " is an Evil Number.");
        else
            System.out.println(num + " is not an Evil Number.");
    }

    public static void main(String args[])
    {
        Evil obj = new Evil();
        obj.acceptNum();
        obj.check();
    }
}

import java.util.Scanner;

class DeciHex
{
    int num;
    String hexa;

    DeciHex()
    {
        num = 0;
        hexa = "";
    }

    void getNum()
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a positive integer: ");
        num = sc.nextInt();
    }

    void convert(int n)
    {
        if (n == 0)
            return;
        int digit = n % 16;
        char ch;
        if (digit < 10)
            ch = (char) ('0' + digit);
        else
            ch = (char) ('A' + digit - 10);
        convert(n / 16);
        hexa = hexa + ch;
    }

    void display()
    {
        convert(num);
        if (hexa.equals(""))
            hexa = "0";
        System.out.println("Decimal number = " + num);
        System.out.println("Hexadecimal equivalent = " + hexa);
    }

    public static void main(String[] args)
    {
        DeciHex obj = new DeciHex();
        obj.getNum();
        obj.display();
    }
}

import java.util.Scanner;

class Encode
{
    String word, new_word;
    int length;

    Encode()
    {
        word = "";
        new_word = "";
        length = 0;
    }

    void acceptWord()
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a word: ");
        word = sc.nextLine();
        length = word.length();
    }

    void nextVowel()
    {
        for (int i = 0; i < length; i++)
        {
            char ch = word.charAt(i);
            switch (ch)
            {
                case 'A': new_word += 'E'; break;
                case 'E': new_word += 'I'; break;
                case 'I': new_word += 'O'; break;
                case 'O': new_word += 'U'; break;
                case 'U': new_word += 'A'; break;
                case 'a': new_word += 'e'; break;
                case 'e': new_word += 'i'; break;
                case 'i': new_word += 'o'; break;
                case 'o': new_word += 'u'; break;
                case 'u': new_word += 'a'; break;
                default: new_word += ch;
            }
        }
    }

    void display()
    {
        System.out.println("Original word : " + word);
        System.out.println("Encoded word  : " + new_word);
    }

    public static void main(String args[])
    {
        Encode obj = new Encode();
        obj.acceptWord();
        obj.nextVowel();
        obj.display();
    }
}

import java.util.Scanner;

class Pronic
{
    int num;

    Pronic()
    {
        num = 0;
    }

    void acceptnum()
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a positive integer: ");
        num = sc.nextInt();
    }

    boolean ispronic(int v)
    {
        return ispronic(v, 0);
    }

    boolean ispronic(int v, int n)
    {
        if (n > v)
            return false;
        else if (n * (n + 1) == v)
            return true;
        else
            return ispronic(v, n + 1);
    }

    void check()
    {
        if (ispronic(num))
            System.out.println(num + " is a Pronic number.");
        else
            System.out.println(num + " is not a Pronic number.");
    }

    public static void main(String args[])
    {
        Pronic obj = new Pronic();
        obj.acceptnum();
        obj.check();
    }
}

import java.util.Scanner;

class NumDude
{
    int num;   // the number to be checked

    // default constructor
    NumDude()
    {
        num = 0;
    }

    // accepts a positive integer
    void input()
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a positive integer: ");
        num = sc.nextInt();
    }

    // returns the sum of the digits of x using recursion
    int sumDigits(int x)
    {
        if (x == 0)
            return 0;
        return (x % 10) + sumDigits(x / 10);
    }

    // checks whether num is a Dudeney number
    void isDude()
    {
        int s = sumDigits(num);
        if (s * s * s == num)
            System.out.println(num + " is a Dudeney number");
        else
            System.out.println(num + " is not a Dudeney number");
    }

    public static void main(String args[])
    {
        NumDude ob = new NumDude();
        ob.input();
        ob.isDude();
    }
}

Enter a positive integer: 5832
5832 is a Dudeney number

import java.util.*;
class Toggle
{
    String str, newstr;
    int len;

    Toggle()
    {
        str = "";
        newstr = "";
        len = 0;
    }

    void readword()
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a word: ");
        str = sc.next();
        len = str.length();
    }

    void toggle()
    {
        newstr = "";
        for (int i = 0; i < len; i++)
        {
            char ch = str.charAt(i);
            if (Character.isUpperCase(ch))
                newstr = newstr + Character.toLowerCase(ch);
            else if (Character.isLowerCase(ch))
                newstr = newstr + Character.toUpperCase(ch);
            else
                newstr = newstr + ch;
        }
    }

    void display()
    {
        System.out.println("Original word: " + str);
        System.out.println("Toggled word: " + newstr);
    }

    public static void main(String[] args)
    {
        Toggle ob = new Toggle();
        ob.readword();
        ob.toggle();
        ob.display();
    }
}

import java.util.*;
class Check
{
    String wrd;
    int len;

    Check()
    {
        wrd = "";
        len = 0;
    }

    void acceptword()
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a word: ");
        wrd = sc.next();
        len = wrd.length();
    }

    boolean palindrome()
    {
        for (int i = 0; i < len / 2; i++)
            if (wrd.charAt(i) != wrd.charAt(len - 1 - i))
                return false;
        return true;
    }

    void display()
    {
        if (palindrome())
            System.out.println(wrd + " is a palindrome word");
        else
            System.out.println(wrd + " is not a palindrome word");
    }

    public static void main(String[] args)
    {
        Check ob = new Check();
        ob.acceptword();
        ob.display();
    }
}

import java.util.Scanner;

class Special
{
    int n;

    Special()
    {
        n = 0;
    }

    void read()
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a number: ");
        n = sc.nextInt();
    }

    int factorial(int x)
    {
        if (x <= 1)
            return 1;
        return x * factorial(x - 1);
    }

    boolean isSpecial()
    {
        int sum = 0, t = n;
        while (t > 0)
        {
            sum = sum + factorial(t % 10);
            t = t / 10;
        }
        return sum == n;
    }

    void display()
    {
        if (isSpecial())
            System.out.println(n + " is a Special number");
        else
            System.out.println(n + " is not a Special number");
    }

    public static void main(String args[])
    {
        Special ob = new Special();
        ob.read();
        ob.display();
    }
}

import java.util.Scanner;

class Convert
{
    int n, d, m, y;

    Convert()
    {
        n = 0;
        d = 0;
        m = 0;
        y = 0;
    }

    void accept()
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter day number: ");
        n = sc.nextInt();
        System.out.print("Enter year: ");
        y = sc.nextInt();
    }

    void day_to_date()
    {
        int days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
        if ((y % 400 == 0) || (y % 100 != 0 && y % 4 == 0))
            days[1] = 29;
        int rem = n;
        m = 0;
        while (m < 12 && rem > days[m])
        {
            rem = rem - days[m];
            m++;
        }
        d = rem;
        m = m + 1;
    }

    void display()
    {
        String mn[] = {"January", "February", "March", "April", "May", "June", "July",
                       "August", "September", "October", "November", "December"};
        System.out.println(mn[m - 1] + " " + d + ", " + y);
    }

    public static void main(String args[])
    {
        Convert ob = new Convert();
        ob.accept();
        ob.day_to_date();
        ob.display();
    }
}

import java.util.Scanner;

class Mix
{
    String wrd;
    int len;

    Mix()
    {
        wrd = "";
        len = 0;
    }

    void feedword()
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a word in UPPER CASE: ");
        wrd = sc.next();
        len = wrd.length();
    }

    void mix_word(Mix P, Mix Q)
    {
        String s = "";
        int min = Math.min(P.len, Q.len);
        for (int i = 0; i < min; i++)
            s = s + P.wrd.charAt(i) + Q.wrd.charAt(i);
        if (P.len > Q.len)
            s = s + P.wrd.substring(min);
        else
            s = s + Q.wrd.substring(min);
        wrd = s;
        len = s.length();
    }

    void display()
    {
        System.out.println(wrd);
    }

    public static void main(String args[])
    {
        Mix a = new Mix();
        Mix b = new Mix();
        Mix c = new Mix();
        a.feedword();
        b.feedword();
        c.mix_word(a, b);
        c.display();
    }
}

import java.util.Scanner;

class Composite
{
    int arr[][];
    int m, n;

    Composite(int mm, int nn)
    {
        m = mm;
        n = nn;
        arr = new int[m][n];
    }

    int isComposite(int p)
    {
        if (p < 4)
            return 0;
        for (int i = 2; i <= p / 2; i++)
        {
            if (p % i == 0)
                return 1;
        }
        return 0;
    }

    void fill()
    {
        int num = 3;
        for (int j = 0; j < n; j++)
        {
            for (int i = 0; i < m; i++)
            {
                num++;
                while (isComposite(num) == 0)
                    num++;
                arr[i][j] = num;
            }
        }
    }

    void display()
    {
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < n; j++)
                System.out.print(arr[i][j] + "\t");
            System.out.println();
        }
    }

    public static void main(String args[])
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter the number of rows (max 20): ");
        int r = sc.nextInt();
        System.out.print("Enter the number of columns (max 20): ");
        int c = sc.nextInt();
        Composite ob = new Composite(r, c);
        ob.fill();
        ob.display();
    }
}

import java.util.Scanner;

class BinSearch
{
    int arr[];
    int n;

    BinSearch(int nn)
    {
        n = nn;
        arr = new int[n];
    }

    void fillarray()
    {
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter " + n + " elements:");
        for (int i = 0; i < n; i++)
            arr[i] = sc.nextInt();
    }

    void sort()
    {
        for (int i = 0; i < n - 1; i++)
        {
            for (int j = 0; j < n - 1 - i; j++)
            {
                if (arr[j] > arr[j + 1])
                {
                    int t = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = t;
                }
            }
        }
    }

    int bin_search(int l, int u, int v)
    {
        if (l > u)
            return -1;
        int mid = (l + u) / 2;
        if (arr[mid] == v)
            return mid;
        else if (v < arr[mid])
            return bin_search(l, mid - 1, v);
        else
            return bin_search(mid + 1, u, v);
    }

    public static void main(String args[])
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter the size of the array: ");
        int size = sc.nextInt();
        BinSearch ob = new BinSearch(size);
        ob.fillarray();
        ob.sort();
        System.out.print("Sorted array: ");
        for (int i = 0; i < size; i++)
            System.out.print(ob.arr[i] + " ");
        System.out.println();
        System.out.print("Enter the value to search: ");
        int v = sc.nextInt();
        int pos = ob.bin_search(0, size - 1, v);
        if (pos == -1)
            System.out.println(v + " not found");
        else
            System.out.println(v + " found at index " + pos);
    }
}

import java.util.Scanner;

class Sort
{
    String str, sw;
    int len;

    Sort()
    {
        str = "";
        sw = "";
        len = 0;
    }

    void readword()
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a word: ");
        str = sc.next();
        len = str.length();
    }

    void arrange()
    {
        char ch[] = str.toCharArray();
        for (int i = 0; i < len - 1; i++)
        {
            for (int j = 0; j < len - 1 - i; j++)
            {
                if (ch[j] > ch[j + 1])
                {
                    char t = ch[j];
                    ch[j] = ch[j + 1];
                    ch[j + 1] = t;
                }
            }
        }
        sw = new String(ch);
    }

    void display()
    {
        System.out.println("Original word : " + str);
        System.out.println("Sorted word   : " + sw);
    }

    public static void main(String args[])
    {
        Sort ob = new Sort();
        ob.readword();
        ob.arrange();
        ob.display();
    }
}

import java.util.Scanner;

class ArmNum
{
    int n;
    int l;

    ArmNum(int nn)
    {
        n = nn;
        l = String.valueOf(n).length();
    }

    int sum_pow(int i)
    {
        if (i == 0)
            return 0;
        else
        {
            int digit = i % 10;
            return (int) Math.pow(digit, l) + sum_pow(i / 10);
        }
    }

    void isArmstrong()
    {
        int s = sum_pow(n);
        if (s == n)
            System.out.println(n + " is an Armstrong number.");
        else
            System.out.println(n + " is not an Armstrong number.");
    }

    public static void main(String args[])
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a number: ");
        int nn = sc.nextInt();
        ArmNum obj = new ArmNum(nn);
        obj.isArmstrong();
    }
}

import java.util.Scanner;

class Rearrange
{
    String wrd, newwrd;

    Rearrange()
    {
        wrd = "";
        newwrd = "";
    }

    void readword()
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a word in UPPER CASE: ");
        wrd = sc.nextLine();
    }

    void freq_vow_con()
    {
        int vcount = 0, ccount = 0;
        for (int i = 0; i < wrd.length(); i++)
        {
            char ch = wrd.charAt(i);
            if (ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U')
                vcount++;
            else
                ccount++;
        }
        System.out.println("Number of vowels: " + vcount);
        System.out.println("Number of consonants: " + ccount);
    }

    void arrange()
    {
        String vowels = "";
        String consonants = "";
        for (int i = 0; i < wrd.length(); i++)
        {
            char ch = wrd.charAt(i);
            if (ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U')
                vowels = vowels + ch;
            else
                consonants = consonants + ch;
        }
        newwrd = vowels + consonants;
    }

    void display()
    {
        System.out.println("Original word   : " + wrd);
        System.out.println("Rearranged word  : " + newwrd);
    }

    public static void main(String args[])
    {
        Rearrange obj = new Rearrange();
        obj.readword();
        obj.freq_vow_con();
        obj.arrange();
        obj.display();
    }
}