2.Write a recursive assembly subroutine that will calculate the value of the procedureproc1(n) where n is a signed integer input argument, andproc1(n) =In?sproc1(n + 1) + proc1(n + 2), if n < 11,if n> 11You must simulate your program in Kiel and attach a screenshot (of your entire desktop), clearlyshowing your code, and the register values after being ran, tested with the initial value of n= -2.

Given proc1(n) = {proc1(n+1)+proc1(n+2),if n≥ 11 n3…

2. Write a recursive assembly subroutine that will calculate the value of the procedure proc1(n) where n is a signed integer input argument, and sproc1(n+ 1) + proc1(n + 2), if n < 11 ,if n> 11 proc1(n) You must simulate your program in Kiel and attach a screenshot (of your entire desktop), clearly showing your code, and the register values after being ran, tested with the initial value of n= -2.

2. Write a recursive assembly subroutine that will calculate the value of the procedure proc1(n) where n is a signed integer input argument, and sproc1(n+ 1) + proc1(n + 2), if n < 11 ,if n> 11 proc1(n) You must simulate your program in Kiel and attach a screenshot (of your entire desktop), clearly showing your code, and the register values after being ran, tested with the initial value of n= -2.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Implement a subprogram which takes 4 numbers in the argument registers $a0...$a3, andreturns the largest value and the average in $v0 and $v1 to the calling program. Theprogram must be structured as follows:Subprogram largestAndAverage($a1, $a2, $a3, $a4){ int var0 = $a0, var1 = $a1, var2 = $a2, var3 = $a3; $s0 = getLarger($a1, $a2); $s0 = getLarger($s0, $a3); $v0 = getLarager(s0, $a4); // Largest is in $v0 $v1 = (var0 + var1 + var2 + var3)/ 4; // Aversge is in $v1 return;}Subprogram getLarger($a0, $a1) { $v0 = $a0 if ($a1 > $a0) $v0 = $a1 return;}Take note of how var0...var3 are used. The values of $a0 and $a1 (at least) must be placed on the stack because they are not immediately available when needed to calculate the average because they are modified during the call to getLarger. You must use the getLarger subprogram displayed above to calculate the greatest value for this problem, and it must be called before the average calculation. This indicates that at the very least $a0…
Write a C++ program where the user inputs two positive integers, A and B, where 5≤ A ≤10 and 20≤ B ≤30. (use user defined functions) A function to output AB (where A is multiplied by itself B times) do not use the built in “pow” function, use your own function. A function that returns the area of a rectangle of height A and width B. A function that returns the sum of odd numbers between A and B. A function to calculate AB recursively. Knowing that AB = AB-1 * A with base case A0 =1
Write a C program that creates a security access code from a social security number entered by a user as follows: Using a recursive function it adds all of the digits of the social security number and then using a regular function gets the square number of the sum and displays it. The access code displayed should be initialized as an integer number but using type casting is displayed as a floating number.
(This question is from data structures and algorithms in C++) Show the result of the following sequence of instructions: union(1,2), union(3,4), union(3,5), union(1,7), union(3,6), union(8,9), union(1,8), union(3,10), union (3,11), union(3,12), union(3,13), union(14,15), union(16,0), union(14,16), union (1,3), union(1, 14) When the unions are: a. performed arbitrarily, b. performed by height, c. performed by size Then, for each of the trees perform a find with path compression on the deepest node Please draw neatly, thank you!
Write a program in C++ to asked user to input positive integers toprocess count, maximum, minimum, and average or terminate theprocess with -1.
2. A program P calls two subprograms P1 and P2. P1 can fail 50% times and P2 40% times. Then P can fail a. 50% b. 60% c. 10% d. 70%
Knowing that (x + 1)2 = x2 + 2x + 1,and that multiplication is more time consuming than addition, write an efficientprogram that displays the first ten natural numbers and their squares. Knowingthat (x + 1)3 = x3 + 3x2 + 3x + 1, the same process can be followed to displaythe cubes of these numbers.Here is a sample run: 0^2 = 01^2 = 12^2 = 4...8^2 = 649^2 = 8110^2 = 100
I need to write a java program to draw one of four recursively defined patterns.The patterns are in the attached picture. In each pattern a smaller square is drawn at each of the four corners of the next larger square. This pattern repeats again and again. It might repeat any number of times or levels. In the picture, the pattern is repeated four times or levels. If another level were asked for, then 192 very small squares would have to be drawn. The patterns differ in which squares are drawn on top of the others and thus may be hidden from view. The largest square, the one at level one, is drawn in the center of a square canvas and the length of its side is one half the length of the side of the canvas. The center of the next smaller square is always at the corner of the larger square. And the size of the next smaller square is determined by a fixed ratio R. If the smaller square has a side of length s and the next larger square has a side of length b, then R is the ratio b/s. In…
Write a c program of the recursive function that computes and returns X^y. In main ask the user to enter X and Y. Function main() will also display the result on screen
Convert the following C++ programs into Pep/9 assembly #include <iostrea> using namespace std; int minimum (int i1, int i2){ if (i1 < i2) cout << i1 << " is less than " << i2 << endl; else if (i2 < i1) cout << i2 << " is less than " << i1 << endl; else cout << i1 << " equals " << i2 << endl;}int main (){int n, m;cin >> n >> m;cout << "Minimum: " << minimum (n, m) << endl;return 0;} Submit: Pep/9 source code along with screen capture showing it running in the Pep simulator
Write a Pep/9 assembly language program that reads an integer value from the keyboard, and displays a table that shows the quotient when the input value is divided by successive powers of 2, between 2 and 32. In other words, your program should produce exactly the same output as the following C program: #include <stdio.h> int inpVal; int divis; int quotient; int main() { printf("? "); scanf("%d", &inpVal); divis = 2; quotient = inpVal / divis; printf("%d / %d = %d\n", inpVal, divis, quotient); divis *= 2; quotient /= 2; printf("%d / %d = %d\n", inpVal, divis, quotient); divis *= 2; quotient /= 2; printf("%d / %d = %d\n", inpVal, divis, quotient); divis *= 2; quotient /= 2; printf("%d / %d = %d\n", inpVal, divis, quotient); divis *= 2; quotient /= 2; printf("%d / %d = %d\n", inpVal, divis, quotient); } // end of main Example of Input and Output format requirements: For this example, assume that the keyboard input given to the program is: 8209 For this input data, the output…
Write a program in C++ language to illustrates how a pointer variable works. Follow the instruction below; - Create main function and include your information details - Declare the pointer variable of p as an integer - Declare an integer variable of num1 and num2, and set the value of num1 = 5 and num2 = 8 - Store the address of num1 into p - Print the address of &num1 and value of p - Print the value of num1 and *p - Change the value of *p to 10 - Print the value of num1 and *p - Store the address of num2 into p - Print the address of &num2 and value of p - Print the value of num2 and *p - Multiply the value of *p by 2 - Print the value of num2 and *p