Skip to main content

creating object invoking various methods

Define a class named College as described below: 

Data Members: 1) collegeName
2) principalName
3) place

Methods : 1) constructor.
2) display() to display the collegeName, principalName, and the place.

Test this class by creating an object and then invoking the various methods.




class collegeName{ 
public String collegeName; 
public String PrincipalName; 
public String place; 
public collegeName(){ 
public void display(){ 
System.out.println("College name is "+this.collegeName); 
System.out.println("Principal name is "+this.PrincipalName); 
System.out.println("Place is "+this.place); 
class displayName{ 
public static void main(String[] args) { 
collegeName c = new collegeName(); 
c.collegeName="Siliguri Institute of Technology"; 
c.PrincipalName="Dr. Mithun Chakraborty"; 
c.place="Siliguri"; 
c.display(); 
}


OUTPUT:

College name is Siliguri Institute of Technology
Principal name is Dr. Mithun Chakraborty
Place is Siliguri


Comments

Popular posts from this blog

Normalization Types in DBMS

Normalization Types in DBMS First Normal Form (1NF) A relation will be 1NF if it contains an atomic value.  It states that an attribute of a table cannot hold multiple values. It must hold only single-valued attribute. First normal form disallows the multi-valued attribute, composite attribute, and their combinations. Example: Relation EMPLOYEE is not in 1NF because of multi-valued attribute EMP_PHONE. EMPLOYEE table: EMP_ID EMP_NAME EMP_PHONE EMP_STATE 14 John 7272826385, 9064738238 UP 20 Harry 8574783832 Bihar 12 Sam 7390372389, 8589830302 Punjab The decomposition of the EMPLOYEE table into 1NF has been shown below: EMP_ID EMP_NAME EMP_PHONE EMP_STATE 14 John 7272826385 UP 14 John 9064738238 UP 20 Harry 8574783832 Bihar 12 Sam 7390372389 Punjab 12 Sam 8589830302 Punjab Second Normal Form (2NF) In the 2NF, relational must be in 1NF.  In the second normal form, all non-key attributes are fully functional dependent on the primary key  Example: Let's assume, a school can ...

Draw the transition diagram of a finite state automation that accepts all strings over {0, 1}

Draw the transition diagram of a finite state automation that accepts all strings over {0, 1} (a) having odd number of 0’s (b) having even number of 0’s and even number of 1’s. Ans.  (a) ( having odd number of 0’s ) Ans.  (b) ( having even number of 0’s and even number of 1’s )