Java dasturlash tili tarixi va uning tarkibi. Java dasturlash tilida identifikatorlar, operatorlar, xizmatchi so‘zlar, o‘zgaruvchilar va ularning turlari
![qilinadi. Natijada dasturning ishchi oynasi
quyidagi holatda bo’ladi.•
Tilning alfavit belgilaridan tilning
leksemalari shakllantiriladi:
•
1. Identifikatorlar;
•
2.Kalit (xizmatchi yoki zahiralangan)
so‘zlar;
•
3.O‘zgarmaslar;
•
4.Amallar;
•
5.Ajratuvchilar.
•
Java dasturlash tilida tuzilgan dasturlarda
izohlar C++ tili kabi dasturning istalgan
joyda berilishi mumkin. Izohlar ikki turda
bo‘ladi ular satriy va blokli ko‘rinishlarda
bo‘ladi. Satriy izohlar uchun “//” belgi
ishlatiladi, blokli izohlar uchun “/*”, “*/”
belgilari ishlatiladi.
• 1 .Tub sonlarni topish
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int n;
Scanner a= new Scanner(System.
in );
System.
out .println( "n=" ); n=a.nextInt();
if (n> 1 ){ for ( int i= 2 ; i<=n; i++){](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_3.png?v=1)
![if (n%i== 0 ){
System.out .println( "tub son emas" ); i=n;
}
else {
if (i>(n/ 2 )) { System.
out .println( "tub son" ); i=n;}
}
}
}
else System.
out .println( "1 dan katta son kiriting" );
}
}
2.
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int y, a;
Scanner z= new Scanner(System.
in );
a=z.nextInt();
y=z.nextInt();
if ((a> 0 &&a< 9 )&&(y> 0 &&y< 9 )){
for ( int n= 1 ; n< 9 ; n=n+ 1 ){
if (n== 1 ){a=a+ 2 ; y=y+ 1 ; System.
out .println( "(" +a "," +y ")" );}
else if (n== 2 ){a=a- 2 ; y=y+ 1 ;
System.
out .println( "(" +a "," +y ")" );}
else if (n== 3 ){a=a+ 1 ; y=y+ 2 ;
System.
out .println( "(" +a "," +y ")" );}
}
}
else System.
out .println( "siz 1 va 8 orasida son kiriting" );
}
}
3 .
package com.company;
import java.util.Scanner;](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_4.png?v=1)
![public class Main {
public static void main(String[] args) {
int n;
Scanner x= new Scanner(System.in );
System.
out .println( "n=" ); n=x.nextInt();
for ( int a= 2 ; a<n; a=a+ 1 ){
if (n%a== 0 ){
a=n;
}
else if (n%a!= 0 ){ }
}
}
}
if (((satr - 2 )> 0 )&&((satr - 2 )< 9 )&&((ustun -
1 )> 0 )&&((ustun - 1 )< 9 )) System.
out .println( "(" +(satr- 2 )+ "," +(ustun- 1 )+ ")" );
} break ;
}
}
}
}
4.
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int n, a1= 1 , a2= 1 , a3= 0 , s= 0 ;
Scanner a= new Scanner(System.
in );
System.
out .println( "n=" ); n=a.nextInt();
for ( int i= 1 ; i<=n; i++){
switch (i% 3 ){
case 1 : a1=a2+a3; break ;
case 2 : a2=a3+a1; break ;
case 0 : a3=a1+a2; break ;}
s=s+a1+a2+a3;
}
System.
out .println( "s=" +s/ 2 );
}
}](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_5.png?v=1)
![5.Toq sonlarning juft darajalari formulasi
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int n, s= 0 ;
Scanner x= new Scanner(System.in );
n=x.nextInt();
for ( int i= 1 ; i<n; i=i+ 1 )
s = s+( int ) (Math.
pow (( 2 *n- 1 ),( 2 *n)));
System.
out .println( "yig'indi=" +s);
}
}
6. Masalasi (2n; n-1)^2
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int n, s= 0 ;
Scanner x= new Scanner(System.
in );
n=x.nextInt();
for ( int i= 1 ; i<n; i=i+ 1 )
s = s+( int ) (Math.
pow (( 2 *n- 1 ),( 2 *n)));
System.
out .println( "yig'indi=" +s);
}
}](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_6.png?v=1)
![7.Continue opiratori ustida amal
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner a= new Scanner(System.in );
int n, m, x;
n=a.nextInt();
m=a.nextInt();
x=a.nextInt();
int s= 0 ;
for ( int i=n; i<=m; i++){
if (i%x== 0 ){ continue ;}
else { s=s+i;}
}
System.
out .println( "s=" +s);
}
}
8.K>0 son berilgan bo‘lsin. Fibonachi sonlarining K dan katta bo‘lgan
birinchi hadini toping
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_7.png?v=1)
![int a1= 1 , a2= 1 , a3= 0 ;
Scanner a= new Scanner(System.in );
int k ;
System.
out .println( "k=" ); k=a.nextInt();
if (k> 0 ){
for ( int i= 1 ; i<= 100 ; i++){
switch (i% 3 ){
case 1 : a1=a2+a3; if (a1>k)
{ System.
out .println( "Fibonachchi=" +a1+ " i=" +i); i= 101 ;} break ;
case 2 : a2=a3+a1; if (a2>k)
{System.
out .println( "Fibonachchi=" +a2+ " i=" +i);i= 101 ;} break ;
case 0 : a3=a1+a2; if (a3>k)
{ System.
out .println( "Fibonachchi=" +a3+ " i=" +i);i= 101 ;} break ;}
}}
else System.
out .println( "k ga natural son kiriting" );
}
}
9.Tub sonlarni topish
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int n;
Scanner a= new Scanner(System.
in );
System.
out .println( "n=" ); n=a.nextInt();
if (n> 1 ){ for ( int i= 2 ; i<=n; i++){
if (n%i== 0 ){
System.
out .println( "tub son emas" ); i=n;
}
else {
if (i>(n/ 2 )) { System.
out .println( "tub son" ); i=n;}
}
}
}
else System.
out .println( "1 dan katta son kiriting" );
}
}
10.massev elementini chiqarish
package com.company;
import java.util.Scanner;](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_8.png?v=1)
![public class Main {
public static void main(String[] args) {
Scanner x= new Scanner(System.in );
int n ; int m ; int a[][]= new int [ 10 ][ 10 ];
System.
out .print( "n=" );
n=x.nextInt();
System.
out .print( "m=" );
m=x.nextInt();
for ( int i = 0 ; i<n ; i++)
for ( int j = 0 ; j<m ; j++)
a[i][j]=x.nextInt();
for ( int i = 0 ; i<n ; i++)
{ for ( int j = 0 ; j<m ; j++)
System.
out .print(a[i][j]+ " " );
System.
out .println( "" );
}
}
}
MAVZU: JAVA DASTURLASH TILIDA
IDENTIFIKATORLAR, OPERATORLAR, XIZMATCHI
SO’ZLAR, O‘ZGARUVCHILAR VA ULARNING
TURLARI
Reja:
1.Java tilida identifikatorlar, xizmatchi so’zlar va
operatorlar;
2.O‘zgaruvchi va uning turlari;
3.Java tilida o‘zgaruvchi va o‘zgarmaslarni e’lon
qilish.](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_9.png?v=1)
![foydalaniladi, bu so’zlar dasturlashda xizmatchi
so’zlar deyiladi. Masalan public, import, static, for,
while,… kabi so’zlar xizmatchi so’zlar bo’ladi.
Dasturlash tili tarkibida ma’lum bir vazifani
bajaruvchi xizmatchi so’zlar operatorlar deyiladi
11.Massivda 1 o’lchamli sonning maxximumini
topish.
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner x= new Scanner(System.in );
int n ; int max ; int a[]= new int [ 10 ];
System.
out .print( "n=" );
n=x.nextInt();
for ( int i= 0 ; i<n ; i++)
a[i]=x.nextInt();
max = a[ 0 ];
for ( int i= 0 ; i<n; i++){
if (a[i]>max) max=a[i];
}
System.
out .print( "max=" +max);
}
}
n=4
12 -46 35 12
max=35
12.Matritssalarni ko’paytirish ;
package com.company;
import java.util.Scanner;
public class Main {](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_11.png?v=1)
![public static void main(String[] args) {
Scanner x= new Scanner(System.in );
int n, m , a[]= new int [ 10 ]; int b[]= new int [ 10 ] ;
System.
out .print( "n=" ); n=x.nextInt();
System.
out .print( "m=" ); m=x.nextInt();
for ( int i= 0 ; i<n ; i++)
a[i]=x.nextInt();
for ( int j= 0 ; j<m ; j++)
b[j]=x.nextInt();
int s = 0 ;
for ( int i = 0 ; i<n ; i++)
s=a[i];
for ( int j= 0 ; j<m ; j++)
System.
out .print(s*b[j]+ " " );
}
}
13.massiv toqmax va juftmax; chiqarish dasturi
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner x= new Scanner(System.
in );
int n ; int m ; int a[][]= new int [ 10 ][ 10 ];
System.
out .print( "n=" );
n=x.nextInt();
System.
out .print( "m=" );
m=x.nextInt();
for ( int i = 0 ; i<n ; i++)
for ( int j = 0 ; j<m ; j++)
a[i][j]=x.nextInt();
int toqmax; int jufmax;
toqmax=a[n- 1 ][m- 1 ];
jufmax=a[n- 1 ][m- 1 ];
int j;
for ( int i = 0 ; i<n ; i++)
{ for ( j = 0 ; j<m ; j++)
if (a[i][j]% 2 == 1 &&toqmax<=a[i][j]) toqmax=a[i][j];
} System.
out .println( "toqmax=" +toqmax);
for ( int i = 0 ; i<n ; i++)](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_12.png?v=1)
![{ for ( j = 0 ; j<m ; j++)
if ((a[i][j]% 2 == 0 )&&(jufmax<=a[i][j])) jufmax=a[i][j];
}
System.out .println( "jufmax=" +jufmax);
}
}
14.
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner x= new Scanner(System.
in );
int n ; int m ; int a[][]= new int [ 10 ][ 10 ];
System.
out .print( "n=" );
n=x.nextInt();
System.
out .print( "m=" );
m=x.nextInt();
for ( int i = 0 ; i<n ; i++)
for ( int j = 0 ; j<m ; j++)
a[i][j]=x.nextInt();
/*int toqmax; int jufmax;
toqmax=a[n-1][m-1];
jufmax=a[n-1][m-1];*/](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_13.png?v=1)
![int j;
for ( int i = 0 ; i<n ; i++)
{ for ( j = 0 ; j<m ; j++)
if (a[i][j]% 2 == 1 ) System.
out .print(a[i][j]);
System.
out .println();
}
for ( int i = 0 ; i<n ; i++)
{ for ( j = 0 ; j<m ; j++)
if (a[i][j]% 2 == 0 ) System.
out .print(a[i][j]);
}
}
}
15.Max va min topish dasturi
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner dars= new Scanner(System.in);
int max,min,n,m;
n=dars.nextInt(); int a[][]= new int [ 10 ][ 10 ];
for ( int i= 1 ; i<=n; i++)
for ( int j= 1 ; j<=n; j++)
a[i][j]=dars.nextInt();
min=a[ 1 ][ 1 ]; max=a[ 1 ][ 1 ];
for ( int i= 1 ; i<=n; i++)
for ( int j= 1 ;j<=n; j++){
if (max<a[i][j] ) max=a[i][j];
if (min>a[i][j]) min=a[i][j];
}
System.out.println( "min=" +min);
System.out.println( "max=" +max);
}
}
16.
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner dars = new Scanner(System.in);
int n = dars.nextInt();
int a[][] = new int [ 10 ][ 10 ];
System.out.println( "n=" );
n = dars.nextint();
for ( int i = 1 ; i <= n; i++)
for ( int j = 1 ; j <= n; j++)](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_14.png?v=1)
![a[i][j] = dars.nextInt();
for ( int i = 1 ; i <= n; i++)
for ( int j = 1 ; j <= n; j++)
if (a[i][j] % 2 == 0 )
System.out.println(a[i][j] + " " );
for ( int i = 1 ; i <= n; i++)
for ( int j = 1 ; j <= n; j++)
if (a[i][j] % 2 == 1 )
System.out.pritln(a[i][j] + " " );
}
}
17.Bir o’lchovli massivni saralashga misol
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner dars = new Scanner(System.in);
int n, j, t, a[] = new int [ 10 ];
n = dars.nextInt();
for ( int i = 1 ; i <= n ;i++)a[i] = dars.nextInt();
for ( int i = 1 ; i < n; i++)
for (j = i + 1 ; j <= n; j++)
if (a[i] < a[j]) {
t = a[i];a[i] =a[j];a[j] = t;
}
for ( int i = 1 ; i <= n; i++)
System.out.print(a[i] + " " );
}
}
MAVZU: JAVA DASTURLASH TILI TARKIBIDAGI ARIFMETIK AMALLAR,
MANTIQIY AMALLAR VA TA’MINLASH OPERATORI
Reja:
1. Ta’minlash operatori;
2. Arifmetik amallari;](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_15.png?v=1)
![else if (b>= 90 && b<= 100 )c= 5 ;
else c= 0 ;
return c;}
public static void main(String[] args) {
Scanner x = new Scanner(System.in);
int a[] = new int [ 100 ], n, t;
n = x.nextInt();
for ( int i = 1 ; i <= n; i++)
a[i] = x.nextInt();
for ( int i = 1 ; i <= n; i++) {
t = baholash(a[i]);
System.out.print(t + " " );
}
}
}
19.Y=1!+2!+3!+…+n! faktariyalni hisolash dasturi tuzilishi
package com.company;
import java.util.Scanner;
public class Main {
public static int fak( int b) {
int c= 1 ;
for ( int i= 1 ; i<=b; i++)
c=c*i;
return c;}
public static void main(String[] args) {
Scanner x = new Scanner(System.in);
int S = 0 , n;
System.out.println( "n=" );
n = x.nextInt();
for ( int i = 1 ; i <= n; i++){ S = S + fak(i);
System.out.println(fak(i));
}
System.out.print( "fak=" +S);}
}](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_17.png?v=1)
![20.Ikkta sonli o’zgaruvchilarning qiymatlarni bir-biriga
ulab ekranga chiqarish
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner dars = new Scanner(System.in);
String x,s;
s= "Murod" ;
x= "dasturlash" ;
s=s+x;
System.out.print(s);
}
MAVZU: JAVA TILIDA TAKRORLANUVCHI JARAYONLAR VA
PARAMETR BO‘YICHA DASTURLASH Reja:
1. Takrorlanuvchi jarayonlarni dasturlash;
2. for(sikl) operatori va uning umumiy
ko‘rinishi;
3. Ichma ich sikllarni tashkil qilish
Jarayonlarni dasturlash vaqtida, ba’zi bir
masalalarni algoritmlari tarkibidagi buyruqlar
ikki va undan ortiq marta bajarilishiga to‘g’ri
keladi. Agar algoritm tarkibidagi bir necha
marta takrorlanishi kerak bo‘lgan buyruqlarni
takrorlanuvchi jarayonlar asosida dasturlash
tillarida tasvirlanmasa, bu buyruqlarni
barchasini bajarish murakkablashadi. Elektron
hisoblash mashinalarini insoniyatdan farqi
shundaki, insoniyatda bir nechta buyruqlarni
bajarish davomida toliqish holatlari bo‘lishi](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_18.png?v=1)
![Ichma ich sikllarni tashkil etish jarayonini
misollar yordamida tushuntirib o‘tamiz.
21.Berilgan s satrdagi x belginining sonini aniqlash dasturi
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner dars = new Scanner(System.in);
String s; int k= 0 ;
System.out.print( "s=" );
s=dars.next();
char x= 'a' ;
for ( int i= 0 ;i<s.length();i++)
if (s.charAt(i)==x)
k++;
System.out.println( "Berilgan satrda" +k+ "ta" +x+ "belgi bor" );
}
}
22. S satrdan so’zlar sonini aniqlash dasturi
package com.company;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner dars = new Scanner(System.in);
String s; int k= 0 ;
System.out.print( "s=" );
s=dars.next();
char x= 'a' ;
for ( int i= 0 ;i<s.length();i++)
if (s.charAt(i)== ' ' && s.charAt(i+ 1 )!= ' ' )
k++;
System.out.println(k+ 1 );
}
}](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_21.png?v=1)
![23.Asosiy main funksioyasi tarkibida “2-dastur” nomli
dastur yaratish dasturi.
package com.company;
import java.util.Formatter;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
final Formatter x;
try {
x = new Formatter( ""D: \\ 2-dastur.txt" );
System.out .println( "fayl yaratildi" );
} catch (Exception e){System.
out .println( "fayl yaratilmadi" );}
}
}
Java dasturlash tili tarkibida fayllar ustida amallar
bajarish uchun to‘g’ridan to‘g’ri main funksiyasi orqali
amalga oshirishni qarab chiqamiz. Fayllarga murojaat
qilish uchun ya’ni faylni ochish uchun yuqorida
keltirilgan class tarkibida yozilgan kodni main funksiyasi
tarkibiga yozish ta’lab etiladi. Faylni ochish jarayonini
quyidagi dastur orqali o‘rganib chiqamiz.
Misol: Asosiy main funksiya tarkibida “2-dastur” nomli fayl
yaratish dasturini tuzing .
package com.company;
import java.util.Formatter;
import java.util.Scanner;
public class Main {](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_22.png?v=1)
![public static void main(String[] args)
{
Scanner kirit= new Scanner(System.in );
final Formatter x;
try {
x= new Formatter( "2-
dastur.txt" );
System.
out .println( "Fayl
yaratildi" );
} catch (Exception e)
{System.
out .println( "Fayl yaratilmadi" );}
}
}
Natija
Fayl yaratildi
Kompyuter xotirasida joylashgan fayldagi ma’lumotlarni o‘qib olib
qayta ishlash jarayonini quyidagi dastur orqali qarab chiqamiz.
Misol. dastur.txt fayl tarkibidagi ma’lumotlarni ekranga chop
etish dasturini tuzing.
package com.company;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_23.png?v=1)
![import java.util.Formatter;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try {
File f = new File( "dastur.txt" );
Scanner uqish = new Scanner(f);
while (uqish.hasNextInt()) {
int data = uqish.nextInt();
System.
out .println(data+ 2 );
}
uqish.close();
} catch (FileNotFoundException e){
System.
out .println( "xato" );
e.printStackTrace();;
}
}
}
Kompyuter xotirasida joylashgan faylga ma’lumotlarni yozish
jarayonini quyidagi dastur orqali qarab chiqamiz.
Misol. dastur.txt faylga ma’lumot yozish dasturini tuzing.
package com.company;
import java.io.File;](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_24.png?v=1)
![import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.Formatter;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int i= 0 ;
try {
FileWriter yozish = new FileWriter( "dastur.txt" );
yozish.write( "as" );
yozish.close();
} catch (IOException e){ System.
out .print( "yozilmadi" );
e.printStackTrace();}
}
}
24. D diskda yaratilgan dasturni 2 ga ko’paytirish dasturi
package com.company;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Formatter;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try {
File f = new File( "D: \\ 2-dastur.txt" );](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_25.png?v=1)
![Scanner uqish = new Scanner(f);
while (uqish.hasNextInt()) {
int data = uqish.nextInt();
System.out .println(data * 2 );
}
uqish.close();
} catch (FileNotFoundException e) {
System.
out .println( "xato" );
e.printStackTrace();
}
}
25.D diskda yaratilgan faylni ichidagi yozuvni o’zgartirish
package com.company;
import java.io.*;
import java.util.Formatter;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try {
FileWriter yozish = new FileWriter( "D: \\ 2-dastur.txt" );
yozish.write( "matematika" );
yozish.close();
} catch (IOException e) {
System.
out .print( "yozilmadi" );
e.printStackTrace();
}
}
26.
package com.company;
import javax.swing.*;
import java.awt.*;
public class Main {
public static void main(String[] args) {
JFrame oyna= new JFrame( "Javada grafik chizish" );
oyna.setDefaultCloseOperation(JFrame.
EXIT_ON_CLOSE );
Grafika grafik= new Grafika();
oyna.add(grafik);
oyna.setSize( 300 , 400 );
oyna.setLocation( 150 , 150 );
oyna.setVisible( true );](https://docx.uz/documents/820261b3-8d59-4ade-8546-34591a003d69/page_26.png?v=1)
Java dasturlash tili tarixi va uning tarkibi. Java dasturlash tilida identifikatorlar, operatorlar, xizmatchi so‘zlar, o‘zgaruvchilar va ularning turlari