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

Universidad de Concepcin

Facultad de Ingeniera

Departamento de ingeniera elctrica

Solucion problema 1 :

Function:

li $t0,0 #sumapar=0 li $t1,0 #sumaimpar=0 li $t2,0 #i=0 la $a0,P #$a0=&P[] la $a1,n #$a1=& n sll $t3,$t2,3 #$t3=i*2

For: srl $a1,$a0,1 #n/2 bge $t2,$a1,IF #si i>n/2, salta a IF add $t4,$a0,$t3 #$t4= &P[2*i] lw $t5,0($t4) #$t5=P[2*i] add $t0,$t0,$t5 #sumapar=sumapar+P[2*i] addi $t4,$t4,4) #$t4=&P[2*i+1] lw $t6,0($t4) #$t6=P[2*i+1]

add $t1,$t1,$t6 #sumaimpar=sumaimpar+P[2*i+1] addi $t2,$t2,1 # i++

b FOR IF:

beq $t3,$a1,FIN #si 2*i=n , salta a FIN sll $t4,$a1,2 #n addi $t4,$t4,-4 #$t4=n-1 add $t5,$a1,$t4 #$t5=&P[n-1] lw $t4,0($t5) #$t4=P[n-1]

add $t0,$t0,$t4 #sumapar=sumapar+P[n-1] FIN: sub $v0,$t0,$t1 # $v0=sumapar-sumaimpar jr $ra # retorna $v0

Solucion problema 2 : Maymin:

move $v0,$a0 #t=s While:

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

ELSE:

slti $t1,$t0,0x61 #si $t0