Advance Java 👨💻
Ir al canal en Telegram
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
Mostrar másEl país no está especificadoTecnologías y Aplicaciones7 898
📈 Análisis del canal de Telegram Advance Java 👨💻
El canal Advance Java 👨💻 (@java_codings) en el segmento lingüístico de Inglés es un actor destacado. Actualmente la comunidad reúne a 12 264 suscriptores, ocupando la posición 7 898 en la categoría Tecnologías y Aplicaciones.
📊 Métricas de audiencia y dinámica
Desde su creación el невідомо, el proyecto ha mostrado un crecimiento acelerado, reuniendo a 12 264 suscriptores.
Según los últimos datos del 03 diciembre, 2024, el canal mantiene una actividad estable. En los últimos 30 días la variación de miembros fue de 0, y en las últimas 24 horas de 0, conservando un alto alcance.
- Estado de verificación: No verificado
- Tasa de interacción (ER): El promedio de interacción de la audiencia es 0%. Durante las primeras 24 horas tras publicar, el contenido suele obtener N/A% de reacciones respecto al total de suscriptores.
- Alcance de las publicaciones: Cada publicación recibe en promedio 0 visualizaciones. En el primer día suele acumular 0 visualizaciones.
- Reacciones e interacción: La audiencia responde de forma activa: el promedio de reacciones por publicación es 0.
📝 Descripción y política de contenido
El autor describe el recurso como un espacio para expresar opiniones subjetivas:
“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”
Gracias a la alta frecuencia de actualizaciones (últimos datos recibidos el 04 diciembre, 2024), el canal mantiene la vigencia y un amplio alcance. La analítica demuestra que la audiencia interactúa activamente con el contenido, lo que lo convierte en un punto de referencia dentro de la categoría Tecnologías y Aplicaciones.
12 264
Suscriptores
Sin datos24 horas
Sin datos7 días
Sin datos30 días
Archivo de publicaciones
12 264
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)
12 264
MySQL complete course for beginners
https://www.youtube.com/playlist?list=PLcGjb_nf4rNwjUe74arheIyIRJqdIjh1B
12 264
https://youtu.be/osLDmH6KBmQ
Explore detailed insight of tree shaking in javascript to boost your application 10x times faster.
12 264
Webscraping of flipkart product using node js with practical example.
https://youtu.be/_Q0EMB1McXE
Please like, share and subscribe
12 264
Javascript Tutorial:
https://www.youtube.com/watch?v=wm6LNo6715o&list=PLcGjb_nf4rNwdtG7JP0j0qcgAZ74b4-5A
12 264
https://youtube.com/@codingfragments?si=g21jjjTZ1T07VWXX
Check out this YouTube channel to learn the programming language.
12 264
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
12 264
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
12 264
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
12 264
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
12 264
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 264
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 < row; i++) {
for(int j=0; j < column; j++) {
matrix1[i][j] = scan.nextInt();
}
}
// Second Matrix Creation..
System.out.println("Enter the data for second matrix :");
for(int i=0; i < row; i++) {
for(int j=0; j < column; j++) {
matrix2[i][j] = scan.nextInt();
}
}
}
void display() {
System.out.println("\nThe First Matrix is :");
for(int i=0; i < row; i++) {
for(int j=0; j < 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 < row; i++) {
for(int j=0; j < column; j++) {
System.out.print("\t" + matrix2[i][j]);
}
System.out.println();
}
}
void sub() {
for(int i=0; i < row; i++) {
for(int j=0; j < column; j++) {
sub[i][j] = matrix1[i][j] - matrix2[i][j];
}
}
System.out.println("\n\nThe Subtraction is :");
for(int i=0; i < row; i++) {
for(int j=0; j < 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
12 264
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
12 264
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
12 264
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 < row; i++) {
for(int j=0; j < column; j++) {
matrix1[i][j] = scan.nextInt();
}
}
// Second Matrix Creation..
System.out.println("Enter the data for second matrix :");
for(int i=0; i < row; i++) {
for(int j=0; j < column; j++) {
matrix2[i][j] = scan.nextInt();
}
}
}
void display() {
System.out.println("\nThe First Matrix is :");
for(int i=0; i < row; i++) {
for(int j=0; j < 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 < row; i++) {
for(int j=0; j < column; j++) {
System.out.print("\t" + matrix2[i][j]);
}
System.out.println();
}
}
void add() {
for(int i=0; i < row; i++) {
for(int j=0; j < column; j++) {
sum[i][j] = matrix1[i][j] + matrix2[i][j];
}
}
System.out.println("\n\nThe Sum is :");
for(int i=0; i < row; i++) {
for(int j=0; j < 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
