Professional Documents
Culture Documents
INF 120
Materia: Programación I
System.out.println(sumaEnt(8));
System.out.println(sumaPar(10));
System.out.println(sumaImpar(9));
System.out.println(factorial(5));
System.out.println(combi(5,3));
System.out.println(sumaCoef(3));
System.out.println(potencia(6,2));
System.out.println(sumaPot(6,2));
sumaTabla(4);
mostrarFactores(8);
System.out.println(sumaInter(6));
System.out.println(sumaGeo(4));
System.out.println(sumaArm(8));
System.out.println(sumaAltern(10));
System.out.println(sumaCuadrados(2));
System.out.println(sumaEscalonada(6));
System.out.println(sumaPiCuartos(9));
System.out.println(sumaProd(12));
System.out.println(sumaExpon(4,6));
System.out.println(sumaSeno(2,8));
System.out.println(sumaCoseno(4,6));
{
int s=0, c=1;
while (c<=n)
s=s+c;
c=c+1;
return s;
while (c<=n)
s=s+c;
c=c+2;
return s;
while (c<=n)
s=s+c;
c=c+2;
return s;
{
int f = 1, c = 1;
while (c <= n) {
f = f * c;
c = c + 1;
return f;
return factorial(n) /
(factorial(r)*
factorial(n-r));
while (r<=n)
c=c+combi(n,r);
if (c>m)
m=c;
r++;
return m;
}
public static int potencia(int x, int n)
while (c<=n1)
x1=x1*x;
c=c+1;
return x1;
while (c<=n)
s=s+(potencia(x, c));
c=c+1;
return s;
while (c<=n)
mul=c*d;
System.out.println(d+"*"+c+"="+mul);
c=c+1;
if(c==(n+1)){
d=d+1;
c=0;
if(d==(n+1)){
c=n+1;
int c=1,j=1;
while (c <= n)
j = c;
while (j <= n)
if (c*j == n)
System.out.println(c+"x"+j+"="+(c*j));
j=j+1;
c=c+1;
int c = 1;
int s = 0;
while (c <= n) {
if (c % 2 == 0) {
s = s + c;
} else {
s = s - c;
c = c + 1;
return s;
int i = 0;
int s = 0;
while (i <= n) {
s = s + 1 / potencia(2, i);
i = i + 1;
return s;
int i = 1;
int s = 0;
while (i <= n) {
s = s + (1 / i);
i = i + 1;
return s;
int i = 1;
int s = 0;
while (i <= n) {
i = i + 1;
return s;
int i = 1;
int s = 0;
while (i <= n) {
s = s + potencia(i, 2);
i = i + 1;
return s;
int i = 1;
int j = 1;
int s = 0;
while (i <= n) {
j = 1;
while (j <= i) {
s = s + j;
j = j + 1;
i = i + 1;
return s;
int s = 0;
int i = 0;
while (i <= n) {
i = i + 1;
return s;
int s = 0;
int i = 1;
int j = 1;
while (i <= n) {
j = i;
while (j <= n) {
s = s + i * j;
j = j + 1;
i = i + 1;
return s;
int i = 1;
int s = 0;
while (i <= n) {
s = s + (x ^ i / factorial(i));
i = i + 1;
return s;
int i = 0;
int s = 0;
while (i <= n) {
i = i + 1;
return s;
int i = 0;
int s = 0;
while (i <= n)
i = i + 1;
return s;
VISUL BASIC
Console.WriteLine(sumaentero(8)) '1
Console.WriteLine(sumapares(6)) '2
Console.WriteLine(sumaimpares(7)) '3
Console.WriteLine(factorial(5)) '4
Console.WriteLine(sumacoefbin(5)) '6
tabla(4) '9
mostrarfactores(6) '10
Console.WriteLine(sumainter(9)) '11
Console.WriteLine(sumageo(4)) '12
Console.WriteLine(sumaarm(6)) '13
Console.WriteLine(sumaalterna(4)) '14
Console.WriteLine(sumacuadrados(3)) '15
Console.WriteLine(sumaescalada(4)) '16
Console.WriteLine(sumapicuartos(3)) '17
Console.WriteLine(sumaprod(4)) '18
End Sub
Dim s = 0
Dim i = 1
Dim n = 4
While i <= n
s = s + i
i = i + 1
End While
Return s
End Function
Dim s = 0
Dim i = 1
Dim n = 4
While i <= n
s = s + 2 * i
i = i + 1
End While
Return s
End Function
Dim i = 1
Dim n = 4
While i <= n
s = s + (2 * i - 1)
i = i + 1
End While
Return s
End Function
Dim i = 1
Dim f = 1
While i <= n
f = f * i
i = i + 1
End While
Return f
End Function
End Function
Dim s = 0
Dim i = 0
While i <= n
s = s + (combi(n, i))
i = i + 1
End While
Return s
End Function
Dim p = 1
Dim i = 1
While (i <= r)
p = p * n
i = i + 1
End While
Return p
End Function
Dim i = 1
Dim s = 0
While (i <= r)
s = s + (n ^ i)
i = i + 1
End While
Return s
End Function
Sub tabla(ByVal n As Integer)
Dim c = 1
Dim r = 1
While (c <= n)
r = 1
While (r <= n)
r = r + 1
End While
c = c + 1
End While
End Sub
Dim i = 1
Dim j = 1
While (i <= n)
j = i
While (j <= n)
If (i * j = n) Then
End If
j = j + 1
End While
i = i + 1
End While
End Sub
Dim i = 1
Dim s = 0
While (i <= n)
If (i Mod 2 = 0) Then
s = s + i
Else : s = s - i
End If
i = i + 1
End While
Return s
End Function
Dim i = 0
Dim s = 0
While (i <= n)
s = s + 1 / potencia(2, i)
i = i + 1
End While
Return s
End Function
Dim i = 1
Dim s = 0
While (i <= n)
s = s + 1 / i
i = i + 1
End While
Return s
End Function
Dim i = 1
Dim s = 0
While (i <= n)
i = i + 1
End While
Return s
End Function
Dim i = 1
Dim s = 0
While (i <= n)
s = s + i ^ 2
i = i + 1
End While
Return s
End Function
Dim i = 1
Dim j = 1
Dim s = 0
While i <= n
j = 1
While j <= i
s = s + j
j = j + 1
End While
i = i + 1
End While
Return s
End Function
Dim s = 0
Dim i = 0
While (i <= n)
i = i + 1
End While
Return s
End Function
Dim i = 1
Dim j = 1
While (i <= n)
j = i
While (j <= n)
s = s + i * j
j = j + 1
End While
i = i + 1
End While
Return s
End Function
Dim i = 1
Dim s = 0
While (i <= n)
s = s + (x ^ i / factorial(i))
i = i + 1
End While
Return s
End Function
Dim i = 0
Dim s = 0
While (i <= n)
s = s + (potencia(-1, i) / factorial(2 * i + 1)) * potencia(x, 2 * i + 1)
i = i + 1
End While
Return s
End Function
Dim i = 0
Dim s = 0
While (i <= n)
i = i + 1
End While
Return s
End Function
Java
En este lenguaje estuvo más fácil , el código era más corto q los otros y me gusto más que los otro
JV.Basic
En este lenguaje estuvo un poquito complicado en las llamadas porque me confundía, lo bueno es que aprendí nuevos trucos de
cómo no confundirme...
En estos ejercicios el algoritmo cada vez se me hacía más difícil tenia que ver como poder solucionarlo.
Para resolver los ejercicios hay que aprender las primeras lógicas de este práctico.