Homework Answers
;suppose DATA is being stored in A register. ;the function works in same fashion as the above specified code. fact: DEC A ;decrementing A register MUL A ;multipling with A register MOV CL,A CMP CL,01 ;checking if CL == 1 if not calling the function recursively JNZ L1
Add Answer to:
• Program the following function in assembly. Make sure to allow recursion. int fact (int n)...
Convert the following to mips assembly: int recursion (int N) { int i, j, k; if...
Convert the following to mips assembly: int recursion (int N) { int i, j, k; if (N greater than 9) { print "End recursion\n"; return N; } print "Recursion in "; print N; print ":"; for (k=0; k less than N; k=k+1) print "x"; print "\n"; i = N + 7; j = N + 1; k = 13 - i; j = recursion (j); j = j - k; j = j + i; print "Recursion...
C++ Recursion Practice! 1)Multiplication #include <iostream.h> int Multiply(int M, int N) //Performs multiplication using the +...
C++ Recursion Practice! 1)Multiplication #include <iostream.h> int Multiply(int M, int N) //Performs multiplication using the + operator. //Pre : M and N are defined and N > 0. //Post: Returns M x N { int Prod; if (N == 1) Prod = M; //base case else Prod = M + Multiply(M, N - 1); //recursive step return Prod; } 2) Reverse #include <iostream.h> void Reverse(int N) //Displays string of length N in the reverse order //Pre : N...
C++ Recursion Code a function which displays the first n prime numbers. The prototype is: void...
C++ Recursion Code a function which displays the first n prime numbers. The prototype is: void prime (int) The number of primes to display is passed as the parameter. The function prime itself is not recursive. However, it should call a separate recursive helper function which determines if a given number is prime #include <iostream> using namespace std; void prime(int ) { } int main() { prime (21); return 0; }
Translate the following C program to Pep/9 assembly language. #include <stdio.h> int main() { int...
Translate the following C program to Pep/9 assembly language. #include <stdio.h> int main() { int number; scanf("%d", &number); if (number % 2 == 0) { printf("Even\n"); } else { printf("Odd\n"); } return 0; }
Convert the program you wrote in to an MIPS assembly program. Make sure that you show...
Convert the program you wrote in to an MIPS assembly program. Make sure that you show the symbol table (assume memory is allocated beginning address 5000) and that the equivalent assembly program is commented. int main() { int a[10]; int i = 0; while( i <= 5) { a[i]=i; a[9-i]=9-i; i++; }
Write an assembly language program that corresponds to the following C program: int width; int length;...
Write an assembly language program that corresponds to the following C program: int width; int length; int perim; int main () { scanf ("%d%d", &width, &length); perim = (width + length) * 2; printf ("width = %d\n", width); printf ("length = %d\n\n", width); printf ("perim = %d\n", perim); return 0; }
#include <stdio.h> int josephus(int n, int k) { if (n == 1) return 1; else...
#include <stdio.h> int josephus(int n, int k) { if (n == 1) return 1; else /* The position returned by josephus(n - 1, k) is adjusted because the recursive call josephus(n - 1, k) considers the original position k%n + 1 as position 1 */ return (josephus(n - 1, k) + k-1) % n + 1; } // Driver Program to test above function int main() { int n = 14; int k = 2; printf("The chosen place...
X266: Recursion Programming Exercise: log For function log, write the missing base case condition and the...
X266: Recursion Programming Exercise: log For function log, write the missing base case condition and the recursive call This function computes the log of n to the base b.As an example: log 8 to the base 2 equals 3 since 8 = 2*2*2. We can find this by dividing 8 by 2 until we reach 1, and we count the number of divisions we make. You should assume that n is exactly b to some integer power. Examples: log(2, 4)...
Topic: Recursion int puzzle (int start, int end) { if (start > end) return start -...
Topic: Recursion int puzzle (int start, int end) { if (start > end) return start - end; else if (start == end) return start + end; else return end * puzzle (start + 1, end - 1) } What is the output of the following statement? cout << puzzle (5, 10) << endl; The answer is 720. But how and why?
1. [2 points] Write a MIPS assembly language program of the following C function and the...
1. [2 points] Write a MIPS assembly language program of the following C function and the code to call the function: int leaf_example (int g, h, i, j) { int f; f = (g + h) - (i + j); return f; مهه Arguments g, h, i, and j are passed to the function in registers $a0, $al, Şa2, and $a3, respectively while f in $50 (hence, need to save $50 on stack), and the result is to be stored...
X266: Recursion Programming Exercise: log For function log, write the missing base case condition and the recursive call This function computes the log of n to the base b.As an example: log 8 to the base 2 equals 3 since 8 = 2*2*2. We can find this by dividing 8 by 2 until we reach 1, and we count the number of divisions we make. You should assume that n is exactly b to some integer power. Examples: log(2, 4)...
1. [2 points] Write a MIPS assembly language program of the following C function and the code to call the function: int leaf_example (int g, h, i, j) { int f; f = (g + h) - (i + j); return f; مهه Arguments g, h, i, and j are passed to the function in registers $a0, $al, Şa2, and $a3, respectively while f in $50 (hence, need to save $50 on stack), and the result is to be stored...
Most questions answered within 3 hours.
-
Given that many conflict are the result of different parties having
different interests, is it possible...
asked 47 seconds ago -
A 750 g block can slide uniformly along the horizontal track
when a string attached to...
asked 3 minutes ago -
In 2017, Juan entered into a contract to write a book. The
publisher advanced Juan $50,000,...
asked 17 minutes ago -
Determine the number of kinds of protons in each molecule (w/
respect to NMR spectroscopy). Drawing...
asked 27 minutes ago -
A jeweler whose near point is 68 cm from his eye uses a
magnifying glass as...
asked 25 minutes ago -
A company wants to determine how many units of each of two
products, A and B,...
asked 29 minutes ago -
The blood pressure of a person changes throughout the day.
Suppose the systolic blood pressure of...
asked 38 minutes ago -
A chemistry student desired to study sulfur. Sulfur exhibited
the following characteristics with oxygen:
(a) It...
asked 34 minutes ago -
An Atwood machine is constructed of a solid-disk frictionless
pulley of mass m3 and radius R....
asked 35 minutes ago -
what are the advantages of lanthanum hexaboride over tungsten
filament for electron emission
what is the...
asked 37 minutes ago -
Question 5
Your uncle offers to sell you his vintage Rolls Royce. He
suggests a payment...
asked 42 minutes ago -
Quality grading of beef products as Prime, Choice, Select. What
type of data?
A) ratio
B)...
asked 51 minutes ago