uz
Feedback

Firibgarlarga uchmang! Telemetrio bunday kanallarni topadi va belgilaydi πŸ‘‰ Belgini koβ€˜rmoqchi boβ€˜lsangiz, obuna boβ€˜ling

Advance Java πŸ‘¨β€πŸ’»

Advance Java πŸ‘¨β€πŸ’»

Kanalga Telegram’da oβ€˜tish

This channel will serve you all the Codes and Programs of java Programming Language Contact Admin: @Pravin_Suthar Youtube channel: https://www.youtube.com/channel/UCWFwwPMuAx_DY3hi9Tin7gA Like share and subscribe my channel

Ko'proq ko'rsatish
Mamlakat belgilanmaganTexnologiyalar & Aralashmalar7 898

πŸ“ˆ Telegram kanali Advance Java πŸ‘¨β€πŸ’» analitikasi

Advance Java πŸ‘¨β€πŸ’» (@java_codings) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 12 264 obunachidan iborat bo'lib, Texnologiyalar & Aralashmalar toifasida 7 898-o'rinni egallagan.

πŸ“Š Auditoriya koβ€˜rsatkichlari va dinamika

Π½Π΅Π²Ρ–Π΄ΠΎΠΌΠΎ sanasidan buyon loyiha tez oβ€˜sib, 12 264 obunachiga ega boβ€˜ldi.

03 Dekabr, 2024 dagi oxirgi ma’lumotlarga koβ€˜ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni 0 ga, soβ€˜nggi 24 soatda esa 0 ga oβ€˜zgardi va umumiy qamrov yuqori darajada qolmoqda.

  • Tasdiqlash holati: Tasdiqlanmagan
  • Jalb etish (ER): Auditoriya oβ€˜rtacha 0% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining N/A% ini tashkil etuvchi reaksiyalarni toβ€˜playdi.
  • Post qamrovi: Har bir post oβ€˜rtacha 0 marta koβ€˜riladi; birinchi sutkada odatda 0 ta koβ€˜rish yigβ€˜iladi.
  • Reaksiyalar va oβ€˜zaro ta’sir: Auditoriya faol: har bir postga oβ€˜rtacha 0 ta reaksiya keladi.

πŸ“ Tavsif va kontent siyosati

Muallif resursni shaxsiy fikrni ifoda etish maydoni sifatida ta’riflaydi:
β€œThis channel will serve you all the Codes and Programs of java Programming Language Contact Admin: @Pravin_Suthar Youtube channel: https://www.youtube.com/channel/UCWFwwPMuAx_DY3hi9Tin7gA Like share and subscribe my channel”

Yuqori yangilanish chastotasi (oxirgi ma’lumot 04 Dekabr, 2024 da olingan) sababli kanal doimo dolzarb va katta qamrovli boβ€˜lib qoladi. Analitika auditoriya kontent bilan faol hamkorlik qilishini, uni Texnologiyalar & Aralashmalar toifasidagi muhim ta’sir nuqtasiga aylantirishini koβ€˜rsatadi.

12 264
Obunachilar
Ma'lumot yo'q24 soatlar
Ma'lumot yo'q7 kun
Ma'lumot yo'q30 kun

Ma'lumotlar yuklanmoqda

O'xshash kanallar
Ma'lumot yo'q
Muammo bormi? Iltimos, sahifani yangilang yoki bizning qo'llab-quvvatlash boshqaruvchimizga murojaat qiling>.
Taglar buluti
Ma'lumot yo'q
Muammo bormi? Iltimos, sahifani yangilang yoki bizning qo'llab-quvvatlash boshqaruvchimizga murojaat qiling>.
Kirish va chiqish esdaliklari
---
---
---
---
---
---
Obunachilarni jalb qilish
Okt '26
Oktabr '260
0 kanalda
Sentabr '260
0 kanalda
Get PRO
Avgust '260
0 kanalda
Get PRO
Iyul '260
0 kanalda
Get PRO
Iyun '260
0 kanalda
Get PRO
May '260
0 kanalda
Get PRO
Aprel '260
0 kanalda
Get PRO
Mart '260
0 kanalda
Get PRO
Fevral '260
0 kanalda
Get PRO
Yanvar '260
0 kanalda
Get PRO
Dekabr '250
0 kanalda
Get PRO
Noyabr '250
0 kanalda
Get PRO
Oktabr '250
0 kanalda
Get PRO
Sentabr '250
0 kanalda
Get PRO
Avgust '250
0 kanalda
Get PRO
Iyul '250
0 kanalda
Get PRO
Iyun '250
0 kanalda
Get PRO
May '250
0 kanalda
Get PRO
Aprel '250
0 kanalda
Get PRO
Mart '250
0 kanalda
Get PRO
Fevral '250
0 kanalda
Get PRO
Yanvar '250
0 kanalda
Get PRO
Dekabr '24
+2
0 kanalda
Get PRO
Noyabr '240
0 kanalda
Get PRO
Oktabr '240
0 kanalda
Get PRO
Sentabr '240
0 kanalda
Get PRO
Avgust '240
0 kanalda
Get PRO
Iyul '240
0 kanalda
Get PRO
Iyun '24
+53
0 kanalda
Get PRO
May '24
+59
0 kanalda
Get PRO
Aprel '24
+53
0 kanalda
Get PRO
Mart '24
+50
0 kanalda
Get PRO
Fevral '24
+51
0 kanalda
Get PRO
Yanvar '24
+1 597
0 kanalda
Get PRO
Dekabr '230
0 kanalda
Get PRO
Noyabr '230
0 kanalda
Get PRO
Oktabr '230
0 kanalda
Get PRO
Sentabr '230
0 kanalda
Get PRO
Avgust '230
0 kanalda
Get PRO
Iyul '230
0 kanalda
Get PRO
Iyun '230
0 kanalda
Get PRO
May '230
0 kanalda
Get PRO
Aprel '230
0 kanalda
Get PRO
Mart '230
0 kanalda
Get PRO
Fevral '230
0 kanalda
Get PRO
Yanvar '230
0 kanalda
Get PRO
Dekabr '220
0 kanalda
Get PRO
Noyabr '22
+350
0 kanalda
Get PRO
Oktabr '22
+295
0 kanalda
Get PRO
Sentabr '22
+417
0 kanalda
Get PRO
Avgust '22
+775
0 kanalda
Get PRO
Iyul '220
0 kanalda
Get PRO
Iyun '22
+631
0 kanalda
Get PRO
May '220
0 kanalda
Get PRO
Aprel '22
+3 711
0 kanalda
Get PRO
Mart '220
0 kanalda
Get PRO
Fevral '220
0 kanalda
Get PRO
Yanvar '220
0 kanalda
Get PRO
Dekabr '210
0 kanalda
Get PRO
Noyabr '210
0 kanalda
Get PRO
Oktabr '210
0 kanalda
Get PRO
Sentabr '210
0 kanalda
Get PRO
Avgust '210
0 kanalda
Get PRO
Iyul '210
0 kanalda
Get PRO
Iyun '21
+234
0 kanalda
Get PRO
May '21
+257
0 kanalda
Get PRO
Aprel '21
+245
0 kanalda
Get PRO
Mart '21
+230
0 kanalda
Get PRO
Fevral '21
+236
0 kanalda
Get PRO
Yanvar '21
+204
0 kanalda
Get PRO
Dekabr '20
+4 021
0 kanalda
Sana
Obunachilarni jalb qilish
Esdaliklar
Kanallar
24 Oktabr0
23 Oktabr0
22 Oktabr0
21 Oktabr0
20 Oktabr0
19 Oktabr0
18 Oktabr0
17 Oktabr0
16 Oktabr0
15 Oktabr0
14 Oktabr0
13 Oktabr0
12 Oktabr0
11 Oktabr0
Kanal postlari
Advance Java πŸ‘¨β€πŸ’»

2
https://www.instagram.com/p/C1QzC3hJoEq/?igsh=MTc4MmM1YmI2Ng==
13 004
3
Learn the basics of reacjs and setup themes from scratch. https://youtube.com/playlist?list=PLcGjb_nf4rNw89854fHsqHTeCpLaNgoEw&si=J90lPx8hFLHlqRmM You will learn in this series. 1. How to set up the project theme 2. Best practices and tips for folder structure in ReactJS 3. Basics of React 4. How to create a reusable component and reuse it in a project. 5. How to create a theme layout 6. State and Props (pass data between components)
14 718
4
MySQL complete course for beginners https://www.youtube.com/playlist?list=PLcGjb_nf4rNwjUe74arheIyIRJqdIjh1B
10 372
5
https://youtu.be/osLDmH6KBmQ Explore detailed insight of tree shaking in javascript to boost your application 10x times faster.
11 260
6
Webscraping of flipkart product using node js with practical example. https://youtu.be/_Q0EMB1McXE Please like, share and subscribe
10 505
7
https://youtu.be/qDGyf_DD8WE?si=Uw7E7y8tUkBqxbfK
9 696
8
Node js tutorial: https://www.youtube.com/watch?v=XkpbjI_GyJo&list=PLcGjb_nf4rNxR1eCFakb_-4TUA4FCOW9q
9 433
9
Javascript Tutorial: https://www.youtube.com/watch?v=wm6LNo6715o&list=PLcGjb_nf4rNwdtG7JP0j0qcgAZ74b4-5A
8 430
10
https://youtube.com/@codingfragments?si=g21jjjTZ1T07VWXX Check out this YouTube channel to learn the programming language.
8 513
11
Check out Advance Java: https://t.me/joinchat/UEKAm2OSf7thOTk1
26 690
12
62. Multidimensional Array. class MultiDimArrayExample { public static void main(String[] args) { String[][] names = {{"Mr. ", "Mrs. ", "Ms. "}, {"Smith", "Jones"}}; // Mr. Smith System.out.println(names[0][0] + names[1][0]); // Ms. Jones System.out.println(names[0][2] + names[1][1]); } } @java_codings
8 438
13
61. Missing number in an array. class MissingNumberArray { public static int count = 0; public static int position = 0; public static boolean flag = false; public static void main(String[] args) { int a[] = {0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 18, 20, 21, 23}; findMissingNumbers(a, position); } private static void findMissingNumbers(int a[], int position) { if (position == a.length - 1) return; for (; position < a[a.length - 1]; position++) { if ((a[position] - count) != position) { System.out.println("Missing Number: " + (position + count)); flag = true; count++; break; } } if (flag) { flag = false; findMissingNumbers(a, position); } } } @java_codings
7 716
14
60. Mirror Matrix. import java.util.*; class MirrorMatrix { public static void main(String[] args) { int row, column; Scanner in = new Scanner(System.in); System.out.print("Enter number of rows for matrix :"); row = in.nextInt(); System.out.print("Enter number of rows for matrix :"); column = in.nextInt(); int matrix[][] = new int[row][column]; System.out.println("Enter matrix : "); for (int i = 0; i < row; i++) { for (int j = 0; j < column; j++) { matrix[i][j] = in.nextInt(); } } System.out.println("Mirror matrix : "); for (int i = 0; i < row; i++) { for (int j = column - 1; j >= 0; j--) { System.out.print(matrix[i][j] + "\t"); } System.out.println(""); } } } @java_codings
20 216
15
59. Middle value of an array. import java.util.*; class MiddleValue { public static void main(String args[]) { int[] a; int i, j, n, sum = 0, swap, size; double t; Scanner sc = new Scanner(System.in); System.out.println("Enter size of array"); size = sc.nextInt(); a = new int[size]; System.out.println("Enter numbers "); for (i = 0; i < size; i++) { a[i] = sc.nextInt(); } System.out.println("Numbers are : "); for (i = 0; i < size; i++) { System.out.print(a[i] + " "); } //Sorting for (i = 0; i < (size - 1); i++) { for (j = 0; j < (size - i - 1); j++) { if (a[j] > a[j + 1]) { swap = a[j]; a[j] = a[j + 1]; a[j + 1] = swap; } } } System.out.println("\nNumbers in sorted order : "); for (i = 0; i < size; i++) { System.out.print(a[i] + " "); } //Finding the Middle Value if (size % 2 == 0) { n = (size + 1) / 2; t = (a[n] + a[n - 1]) / 2.0; System.out.println("\nMiddle Value is : " + t); } else { System.out.println("\nMiddle Value is : " + a[size / 2]); } } } @java_codings
15 820
16
58. Merge two array. class MergeArrayDemo { public static void main(String args[]) { Integer a[]={1,2,3,4}; Integer b[]={5,6,7,0}; Integer[] both = concat(a, b); System.out.print("\nFirst Array : "); for(int i=0;i<a.length;i++) { System.out.print(a[i]+"\t"); } System.out.print("\nSecond Array : "); for(int i=0;i<b.length;i++) { System.out.print(b[i]+"\t"); } System.out.print("\nMerged Array : "); for(int i=0;i<both.length;i++) { System.out.print(both[i]+"\t"); } } public static Integer[] concat(Integer[] a, Integer[] b) { int aLen = a.length; int bLen = b.length; Integer[] c= new Integer[aLen+bLen]; System.arraycopy(a, 0, c, 0, aLen); System.arraycopy(b, 0, c, aLen, bLen); return c; } } @java_codings
12 794
17
57. Matrix Subtraction. import java.util.Scanner; class Matrix_Subtraction { Scanner scan; int matrix1[][], matrix2[][], sub[][]; int row, column; void create() { scan = new Scanner(System.in); System.out.println("Matrix Subtraction"); // First Matrix Creation.. System.out.println("\nEnter number of rows & columns"); row = Integer.parseInt(scan.nextLine()); column = Integer.parseInt(scan.nextLine()); matrix1 = new int[row][column]; matrix2 = new int[row][column]; sub = new int[row][column]; System.out.println("Enter the data for first matrix :"); for(int i=0; i &lt row; i++) { for(int j=0; j &lt column; j++) { matrix1[i][j] = scan.nextInt(); } } // Second Matrix Creation.. System.out.println("Enter the data for second matrix :"); for(int i=0; i &lt row; i++) { for(int j=0; j &lt column; j++) { matrix2[i][j] = scan.nextInt(); } } } void display() { System.out.println("\nThe First Matrix is :"); for(int i=0; i &lt row; i++) { for(int j=0; j &lt column; j++) { System.out.print("\t" + matrix1[i][j]); } System.out.println(); } System.out.println("\n\nThe Second Matrix is :"); for(int i=0; i &lt row; i++) { for(int j=0; j &lt column; j++) { System.out.print("\t" + matrix2[i][j]); } System.out.println(); } } void sub() { for(int i=0; i &lt row; i++) { for(int j=0; j &lt column; j++) { sub[i][j] = matrix1[i][j] - matrix2[i][j]; } } System.out.println("\n\nThe Subtraction is :"); for(int i=0; i &lt row; i++) { for(int j=0; j &lt column; j++) { System.out.print("\t" + sub[i][j]); } System.out.println(); } } } class MatrixSubtractionExample { public static void main(String args[]) { Matrix_Subtraction obj = new Matrix_Subtraction(); obj.create(); obj.display(); obj.sub(); } } @java_codings
11 679
18
56. Matrix Operations. import java.util.Scanner; public class Matrices { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); System.out.print("Enter number of rows: "); int rows = scanner.nextInt(); System.out.print("Enter number of columns: "); int columns = scanner.nextInt(); System.out.println(); System.out.println("Enter first matrix"); int[][] a = readMatrix(rows, columns); System.out.println(); System.out.println("Enter second matrix"); int[][] b = readMatrix(rows, columns); int[][] sum = add(a, b); int[][] difference1 = subtract(a, b); int[][] difference2 = subtract(b, a); System.out.println(); System.out.println("A + B ="); printMatrix(sum); System.out.println(); System.out.println("A - B ="); printMatrix(difference1); System.out.println(); System.out.println("B - A ="); printMatrix(difference2); } public static int[][] readMatrix(int rows, int columns) { int[][] result = new int[rows][columns]; Scanner s = new Scanner(System.in); for (int i = 0; i < rows; i++) { for (int j = 0; j < columns; j++) { result[i][j] = s.nextInt(); } } return result; } public static int[][] add(int[][] a, int[][] b) { int rows = a.length; int columns = a[0].length; int[][] result = new int[rows][columns]; for (int i = 0; i < rows; i++) { for (int j = 0; j < columns; j++) { result[i][j] = a[i][j] + b[i][j]; } } return result; } public static int[][] subtract(int[][] a, int[][] b) { int rows = a.length; int columns = a[0].length; int[][] result = new int[rows][columns]; for (int i = 0; i < rows; i++) { for (int j = 0; j < columns; j++) { result[i][j] = a[i][j] - b[i][j]; } } return result; } public static void printMatrix(int[][] matrix) { int rows = matrix.length; int columns = matrix[0].length; for (int i = 0; i < rows; i++) { for (int j = 0; j < columns; j++) { System.out.print(matrix[i][j] + " "); } System.out.println(); } } } @java_codings
9 912
19
55. Matrix Multiplication. import java.util.Scanner; class MatrixMultiplication { public static void main(String args[]) { int m, n, p, q, sum = 0, c, d, k; Scanner in = new Scanner(System.in); System.out.println("Enter the number of rows and columns of first matrix"); m = in.nextInt(); n = in.nextInt(); int first[][] = new int[m][n]; System.out.println("Enter the elements of first matrix"); for (c = 0; c < m; c++) { for (d = 0; d < n; d++) { first[c][d] = in.nextInt(); } } System.out.println("Enter the number of rows and columns of second matrix"); p = in.nextInt(); q = in.nextInt(); if (n != p) System.out.println("Matrices with entered orders can't be multiplied with each other."); else { int second[][] = new int[p][q]; int multiply[][] = new int[m][q]; System.out.println("Enter the elements of second matrix"); for (c = 0; c < p; c++) { for (d = 0; d < q; d++) { second[c][d] = in.nextInt(); } } for (c = 0; c < m; c++) { for (d = 0; d < q; d++) { for (k = 0; k < p; k++) { sum = sum + first[c][k] * second[k][d]; } multiply[c][d] = sum; sum = 0; } } System.out.println("Product of entered matrices:-"); for (c = 0; c < m; c++) { for (d = 0; d < q; d++) { System.out.print(multiply[c][d] + "\t"); } System.out.print("\n"); } } } } @java_codings
9 108
20
54. Matrix Addition. import java.util.Scanner; class MatrixAddition { Scanner scan; int matrix1[][], matrix2[][], sum[][]; int row, column; void create() { scan = new Scanner(System.in); System.out.println("Matrix Addition"); // First Matrix Creation.. System.out.println("\nEnter number of rows & columns"); row = Integer.parseInt(scan.nextLine()); column = Integer.parseInt(scan.nextLine()); matrix1 = new int[row][column]; matrix2 = new int[row][column]; sum = new int[row][column]; System.out.println("Enter the data for first matrix :"); for(int i=0; i &lt row; i++) { for(int j=0; j &lt column; j++) { matrix1[i][j] = scan.nextInt(); } } // Second Matrix Creation.. System.out.println("Enter the data for second matrix :"); for(int i=0; i &lt row; i++) { for(int j=0; j &lt column; j++) { matrix2[i][j] = scan.nextInt(); } } } void display() { System.out.println("\nThe First Matrix is :"); for(int i=0; i &lt row; i++) { for(int j=0; j &lt column; j++) { System.out.print("\t" + matrix1[i][j]); } System.out.println(); } System.out.println("\n\nThe Second Matrix is :"); for(int i=0; i &lt row; i++) { for(int j=0; j &lt column; j++) { System.out.print("\t" + matrix2[i][j]); } System.out.println(); } } void add() { for(int i=0; i &lt row; i++) { for(int j=0; j &lt column; j++) { sum[i][j] = matrix1[i][j] + matrix2[i][j]; } } System.out.println("\n\nThe Sum is :"); for(int i=0; i &lt row; i++) { for(int j=0; j &lt column; j++) { System.out.print("\t" + sum[i][j]); } System.out.println(); } } } class MatrixAdditionExample { public static void main(String args[]) { MatrixAddition obj = new MatrixAddition(); obj.create(); obj.display(); obj.add(); } } @java_codings
8 098
Barcha postlarni koβ€˜rish