Abhishek Singh tremblerz

## 3.asm
main:
	addi $t7, $zero, 128

	li $v0, 13
	la $a0, filename
	li $a1, 0
	li $a2, 0
	syscall
	addi $s0, $v0, 0
readFromFile:

## gist:9b757f08bd7c60c94f8a
# print_msg function takes three arguments and is equivalent to
# snprintf(“Move disk %d from %d to %d.”, $a0, $a1, $a2);

hanoi:
    slti $t0, $a0, 2
    bne $t0, $0, caseOne

    addiu $sp, $sp, -20
    sw $a0, 0($sp)
    sw $a1, 4($sp)

## guess.asm
.include "macros.asm"

.data
	# arrays
	variables:		.space		16	# [random number][low][high][guesses]
	range:			.byte		100	# Set the range [0 t0 range]

	# Constant strings
	guess1:				.asciiz		"Guess a number between "
	guess2:				.asciiz		" and "

## bubblesort.mips.s
# Copyright 2002 Manu Datta (gmail.com ID Manu dot Datta)
# All rights reserved

.data
msg1: .asciiz "\nEnter integer values followed by return (-1 terminates input): \n"
msg2: .asciiz ","
msg3: .asciiz "Bubble Sort"
msg4: .asciiz "#########pass#########"
msg5: .asciiz "\n"
msg6: .asciiz "\nNumber list has been sorted\n"

## prime_numbers.asm
.data

.text
.globl main

main:
	#li $v0, 5
	#syscall

	move $a0, $v0		#sposto l'intero in a0

## palindrome.asm
# Joseph Meyer
# Colin Zwiebel
# 3 Oct 2011
# Palindrome
# Recursive implimentation of Palindrome checking algorithm

.data
input: .asciiz		"racecar"
input_len: .word	7

## gist:ba49bd7a320c4597df40
.text
main:
	li	$a0, 5
	jal	fib
	move 	$a0, $v0
	jal	print_int
	jal	print_newline

fib:
        addiu	$sp, $sp, -12

## fparray.s
.data
break:	.asciiz	"\n"

ask: 	.asciiz "Please enter a random 4 digit number for a seed: "

input:	.float	4

list :	.word 100


## mergesort.asm
	.text

	la	$a0, info		# Load the start address of the array
	lw	$t0, length		# Load the array length
	sll	$t0, $t0, 2		# Multiple the array length by 4 (the size of the elements)
	add	$a1, $a0, $t0		# Calculate the array end address
	jal	mergesort		# Call the merge sort function
  	b	sortend			# We are finished sorting

##

## str.asm
.data
str1:	.asciiz "Enter String: "
	#.align 2
getc: 	.asciiz "Enter char: "
	#.align 2
ret: .asciiz "Character <ch> occurs in string <string> <n> times"

buffer: .space 100	#space to store our string
L1:	.space 2	#space for our char
L2:	.space 4	#space for our char’s frequency in string
	main:
	addi $t7, $zero, 128

	li $v0, 13
	la $a0, filename
	li $a1, 0
	li $a2, 0
	syscall
	addi $s0, $v0, 0
	readFromFile:
	# print_msg function takes three arguments and is equivalent to
	# snprintf(“Move disk %d from %d to %d.”, $a0, $a1, $a2);

	hanoi:
	slti $t0, $a0, 2
	bne $t0, $0, caseOne

	addiu $sp, $sp, -20
	sw $a0, 0($sp)
	sw $a1, 4($sp)
	.include "macros.asm"

	.data
	# arrays
	variables: .space 16 # [random number][low][high][guesses]
	range: .byte 100 # Set the range [0 t0 range]

	# Constant strings
	guess1: .asciiz "Guess a number between "
	guess2: .asciiz " and "
	# Copyright 2002 Manu Datta (gmail.com ID Manu dot Datta)
	# All rights reserved

	.data
	msg1: .asciiz "\nEnter integer values followed by return (-1 terminates input): \n"
	msg2: .asciiz ","
	msg3: .asciiz "Bubble Sort"
	msg4: .asciiz "#########pass#########"
	msg5: .asciiz "\n"
	msg6: .asciiz "\nNumber list has been sorted\n"
	.data

	.text
	.globl main

	main:
	#li $v0, 5
	#syscall

	move $a0, $v0 #sposto l'intero in a0
	# Joseph Meyer
	# Colin Zwiebel
	# 3 Oct 2011
	# Palindrome
	# Recursive implimentation of Palindrome checking algorithm

	.data
	input: .asciiz "racecar"
	input_len: .word 7
	.text
	main:
	li $a0, 5
	jal fib
	move $a0, $v0
	jal print_int
	jal print_newline

	fib:
	addiu $sp, $sp, -12
	.data
	break: .asciiz "\n"

	ask: .asciiz "Please enter a random 4 digit number for a seed: "

	input: .float 4

	list : .word 100
	.text

	la $a0, info # Load the start address of the array
	lw $t0, length # Load the array length
	sll $t0, $t0, 2 # Multiple the array length by 4 (the size of the elements)
	add $a1, $a0, $t0 # Calculate the array end address
	jal mergesort # Call the merge sort function
	b sortend # We are finished sorting

	##
	.data
	str1: .asciiz "Enter String: "
	#.align 2
	getc: .asciiz "Enter char: "
	#.align 2
	ret: .asciiz "Character <ch> occurs in string <string> <n> times"

	buffer: .space 100 #space to store our string
	L1: .space 2 #space for our char
	L2: .space 4 #space for our char’s frequency in string