Universidad Autónoma Gabriel René Moreno

Facultad de Ciencias de la Computación &

Telecomunicaciones

INF 120

Nombre: Ronald Gonzalo Villamontes Sagardia

Código Reg.: 210068078

Materia: Programación I

Carrera: Ingeniería en Redes y Telecomunicaciones

Docente: Ing. Edwin Ya pura Vargas

Santa Cruz – Bolivia

JAVA
public static void main(String[] args)

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));

public static int sumaEnt (int n)

{
 int s=0, c=1;

while (c<=n)

s=s+c;

c=c+1;

return s;

public static int sumaPar(int n)

{ int s=0, c=2;

while (c<=n)

s=s+c;

c=c+2;

return s;

public static int sumaImpar(int n)

{ int s=0, c=1;

while (c<=n)

s=s+c;

c=c+2;

return s;

public static int factorial(int n)

{
 int f = 1, c = 1;

while (c <= n) {

f = f * c;

c = c + 1;

return f;

public static int combi(int n,int r)

return factorial(n) /

(factorial(r)*

factorial(n-r));

public static int sumaCoef(int n)

int c=0, m=0, r=0;

while (r<=n)

c=c+combi(n,r);

if (c>m)

m=c;

r++;

return m;

}
public static int potencia(int x, int n)

int c=1, n1=n, x1=1;

while (c<=n1)

x1=x1*x;

c=c+1;

return x1;

public static int sumaPot(int x, int n)

int s=0, c=1;

while (c<=n)

s=s+(potencia(x, c));

c=c+1;

return s;

public static void sumaTabla(int n)

int c=1, mul, d=1;

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;

public static void mostrarFactores(int n)

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;

public static int sumaInter(int n)

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;

public static int sumaGeo(int n)

int i = 0;

int s = 0;

while (i <= n) {

s = s + 1 / potencia(2, i);

i = i + 1;

return s;

public static int sumaArm(int n)

int i = 1;

int s = 0;

while (i <= n) {

s = s + (1 / i);
 i = i + 1;

return s;

public static int sumaAltern(int n)

int i = 1;

int s = 0;

while (i <= n) {

s = s + ((-1) ^ ((i + 1) * (1 / i)));

i = i + 1;

return s;

public static int sumaCuadrados(int n)

int i = 1;

int s = 0;

while (i <= n) {

s = s + potencia(i, 2);

i = i + 1;

return s;

public static int sumaEscalonada(int n)

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;

public static int sumaPiCuartos(int n)

int s = 0;

int i = 0;

while (i <= n) {

s = s + (potencia(-1, i + 1)) * (1 / (2 * i - 1));

i = i + 1;

return s;

public static int sumaProd(int n)

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;

public static int sumaExpon(int x, int n)

int i = 1;

int s = 0;

while (i <= n) {

s = s + (x ^ i / factorial(i));

i = i + 1;

return s;

public static int sumaSeno(int x, int n) {

int i = 0;

int s = 0;

while (i <= n) {

s = s + (potencia(-1, i) / factorial(2 * i + 1)) * potencia(x, 2 * i + 1);

i = i + 1;

return s;

public static int sumaCoseno(int x, int n)

int i = 0;

int s = 0;
 while (i <= n)

{ s = s + (potencia(-1, i) / factorial(2 * i)) * potencia(x, 2 * i);

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(combi(5, 3)) '5

Console.WriteLine(sumacoefbin(5)) '6

Console.WriteLine(potencia(3, 4)) '7

Console.WriteLine(sumapot(3, 2)) '8

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

Console.WriteLine(sumaexpon(2, 6)) '19

Console.WriteLine(sumaseno(3, 4)) '19

Console.WriteLine(sumacoseno(2, 4)) '20

 Console.ReadLine()

End Sub

Function sumaentero(ByVal m As Integer) As Integer

Dim s = 0

Dim i = 1

Dim n = 4

While i <= n

s = s + i

i = i + 1

End While

Return s

End Function

Function sumapares(ByVal m As Integer) As Integer

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

Function sumaimpares(ByVal m As Integer) As Integer

 Dim s = 0

Dim i = 1

Dim n = 4

While i <= n

s = s + (2 * i - 1)

i = i + 1

End While

Return s

End Function

Function factorial(ByVal n As Integer) As Integer

Dim i = 1

Dim f = 1

While i <= n

f = f * i

i = i + 1

End While

Return f

End Function

Function combi(ByVal n As Integer, ByVal r As Integer) As Integer

Return factorial(n) / (factorial(r) * factorial(n - r))

End Function

Function sumacoefbin(ByVal n As Integer) As Integer

Dim s = 0

Dim i = 0

While i <= n

s = s + (combi(n, i))

i = i + 1
 End While

Return s

End Function

Function potencia(ByVal n As Integer, ByVal r As Integer) As Integer

Dim p = 1

Dim i = 1

While (i <= r)

p = p * n

i = i + 1

End While

Return p

End Function

Function sumapot(ByVal n As Integer, ByVal r As Integer) As Integer

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)

Console.WriteLine(Str(c) + "x" + Str(r) + "=" + Str(c * r))

r = r + 1

End While

c = c + 1

End While

End Sub

Sub mostrarfactores(n As Integer)

Dim i = 1

Dim j = 1

While (i <= n)

j = i

While (j <= n)

If (i * j = n) Then

Console.WriteLine(Str(i) + "x" + Str(j) + "=" + Str(i * j))

End If

j = j + 1

End While
 i = i + 1

End While

End Sub

Function sumainter(ByVal n As Integer) As Integer

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

Function sumageo(ByVal n As Integer) As Integer

Dim i = 0

Dim s = 0

While (i <= n)

s = s + 1 / potencia(2, i)

i = i + 1

End While

Return s
End Function

Function sumaarm(n As Integer)

Dim i = 1

Dim s = 0

While (i <= n)

s = s + 1 / i

i = i + 1

End While

Return s

End Function

Function sumaalterna(n As Integer) As Integer

Dim i = 1

Dim s = 0

While (i <= n)

s = s + potencia(-1, ((i + 1) * 1 / i))

i = i + 1

End While

Return s

End Function

Function sumacuadrados(n As Integer) As Integer

Dim i = 1

Dim s = 0

While (i <= n)

s = s + i ^ 2

i = i + 1

End While

Return s
End Function

Function sumaescalada(n As Integer) As Integer

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

Function sumapicuartos(n As Integer)

Dim s = 0

Dim i = 0

While (i <= n)

s = s + (potencia(-1, i + 1)) * (1 / (2 * i - 1))

i = i + 1

End While

Return s

End Function

Function sumaprod(n As Integer) As Integer

 Dim s = 0

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

Function sumaexpon(x As Integer, n As Integer)

Dim i = 1

Dim s = 0

While (i <= n)

s = s + (x ^ i / factorial(i))

i = i + 1

End While

Return s

End Function

Function sumaseno(x As Integer, n As Integer) As Integer

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

Function sumacoseno(x As Integer, n As Integer)

Dim i = 0

Dim s = 0

While (i <= n)

s = s + (potencia(-1, i) / factorial(2 * i)) * potencia(x, 2 * i)

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...

Comentarios de la resolución de los algoritmos.

En estos ejercicios el algoritmo cada vez se me hacía más difícil tenia que ver como poder solucionarlo.

Para llamadas para obtener el resultado,

Para resolver los ejercicios hay que aprender las primeras lógicas de este práctico.

RECOMENDACION.- QUE PARA CUALQUIER LENGUAJE ..PRIMERO SE DEBE HACER UN ANALISIS ,

LUEGO HACER LA CAJA NEGRA….. (LO QUE LE VA A ENTRAR A MI ALGORITMO), HACER EL DISEÑO
DE LA INTERFAZ ….. DESPUES HACER LA LLAMA CAUTELOSAMENTE……PORQUE SINO NOS SALDRIA
ERROR AUNQUE SE MODIFIQUE LA LOGICA….OTRA COSA ES FIJARSE QUE ME PIDE EL PROBLEMA…
DEACUERDO A ESO VOY A SOLUCIONALO DE LA MANERA QUE M SEA MAS FACIL