char[] s;
Point[] p; // Where Point is a class
public static void main(String args[]) { for(int i=1;i<22;i++) System.out.print(sumofEvenFibonacci(i) + " "); } public static long sumofEvenFibonacci(int n) { // add your code here. return sum; }
0 0 2 2 2 10 10 10 44 44 44 188 188 188 798 798 798 3382 3382 3382 14328
modifier returnValueType methodName(list of parameters) {
// Method body;
}
|
class Base { public void Print() { System.out.println("Base"); } } class Derived extends Base { public void Print() { System.out.println("Derived"); } } class Main{ public static void DoPrint( Base o ) { o.Print(); } public static void main(String[] args) { Base x = new Base(); Base y = new Derived(); Derived z = new Derived(); DoPrint(x); DoPrint(y); DoPrint(z); } }
public static void main(String args[]){
Long sum=0L;
for ( long i=0; i < Integer.MAX_VALUE; i++){
sum += i;
}
System.out.println(sum);
}
public static void main(String args[]){
}
Now lets understand why do we write the above statement, the way it is written above.
Why not change it?
 |
| Binary Tree |
static methods and constants to decode class and member access modifiers. The sets of modifiers are represented as integers with distinct bit positions representing different modifiers.
% MORPHOLOGY
% histogram equalisation
filename= 'far.jpg'; % the filename to be read
im=imread(filename);
im=imresize(im,[256,256]);
im=rgb2gray(im);
figure(1);
subplot(1,2,1);
imshow(im);
BW = edge(I)
BW = edge(I,'sobel')
BW = edge(I,'prewitt')
BW = edge(I,'roberts') etc.
Description :
BW = edge(I) takes a grayscale or a binary image I as its input, and returns a binary image BW of the same size as I, with 1's where the function finds edges in I and 0's elsewhere.
i = imread('far.jpg');
I = rgb2gray(i);
BW1 = edge(I,'prewitt');
BW2= edge(I,'sobel');
BW3= edge(I,'roberts');
subplot (2,2,1);
imshow(I);
title('original');
subplot(2,2,2);
imshow(BW1);
title('Prewitt');
subplot(2,2,3);
imshow(BW2);
title('Sobel');
subplot(2,2,4);
imshow(BW3);
title('Roberts');
|
