Inheritance is a future of oops(Object Oriented Programming)

Inheritance is a future of oops(Object Oriented Programming).it Used To Share The Properties of Class or a class drive from another one class is Called Inheritance. in Java Programming "extends" Keyword is used to inherit the class.

Syntax:

 class A{
  //member variables and function
 }
 class B extends class A
 {
  //member variables and function
 }

example,

 class A{
  void superclass()
  {
   System.out.println("super class");
  }
 }
 class B extends class A
 {
  public static void main()
  {
   B b=new B();
   b.superclass();
  }
 }

From The Above Java Programming Contains Two Classes Named As "A" and "B".class A contains a Member Method Named as "superclass()" and class B contains main method.then class B is Inherit(Extends) From class A.So We are call The method superclass from class B.

Comments

LPS(Longest Prefix Which Is Also Suffix) Array Generation Using Java

import java.util.* ; //Longest Prefix Which Is Also Suffix Which Is Used To Found a Pattern Through Avoid Repeated Characters in Given String. We Will Discuss KMP ALGORITHM TO Find A Pattern In Given String Latter. class lbs{ public static void main( String [] args){ Scanner in= new Scanner(System.in); //Get Input From User String s=in.nextLine(); //Convert String Into Char Array char [] ch=s.toCharArray(); int n=s.length(); int [] lbsArr= new int [n]; int j= 0 ,i= 1 ; lbsArr[ 0 ]= 0 ; //LPS ARRAY ALGORITHM /* i=1; j=0; string s="aaab" while i<n if s[i]==s[j]: lpsArr[i]=j; j=j+1 i=i+1 else: if j==0: lbsArr[j]=0 i=i+1 else: ...

Stack is Linear Data Structure- Basic DSA In Java Programming

/* Stack Is a Linear Data Structure.FIFO(First In First Out) or LIFO(Last In First Out). [ Elements ] [ Elements ] [ Elements ] [ Elements ] */ import java.util.*; class stack{ public static void main( String [] args){ Stack < Integer > s= new Stack < Integer >(); //Push Element To Stack s.push( 10 ); s.push( 5 ); s.push( 2 ); s.push( 1 ); System.out.println(s); /* After Push The Stack Like [ 1 ] <---Push And Pop In Top Of The Statck [ 2 ] [ 5 ] [ 10] */ //Pop Element From Statck s.pop(); System.out.println(s); /* After Pop From Stack [ 1 ]--> Pop From Top Of The Stack [ 5 ] [ 10] */ System.out.println(s.peek()); /* s.peek(); Shows Top Of The Stack */ /* s.empty() returns boolean V...

Linked List Cycle - A Tile of Linked is Have a Next Pointer To Header

/* Tail of linked list contains any of it node is known as circle linked list. [10]=>[20]=>[30]----| |====<===<====<===| */ //Instalize the class for list node class node{ int data; node next; node( int data){ this .data=data; } } class circleList{ node head; node tail; public void addNode( int data){ if (head== null ){ head= new node(data); tail=head; } else { tail.next= new node(data); tail=tail.next; tail.next=head; } } public void traverse(node head){ while (head!= null ){ System.out.println(head.data); head=head.next; } } public static void main( String [] args){ circleList cl=new circleList(); cl.addNode( 5 ); cl.addNode( 10 ); cl.addNode( 15 ); } }

javacpp

Search This Blog