ISC Computer 2015 Theory Part II : Section B Fully Solved

Section B : 2015 Solved Theory

---

Question :8

A class Admission contains…………..enable the task.

//ISC 2015 Theory Question 8

//A Program by Shubham Kumar Sharma

import java.util.*;

public class Admission

{

intAdno[]=new int[100];

Admission()

    {

inti;

        for(i=0;i<100;i++)

        {

Adno[i]=0;

        }

    }

    void fillArray()

    {

        Scanner in=new Scanner(System.in);

inti;

System.out.println("Enter Admission Numbers in ascending order : ");

        for(i=0;i<100;i++)

        {

Adno[i]=in.nextInt();

        }

    }

intbinSearch(intl,intu,int v)

    {

intmid,r;

        mid=(l+u)/2;

        if(Adno[mid]==v)

        {

            r=1;

        }

        else if(l>u)

        {

            r=-1;

        }

        else if(Adno[mid]>v)

        {

            r=binSearch(l,mid-1,v);

        }

        else

        {

            r=binSearch(mid+1,u,v);

        }

        return (r);

    }

    public static void main()

    {

        Scanner in=new Scanner(System.in);

        Admission ob=new Admission();

intx,y;

ob.fillArray();

System.out.println("Enter the Admission number to be searched : ");

        x=in.nextInt();

        y=ob.binSearch(0,99,x);

        if(y==1)

        {

System.out.println("Admission number exist");

        }

        else

        {

System.out.println("Admission number does not exist");

        }

    }

}

---

Question : 9

A class Merger concatenates…………enable the task.

Sample Input : 11 and 1998

Sample Output :111998

import java.util.*;

public class Merger

{

    long n1,n2,mergNum;

Merger()

    {

        n1=0;

        n2=0;

mergNum=0;

    }

    void readNum()

    {

        Scanner in=new Scanner(System.in);

System.out.println("Enter first number : ");

        n1=in.nextLong();

System.out.println("Enter second number : ");

        n2=in.nextLong();

    }

    void joinNum()

    {

mergNum=Long.parseLong(Long.toString(n1)+Long.toString(n2));

    }

    void show()

    {

System.out.println("First Number : "+n1);

System.out.println("Second Number : "+n2);

System.out.println("Merged Number : "+mergNum);

    }

    public static void main()

    {

        Merger ob=new Merger();

ob.readNum();

ob.joinNum();

ob.show();

    }

}

---

Question : 10

A class TheString accepts a string………………..enable the task.

Sample Input :Shubham reads computer science

Sample Output :

Number of Words : 4

Number of Consonants : 27

import java.util.*;

public class TheString

{

    String str;

intlen,wordcount,cons;

TheString(String ds)

    {

str=ds;

    }

    void countFreq()

    {

        String s[];

inti;

        char c;

len=str.length();

        s=str.split(" ");

wordcount=s.length;

        for(i=0;i<len;i++)

        {

            c=str.charAt(i);

            if(Character.isLetter(c))

            {

                if((c!='A')||(c!='E')||(c!='I')||(c!='O')||(c!='U')||(c!='a')||(c!='e')||(c!='i')||(c!='o')||(c!='u'))

                {

                    cons++;

                }

            }

        }

    }

    void display()

    {

System.out.println("Original String : "+str);

System.out.println("Number of Words : "+wordcount);

System.out.println("Number of Consonents : "+cons);

    }

    public static void main()

    {

        Scanner in=new Scanner(System.in);

        String s;

System.out.println("Enter your string : ");

        s=in.nextLine();

TheStringob=new TheString(s);

ob.countFreq();

ob.display();

    }

}