Practica 10

PRACTICA 10 PROBLEMA 1(A):
a)Escriba un programa que considere un arreglo bidimensional llamado VAL de 3 x 4. Despliegue por separado el total de cada renglón.
Pseudocodigo:
1.-Inicio
val[3,4] int
Suma=0 int
R=0 int
C=0 int
for(R=0 to 2 step R=R+1)
{
for (C = 0 to 3 step C=C+1)
{
print "Introduce Dato:"
read val[R, C]
}
}
for (R = 0 to 2 step R=R+1)
{
Suma = 0;
for (C = 0 to 3 step C=C+1)
{
Suma = Suma + Val[R, C];
}
Print "La Suma Del Renglon ",R
Print "Suma
}
fin.
PRACTICA 10 PROBLEMA 1(B):
B) Despliegue por separado el total de cada columna.
Pseudocodigo:
1.-Inicio
val[3,4] int
Suma=0 int
R=0 int
C=0 int
for(R=0 to 2 step R=R+1)
{
for (C = 0 to 3 step C=C+1)
{
print "Introduce Dato:"
read val[R, C]
}
}
for (C = 0 to 3 step C=C+1)
{
Suma = 0;
for (R = 0 to 2 step R=R+1)
{
Suma = Suma + Val[R, C];
}
Print "La Suma De La Columna Es ",C
Print "Suma
}
fin.
PRACTICA 10 PROBLEMA 1(C):
C) Imprimir la columna y renglon con mayor valor.
Pseudocodigo:
1.-Inicio
val[3,4] int
Suma=0 int
Posr=0 int
Posc=0 int
Mayor=0 int
Mayorc=0 int
R=0 int
C=0 int
for (R = 0 to 2 step R=R+1)
{
for (C = 0 to 3 step C=C+1)
{
Print "Introduce Dato:"
Read Val[R, C]
}
}
for (R = 0 to 2 step R=R+1)
{
Suma = 0;
for (C = 0 to 3 step C=C+1)
{
Suma = Suma + Val[R, C];
}
if (Suma > Mayor)
{
Mayor = Suma;
PosR = R;

}
}
for (C = 0 to 3 step C=C+1)
{
Suma = 0;
for (R = 0 to 2 step R=R+1)
{
Suma = Suma + Val[R, C];
}
if (Suma > MayorC)
{
MayorC = Suma;
PosC = R;
}
}
Print "El Renglon " , PosR , "Tiene La Mayor Suma " , Mayor
print "La Columna", posc ",tiene la mayor posicion", Mayorc
Print "Suma
}
fin.
PRACTICA 10 PROBLEMA 1(D):
D) Imprimir La columna y el renglon con menor valor.
Pseudocodigo:
1.-Inicio
val[3,4] int
Suma=0 int
Posr=0 int
Posc=0 int
Menor=0 int
Menorc=0 int
R=0 int
C=0 int
for (R = 0 to 2 step R=R+1)
{
for (C = 0 to 3 step C=C+1)
{
Print "Introduce Dato:"
Read Val[R, C]
}
}
for (R = 0 to 2 step R=R+1)
{
Suma = 0;
for (C = 0 to 3 step C=C+1)
{
Suma = Suma + Val[R, C];
}
if (Suma {
Menor = Suma;
PosR = R;

}
}
for (C = 0 to 3 step C=C+1)
{
Suma = 0;
for (R = 0 to 2 step R=R+1)
{
Suma = Suma + Val[R, C];
}
if (Suma < Menorc)
{
MenorC = Suma;
Posc = C;
}
}
Print "El Renglon " , PosR , "Tiene La Menor Suma " , Menor
print "La Columna", posc ",tiene la menor posicion", Menorc
Print "Suma
}
fin.