Question

1. Write a program in Assembly language using MIPS instruction set that reads two integer numbers from the user named as start and end number and finds out all the prime numbers between start and end (including start and end). Your program should do the validation of both the numbers as follows: i. start number must be smaller or equal to the end number. ii. Both numbers must be positive. iii. The maximum value for the end number is 10000 Your program should show appropriate error messages if the value of start OR end is not valid and keep asking the user for the valid numbers. A number is a Prime number if it is divisible only by itself and 1. For example: 5, 13, 17, 19, 29------ all are prime numbers. You should write a procedure named as isPrime that receives a number (using $ao) and return (using Svo) either 0 or 1. If the number is a Prime number, the procedure should return value 1 and otherwise, To prove whether a number is a prime number, first try dividing it by 2, and see if you get a remainder equal to 0. If you do, it can't be a prime number. If you don't get a remainder equal to 0, next try dividing it by all odd numbers: 3, 5, 7, 9, 11 ... so on until you check up to the sqrt (the procedure is given below) of the number itself. If none of the numbers you tried give you a remainder equal to 0, then the number is prime. Sample Input/Output: Enter the start number: 100 Enter the end number: 50 Start number must be smaller or equal to the end number. Enter the start number: - 100 Enter the end number: 500 Both the numbers must be positive. Enter the start number: 150 Enter the end number: 250 Prime numbers = 151, 157, 163,167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241 Sample Input/Output: Enter the start number: 1000 Enter the end number: 12000 Maximum value for end number is 10000. Enter the start number: 1600 Enter the end number: 1700 Prime numbers = 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699

Answer 1

Please find the answer below.
Please do comments in case of any issue. Also, don't forget to rate the question. Thanks.

.data

prompt: .asciiz "\nEnter the start number : " #prompt for string
prompt1: .asciiz "\nEnter the end number : " #prompt for string
newLine: .asciiz "\n" #prompt for string
noPrime : .asciiz "No prime number between numbers A and B" #prompt for string
error1 : .asciiz "Start number must be smaller or equal to the end number."
error2 : .asciiz "Both the number must be positive."
prompt2 : .asciiz "Prime numbers ="

.text
.globl main

main:
askAgain:
li $s4,0

li $v0,4
la $a0,prompt #it will print prompt
syscall
li $v0,5
syscall #ask user input
move $s6,$v0

li $v0,4
la $a0,prompt1 #it will print prompt1
syscall
li $v0,5
syscall #ask user input
move $s7,$v0

blt $s7,$s6,lessError #if t2 less than or equal 0 exit
bltz $s6,zeroError
bltz $s7,zeroError

move $s5,$s6
loop:

move $a0, $s5
jal isPrime               # Send the number to the procedure!
beq $v0,1,prime
j skipPrime
prime:

beq $s4,1,skipMsg
li $v0,4
la $a0,prompt2 #it will print prompt1
syscall
skipMsg:
li $s4,1 #indicator that prime found
move $a0, $s5 #move s1 to a0 for printing
li $v0,1
syscall

li $v0,11
li $a0,',' #it will print new line
syscall

skipPrime:

add $s5,$s5,1 #add m and check condition
ble $s5,$s7,loop

j exit

isPrime:
addi   $t0, $zero, 2               # int x = 2

isPrime_test:
slt   $t1, $t0, $a0               # if (x > num)
bne   $t1, $zero, isPrime_loop      
addi   $v0, $zero, 1               # It's prime!
jr   $ra                       # return 1

isPrime_loop:                       # else
div   $a0, $t0                  
mfhi   $t3                       # c = (num % x)
slti   $t4, $t3, 1              
beq   $t4, $zero, isPrime_loop_continue   # if (c == 0)
add   $v0, $zero, $zero               # its not a prime
jr   $ra                           # return 0

isPrime_loop_continue:      
addi $t0, $t0, 1               # x++
j   isPrime_test               # continue the loop

lessError:
li $v0,4
la $a0,error1 #it will print prompt
syscall
j askAgain

zeroError:
li $v0,4
la $a0,error2 #it will print prompt
syscall
j askAgain

exit:
bnez $s4,primeFound
li $v0,4
la $a0,noPrime #it will print prompt
syscall

primeFound:

output:

lessages Run I/O Enter the start number : 100 Enter the end number : 50 Start number must be smaller or equal to the end number. Enter the start number : -100 Enter the end number : 500 Both the number must be positive. Enter the start number : 150 Enter the end number : 250 Prime numbers =151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, |-- program is finished running (dropped off bottom) --