Universidad de Concepcin

Facultad de Ingeniera
Departamento de ingeniera elctrica

Tarea n1
Arquitectura de computadores

Integrantes :
Karla Altamirano A.
Josefa Bonilla M.
Asignatura :
Arquitectura de Computadores
Profesor :
Miguel Figueroa
Fecha de entrega :
9 de abril 2015

Solucion problema 1 :

Function:
li $t0,0
li $t1,0
li $t2,0
la $a0,P
la $a1,n
sll $t3,$t2,3

#sumapar=0
#sumaimpar=0
#i=0
#$a0=&P[]
#$a1=& n
#$t3=i*2

srl $a1,$a0,1
bge $t2,$a1,IF
add $t4,$a0,$t3
lw $t5,0($t4)
add $t0,$t0,$t5
addi $t4,$t4,4)
lw $t6,0($t4)
add $t1,$t1,$t6
addi $t2,$t2,1
b FOR

#n/2
#si i>n/2, salta a IF
#$t4= &P[2*i]
#$t5=P[2*i]
#sumapar=sumapar+P[2*i]
#$t4=&P[2*i+1]
#$t6=P[2*i+1]
#sumaimpar=sumaimpar+P[2*i+1]
# i++

beq $t3,$a1,FIN
sll $t4,$a1,2
addi $t4,$t4,-4
add $t5,$a1,$t4
lw $t4,0($t5)
add $t0,$t0,$t4

#si 2*i=n , salta a FIN

#n
#$t4=n-1
#$t5=&P[n-1]
#$t4=P[n-1]
#sumapar=sumapar+P[n-1]

sub $v0,$t0,$t1
jr $ra

# $v0=sumapar-sumaimpar
# retorna $v0

For:

IF:

FIN:

Solucion problema 2 :
Maymin:
move $v0,$a0

#t=s

lb $t0,$a0
beq $t0,$ zero,FIN_1
slti $t1,$t0,0x41
beq $t1,$zero ,ELSE
addi $t0,$t0,0x20

#$t0=*s
# si $t0 == $zero, salta a FIN_1
#si $t0 < 0x41, retorna el valor $t1=1
#$t1== $zero, salta a ELSE
#*s=*s+0x20

slti $t1,$t0,0x61
beq $t1,$zero,FIN_2
addi $t0,$t0,0x20

#si $t0<0x61 , retorna el valor $t1=1

#si $t1==$zero, salta a FIN_2
#*s=*s+0x20

addi $a0,$a0,1
b while

#s=s+1

jr $ra

# retorna t

While:

ELSE:

FIN_2:

FIN_1: