Array practice 3

package suganthan; public class Arrayprac3 { void linear_search(int a[]){int linear=3;int a1=0;for(int i=0;i<a.length;i++){if(a[i]==linear){a1=a[i];}}if(a1==linear){System.out.println(“its linear”);}else{System.out.println(“not linear”);} }void ele(int a[]){int pre=2;int count=0;for(int i=0;i<a.length;i++){if(a[i]==pre){count++;}}System.out.println(“how many times give element is present is” +count);}void finding_index(int a[]){int index=4;int a2=0;for(int i=0;i<a.length;i++){if(a[i]==index){a2=i; }}System.out.println(“Index of given number is”+ a2);}void removing_index(int a[]){int index=4;for(int i=0;i<a.length;i++){if(a[i]==index){continue;}System.out.println(a[i]);}}void placing_index(int a[]){int index=6;int pos=a.length;for(int i=0;i<=a.length-1;i++){if(a[i]==pos){System.out.println(index);}System.out.println(a[i]);}}void duplicate_count(int a[]){int index=2;int count=0;for(int i=0;i<=a.length-1;i++){if(a[i]==index){count++;}}System.out.println(count); } publicContinue reading “Array practice 3”

Array practice

package suganthan; public class Arrayprac2 {void add() //array declaration{int[] arr=new int[5];arr[0]=11;arr[1]=12;arr[2]=13;arr[3]=14;arr[4]=15;for(int i=0;i<arr.length;i++){System.out.println(arr[i]);}} void add1()//Array initialization{int a[]= {10,20,30,40,50};for(int i=0;i<a.length;i++){System.out.println(a[i]);}}void add2()//Array printing reverse{int a[]= {10,20,30,40,50};for(int i=a.length-1;i>=0;i–){System.out.println(a[i]);}}void add3()// printing only even index{int a[]= {2,3,4,5,6,7,8};for(int i=0;i<a.length;i++){ if(a[i]%2==0){System.out.println(a[i]);} }}void add4()// printing only odd index{int a[]= {2,3,4,5,6,7,8};for(int i=0;i<a.length;i++){ if(a[i]%2!=0){System.out.println(a[i]);} }}void add5()// Finding total and percentage of the mark{int a[]= {10,20,30,40,50};int per=0;for(intContinue reading “Array practice”

Polymorphism

Polymorphism means “many forms”, and it occurs when we have many classes that are related to each other by inheritance. Like we specified in the previous chapter; Inheritance lets us inherit attributes and methods from another class. Polymorphism uses those methods to perform different tasks. This allows us to perform a single action in different ways. For example, thinkContinue reading “Polymorphism”

java.lang.object

The java.lang.Object class is the root of the class hierarchy. Every class has Object as a superclass. All objects, including arrays, implement the methods of this class. Class Object is the root of the class hierarchy. Every class has Object as a superclass. All objects, including arrays, implement the methods of this class. The Object class provides multiple methods which areContinue reading “java.lang.object”

Pattern Practice 3

package suganthan; public class Patternpract {void add(){System.out.println( ” “);for(int row=1;row<=7;row++){ for(int col=1;col<=7;col++){if(( row==1) || (row==4) || (row==7) || ((col==1)&&(row<5)) || ((col==7)&&(row>4))){  System.out.print(“S “);}else{System.out.print(”  “);} } System.out.println();}}void add2(){System.out.println( ” “);for(int row=1;row<=7;row++){ for(int col=1;col<=7;col++){if(row==1 || row==7 || col==1 || ((col==7 && row>=4)) ||((row==4 && col>=4))){  System.out.print(“G “);}else{System.out.print(”  “);} } System.out.println();}}void add1(){System.out.println( ” “);for(int row=1;row<=7;row++){ for(int col=1;col<=7;col++){if( row==7Continue reading “Pattern Practice 3”

Pattern practice 2:

public class Pattern1 {void add() {for(int row=5;row>=1;row–){for(int col=1;col<=row;col++){System.out.print(row+” “);     }    System.out.println();}}public static void main(String[] args) {    Pattern1 p1=new Pattern1();    p1.add();} } OUTPUT: 5 5 5 5 54 4 4 43 3 32 21 Pattern 2: public class Pattern2 {void add1() {for(int row=1;row<=5;row++){for(int col=1;col<=row;col++){System.out.print(col+” “);     }    System.out.println();}}public static void main(String[] args) {    Pattern2 p2=new Pattern2();    p2.add1();} } OUTPUT: 11 21 2 31Continue reading “Pattern practice 2:”

Looping practice 2

NEON Number program: public class Neonno {void add(int num){int square=num*num;int sum=0;while(square>0) {int rem=square%10;sum=sum+rem;square=square/10;}if(num==sum) {System.out.println(“This is NEON number”);}else {System.out.println(“Not a NEON number”);}}public static void main(String[] args) {Neonno n1=new Neonno();n.add(9); } OUTPUT: This is NEON number LEAST COMMON MULTIPLE(lcm): public class Lcm {void add(int n1,int n2) {int big=n1>n2 ? n1:n2;while(true) {if(big%n1==0 && big%n2==0) {System.out.println(big + ” isContinue reading “Looping practice 2”

Looping practice

Smallest Divisor of a given number: public class Smalldiv {void add(int n) {int div=2;while(div<n) {if(n%div==0) {System.out.println(div + ” is a smallest divisor of given number”);break;}div=div+1;}}public static void main(String[] args) {Smalldiv s1=new Smalldiv();s1.add(25);} } OUTPUT: 5 is a smallest divisor of given number Square root of a given number: public class Squareroot {void add(int n) {intContinue reading “Looping practice”

Design a site like this with WordPress.com
Get started