Javada nuqta rangini aniqlash funksiyasini misol yordamida tushuntirib bering

Klass deb nimaga aytiladi misol yordamida tushuntirib bering.

O‘zgaruvchilar deb nimaga aytiladi misol yordamida tushuntirib bering.

Javada funksiyalar (Method) deb nimaga aytiladi misol yordamida tushuntirib bering.

Meros olish (Inheritance) deb nimaga aytiladi misol yordamida tushuntirib bering.

Ko‘p formalik (Polymorphism) deb nimaga aytiladi misol yordamida tushuntirib bering.

Mavhumlik deb nimaga aytiladi misol yordamida tushuntirib bering.

Enkapsulyatsiya(Encapsulation) deb nimaga aytiladi misol yordamida tushuntirib bering.

Klass yaratish bosqichini tushuntirib bering?

Klass tarkibida metod yaratishni tushuntirib bering?

Klasdan obyekt olish va undan foydalanishni tushuntirib bering?

N natural soni va N ta butun sondan iborat massiv berilgan. TO‘plamdagi eng kichik elementlar sonini aniqlovchi dastur tuzilsin.

N natural soni va N ta butun sondan iborat massiv berilgan. To‘plamdagi ekstremal elementlar sonini aniqlovchi dastur tuzilsin. Ekstremal element deb eng katta yoki eng kichik elementga aytiladi.

package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner x=new Scanner(System.in);
int n,t=0;
n=x.nextInt();
int a[]=new int[n];
for (int i=0;ia[i] = x.nextInt();
}
int max=a[0];
for (int i=0; i{
if (a[i]>max) max = a[i];
}
System.out.println(max);
for (int i=0; iif (max == a[i]) t++;

}
System.out.println(t);
}
}

111. 
     Natural n va m hamda haqiqiy sonli A(1:n) massiv berilgan. Uning o‘rta arifmetik qiymatini toping.
     

112. 
     Natural n va m hamda haqiqiy sonli A(1:n) massiv berilgan bo‘lsin. Uning eng kattasi elementini toping.
     
113. 
     Natural n va m hamda haqiqiy sonli A(1:n, 1:m) massiv berilgan. Uning eng kichik elementi necha marta uchraydi ?
     
114. 
     N butun soni va haqiqiy sonli B(1:N, 1:N) massiv berilgan. Uning diagonal elementlari orasida eng kattasini aniqlang.
     
115. 
     Butun a1, a2, va a3 sonlari berilgan. Butun sonli B(1:3,1:3) jadval elementlarini bi,j=ai-3aj formula yordamida aniqlang. Bu jadvalning barcha elementlari ko‘paytmasini hisoblang.
     
116. 
     Butun a1, a2, a3 va a4 sonlari berilgan bo‘lsin. Butun sonli B(1:4, 1:4) jadvalning elementlari ichida a1, a2, a3 va a4 elementlar mavjud bo’lsa true aks holda false chop eting.
     
117. 
     Massivning eng katta va eng kichik elementlarining tartib raqamlarini aniqlash dasturini tuzing.
     

package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner x=new Scanner(System.in);
int n,t=0, index=0 ;
n=x.nextInt();
int a[]=new int[n];
for (int i=0;ia[i] = x.nextInt();
}
int max=a[0];
for (int i=0; i{
if (a[i]>max) max = a[i];
index=i;
}
System.out.println(max);
System.out.println(index);

for (int i=0; i

if (max == a[i]) t++;
}
System.out.println(t);

}
}