Design a class Convert to find the date and the month from a given day number for a
particular year.

Example: If day number is 64 and the year is 2020, then the corresponding date would
be:

March 4, 2020 i.e. (31 + 29 + 4 = 64)

Some of the members of the class are given below:

Classname : Convert

Data members/instance variables:

n : integer to store the day number
d : integer to store the day of the month (date)
m integer to store the month
y : integer to store the year

Methods/Member functions:

Convert ( ) : constructor to initialize the data members with legal initial values

void accept( ) : to accept the day number and the year

void day_to_date( ) : converts the day number to its corresponding date for a particular year and stores the date in ‘d’ and the month in ‘m’

void display( ) : displays the month name, date and year
Specify the class Convert giving details of the constructor( ),void accept( ), void
day_to_date( ) and voiddisplay( ). Define a main( ) function to create an object and call the functions accordingly to enable the task.
            

Solution:

import java.util.*;
class Convert
{ int n,d,m,y;
    public Convert( ){
        n=0;
        y=0;
        d=0;
        m=0;
    }

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

    void day_to_date()
    {
        int a[]={31,28,31,30,31,30,31,31,30,31,30,31};
        if(y%4==0)
        {
            a[1]+=1;
        }

        while(n > a[m])
        {
            n=n-a[m];
            m++;
        }
        d=n;
        m++;
    }

    void display()
    { String x[]={"","JANUARY","FEBRUARY","MARCH","APRIL","MAY",
                "JUNE","JULY","AUGUST","SEPTEMBER","OCTOBER","NOVEMBER","DECEMBER"};
        System.out.print("\n Day Number: " + n);
        System.out.print("\n Date: " );
        System.out.print(x[m]+" " +d + "," + y);
    }

    static void main()
    {
        Convert obj =new Convert();
        obj.accept( ) ;
        obj.day_to_date();
        obj.display();
    }
}                                           
                                        

Design a class BinSearch to search for a particular value in an array.

Some of the members of the class are given below:


Classname : BinSearch

Data members/instance variables:
arr[ ] : to store integer elements
n : integer to store the size of the array

Member functions/methods:

BinSearch(int nn ) : parameterized constructor to initialize
n=nn

void fillarray( ) : to enter elements in the array

void sort( ) : sorts the array elements in ascending order using any standard sorting
technique

int bin_search(int l,int u,int v) : searches for the value ‘v’ using binary
search and recursive technique and returns its location if found otherwise returns -1        

Define the class BinSearch giving details of the constructor( ), void fillarray( ), void
sort( ) and int bin_search(int,int,int). Define the main( ) function to create an object and call the functions accordingly to enable the task.
            

Solution:

import java.util.*;
class BinSearch
{
    int arr[],n;

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

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

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

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

        }

    }
    
    static void main()
    {
            BinSearch obj = new BinSearch(5);
        obj.fillarray();
        obj.sort();
        System.out.println(" location: " + obj.bin_search(0,4,20) );
    }
}                                           
                                        

A class Mix has been defined to mix two words, character by character, in the following
manner:
The first character of the first word is followed by the first character of the second word and so on. If the words are of different length, the remaining characters of the longer word are put at the end.

Example: If the First word is “JUMP” and the second word is “STROLL”, then the required
word will be “JSUTMRPOLL”

Some of the members of the class are given below:

Classname : Mix

Data member/instance variable:

wrd : to store a word
len : to store the length of the word

Member functions/methods:

Mix( ) : default constructor to initialize the data members with legal initial values

void feedword( ) : to accept the word in UPPER case

void mix_word( Mix P, Mix Q): mixes the words of objects P and Q asstated above and stores the resultant word in the current object

void display( ) : displays the word

Specify the class Mix giving the details of the constructor( ), void feedword( ), void
mix_word( Mix, Mix ) and void display( ). Define the main( ) function to create objects
and call the functions accordingly to enable the task.
            

Solution:

import java.util.*;
class Mix
{
    String wrd;
    int len;
    Scanner sc=new Scanner(System.in);
    Mix()
    {
        wrd="";
        len=0;
    }

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

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

    void display()
    {
        System.out.println("WORD = " + wrd);
    }

    static void main()
    {
        Mix obj=new Mix();
        Mix obj1=new Mix();
        Mix obj2= new Mix();
        obj.feedword();
        obj1.feedword();
        obj2.mix_word (obj,obj1);
        obj2.display();
    }
}                                          
                                        

A Circular queue is a linear data structure which works on the principle of FIFO, enables the user to enter data from the rear end and remove data from the front end with the rear end connected to the front end to form a circular pattern. Define a class CirQueue with the following details:

Class name : CirQueue

Data member/instance variable:

cq[ ] : array to store the integers
cap : stores the maximum capacity of the array
front : to point the index of the front end
rear : to point the index of the rear end

Member functions/methods:

CirQueue (int max) : constructor to initialize the data member
cap=max, front=0 and rear=0

void push(int n) : to add integer in the queue from the rear end if possible, otherwise display the message “QUEUE IS FULL”

int pop( ) : removes and returns the integer from the front end of the queue if any, else returns -9999

void show( ) : displays the queue elements

Specify the class CirQueue giving details of the functions void push(int) and int pop( ).Assume that the other functions have been defined.

The main function and algorithm need NOT be written.                
            

Solution:

public class CirQueue
{ 
    int cq[],cap,front,rear;
    public CirQueue(int max){
        cap=max;
        cq=new int[cap];
        front=rear=0;
    }

    void push(int n)
    { 
        if(rear == cap-1)
        {
            System.out.println("QUEUE IS FULL");
        }
        else if (rear == 0)
        {
            front=rear=1;
            cq[rear]=n;
        }
        else
        {
            cq[++rear]=n;
        }
    }

    int pop()
    { 
        int n;
        if(rear == 0)
        {
            n=-999;
        }
        
        else if(front == rear)
        {
            n=cq[front];
            front=rear=0;
        }
        else
        {
            n=cq[front++];
        }
        return n;
    }
}
                                       
                                    

A linked list is formed from the objects of the class Node. The class structure of the
Node is given below:

    class Node
    {
        int n;
        Node next;
    }

Write an Algorithm OR a Method to find the product of the integer numbers from an
existing linked list.

The method declaration is as follows:

void Product_Node( Node str )

(b) Answer the following questions from the diagram of a Binary Tree given below:




(i) Write the post-order traversal of the left subtree of the above structure. 
(ii) State the degree of the Nodes E and H. 
(iii) Mention the external nodes of the right subtree. 

                            

Solution:

ALGORITHM

Step 1:Start
Step 2: Let ptr = str, P =1
Step 3: Repeat steps 3, 4 until ptr =null
Step 4: P=P* ptr.n
Step 5: Print P
Step 6: End

(b) (i) G, L D, H, F
(ii) Degree of E = 0 and H= 2
(iii) E and J