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
34. Number pattern 9.
1
1 2 1
1 2 3 2 1
1 2 3 4 3 2 1
1 2 3 4 5 4 3 2 1
class PrintPattern
{
public static void main(String args[])
{
int n = 5;
for (int i = 1; i <= n; i++)
{
int j = n - i;
while (j > 0)
{
System.out.print(" ");
j--;
}
j = 1;
while (j <= i)
{
System.out.print(" " + j);
j++;
}
j = i - 1;
while (j > 0)
{
System.out.print(" " + j);
j--;
}
j = n - i;
while (j > 0)
{
System.out.print(" ");
j--;
}
System.out.println();
}
}
}
@java_codings
12 264
33. Number pattern 8.
5
11111
0000
111
00
1
import java.util.Scanner;
class Pattern
{
public static void main(String args[])
{
int n, i, j;
Scanner sc = new Scanner(System.in);
System.out.println("Enter the number of rows ");
n = sc.nextInt();
for (i = 1; i <= n; i++)
{
for (j = i; j <= n; j++)
{
if (i % 2 == 0)
System.out.print("0");
else
System.out.print("1");
}
System.out.println();
}
}
}
@java_codings
12 264
32. Number pattern 7.
1
23
456
7890
12345
class NumberPat7
{
public static void main(String arg[])
{
int t = 1;
for (int i = 1; i <= 5; i++)
{
for (int j = 1; j <= i; j++)
{
if (t == 10)
t = 0;
System.out.print(t++);
}
System.out.println();
}
}
}
@java_codings
12 264
31. Number pattern 6.
1
22
333
4444
55555
class NumberPat6
{
public static void main(String arg[])
{
for(int i=1;i<=5;i++)
{
for(int j=1;j<=i;j++)
{
System.out.print(i);
}
System.out.println();
}
}
}
@java_codings
12 264
30. Number pattern 5.
12345
1234
123
12
1
12
123
1234
12345
class NumberPat5
{
public static void main(String arg[])
{
int ck = 0, c = 2;
while (c > 0)
{
if (ck == 0)
{
for (int i = 1, r = 5; i <= 5; i++, r--)
{
for (int j = 1; j <= r; j++)
{
System.out.print(j);
}
System.out.println();
}
ck++;
}
else
{
for (int i = 2; i <= 5; i++)
{
for (int j = 1; j <= i; j++)
{
System.out.print(j);
}
System.out.println();
}
}
c--;
}
}
}
@java_codings
12 264
29. Number pattern 4.
1
12
123
1234
12345
1234
123
12
1
class NumberPat4
{
public static void main(String arg[])
{
int ck = 0, c = 2;
while (c > 0)
{
if (ck == 0)
{
for (int i = 1; i <= 5; i++)
{
for (int j = 1; j <= i; j++)
{
System.out.print(j);
}
System.out.println();
}
ck++;
}
else
{
for (int i = 1, r = 5 - 1; i <= 5 - 1; i++, r--)
{
for (int j = 1; j <= r; j++)
{
System.out.print(j);
}
System.out.println();
}
}
c--;
}
}
}
@java_codings
12 264
28. Number pattern 3.
12345
1234
123
12
1
class NumberPat3
{
public static void main(String arg[])
{
for (int i = 1, r = 5; i <= 5; i++, r--)
{
for (int j = 1; j <= r; j++)
{
System.out.print(j);
}
System.out.println();
}
}
}
@java_codings
12 264
27. Number pattern 2.
54321
5432
543
54
5
class NumberPat2
{
public static void main(String arg[])
{
for (int i = 1; i <= 5; i++)
{
for (int j = 5; j >= i; j--)
{
System.out.print(j);
}
System.out.println();
}
}
}
@java_codings
12 264
26. Number pattern 1.
1
12
123
1234
12345
class NumberPat1
{
public static void main(String arg[])
{
for (int i = 1; i <= 5; i++)
{
for (int j = 1; j <= i; j++)
{
System.out.print(j);
}
System.out.println();
}
}
}
@java_codings
12 264
25. Floyd Triangle
1
2 3
4 5 6
7 8 9 10
11 12 13 14 15
import java.util.Scanner;
class FloydTriangle
{
public static void main(String args[])
{
int n, num = 1, c, d;
Scanner in = new Scanner(System.in);
System.out.print("Enter the number of rows of floyd's triangle : ");
n = in.nextInt();
System.out.println("Floyd's triangle :-");
for (c = 1; c <= n; c++)
{
for (d = 1; d <= c; d++)
{
System.out.print(num + " ");
num++;
}
System.out.println();
}
}
}
@java_codings
12 264
24. Christmas tree pattern
X
X
XXX
X
XXXXX
X
XXX
XXXXXX
class ChristmasTreePattern
{
public static void main(String[] arg)
{
drawChristmasTree(4);
}
private static void drawChristmasTree(int n)
{
for (int i = 0; i < n; i++)
{
triangle(i + 1, n);
}
}
private static void triangle(int n, int max)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < max - i - 1; j++)
{
System.out.print(" ");
}
for (int j = 0; j < i * 2 + 1; j++)
{
System.out.print("X");
}
System.out.println("");
}
}
}
@java_codings
12 264
23. Christmas tree.
class ChristmasTree
{
public static final int segments = 4;
public static final int height = 4;
public static void main(String[] args)
{
makeTree();
}
public static void makeTree()
{
int maxStars = 2 * height + 2 * segments - 3;
String maxStr = "";
for (int l = 0; l < maxStars; l++)
{
maxStr += " ";
}
for (int i = 1; i <= segments; i++)
{
for (int line = 1; line <= height; line++)
{
String starStr = "";
for (int j = 1; j <= 2 * line + 2 * i - 3; j++)
{
starStr += "*";
}
for (int space = 0; space <= maxStars - (height + line + i); space++)
{
starStr = " " + starStr;
}
System.out.println(starStr);
}
}
for (int i = 0; i <= maxStars / 2; i++)
{
System.out.print(" ");
}
System.out.println(" " + "*" + " ");
for (int i = 0; i <= maxStars / 2; i++)
{
System.out.print(" ");
}
System.out.println(" " + "*" + " ");
for (int i = 0; i <= maxStars / 2 - 3; i++)
{
System.out.print(" ");
}
System.out.println(" " + "*******");
}
}
@java_Codings
12 264
22. Binary Pattern
1
01
101
0101
10101
class BinaryPattern
{
public static void main(String s[])
{
int i, j;
int count = 1;
for (i = 1; i <= 5; i++)
{
for (j = 1; j <= i; j++)
{
System.out.format("%d", count++ % 2);
if (j == i && i != 5)
System.out.println("");
}
if (i % 2 == 0)
count = 1;
else
count = 0;
}
}
}
@java_Codings
12 264
21. Alphabet Pattern
A
BB
CCC
DDDD
EEEEE
import java.util.*;
class AlphabetPattern
{
public static void main(String[] arg)
{
int line, row, col;
char ch = 'A';
Scanner scanner = new Scanner(System.in);
System.out.print("Enter number of lines : ");
line = scanner.nextInt();
for (row = 1; row <= line; row++)
{
for (col = 1; col <= row; col++)
{
System.out.print("" + ch);
}
System.out.println();
ch++;
}
}
}
@java_Codings
12 264
20. Program to Create Multiplication Table.
import java.util.Scanner;
class MultiplicationTable
{
public static void main(String args[])
{
int n, c;
System.out
.println("Enter an integer to print it's multiplication table");
Scanner in = new Scanner(System.in);
n = in.nextInt();
System.out.println("Multiplication table of " + n + " is :-");
for (c = 1; c <= 10; c++)
{
System.out.println(n + "*" + c + " = " + (n * c));
}
}
}
@Cpp_Codings
12 264
19. Program to Find Harmonic Series.
import java.util.*;
class HarmonicSeries
{
public static void main(String args[])
{
int num, i = 1;
double rst = 0.0;
Scanner in = new Scanner(System.in);
System.out.println("Enter the number for length of series");
num = in.nextInt();
while (i <= num)
{
System.out.print("1/" + i + " +");
rst = rst + (double) 1 / i;
i++;
}
System.out.println("\n\nSum of Harmonic Series is " + rst);
}
}
@java_Codings
12 264
18. Program to Find GCDLCM.
import java.util.Scanner;
class GCDLCM
{
public static void main(String args[])
{
int x, y;
Scanner sc = new Scanner(System.in);
System.out.println("Enter the two numbers: ");
x = sc.nextInt();
y = sc.nextInt();
System.out.println("GCD of two numbers is : " + gcd(x, y));
System.out.println("LCM of two numbers is : " + lcm(x, y));
}
static int gcd(int x, int y)
{
int r = 0, a, b;
a = (x > y) ? x : y; // a is greater number
b = (x < y) ? x : y; // b is smaller number
r = b;
while (a % b != 0)
{
r = a % b;
a = b;
b = r;
}
return r;
}
static int lcm(int x, int y)
{
int a;
a = (x > y) ? x : y; // a is greater number
while (true)
{
if (a % x == 0 && a % y == 0)
{
return a;
}
++a;
}
}
}
@java_codings
12 264
17. Program to Find Fraction Subtraction.
import java.util.*;
class FractionSubtraction
{
public static void main(String args[])
{
float a,b,c,d;
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a : ");
a = scanner.nextFloat();
System.out.print("Enter b : ");
b = scanner.nextFloat();
System.out.print("Enter c : ");
c = scanner.nextFloat();
System.out.print("Enter d : ");
d = scanner.nextFloat();
// fraction addition formula ((a*d)-(b*c))/(b*d)
System.out.print("Fraction subtraction : [( "+a+" * "+d+" )-( "+b+" * "+c+" ) / ( "+b+" * "+d+" )] = "+(((a*d)-(b*c))/(b*d)));
}
}
@java_codings
12 264
16. Program to Find Fraction Addition.
import java.util.*;
class FractionAdding
{
public static void main(String args[])
{
float a, b, c, d;
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a : ");
a = scanner.nextFloat();
System.out.print("Enter b : ");
b = scanner.nextFloat();
System.out.print("Enter c : ");
c = scanner.nextFloat();
System.out.print("Enter d : ");
d = scanner.nextFloat();
// fraction addition formula ((a*d)+(b*c))/(b*d)
System.out.print("Fraction Addition : [( " + a + " * " + d + " )+( " + b + " * " + c + " ) / ( " + b + " * " + d + " )] = " + (((a * d) + (b * c)) / (b * d)));
}
}
@java_codings
12 264
15. Program to Convert Decimal to Binary.
import java.util.Scanner;
class DecimalToBinary
{
public String toBinary(int n)
{
if (n == 0)
{
return "0";
}
String binary = "";
while (n > 0)
{
int rem = n % 2;
binary = rem + binary;
n = n / 2;
}
return binary;
}
public static void main(String[] args)
{
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int decimal = scanner.nextInt();
DecimalToBinary decimalToBinary = new DecimalToBinary();
String binary = decimalToBinary.toBinary(decimal);
System.out.println("The binary representation is " + binary);
}
}
@java_codings
