Convert the following into Pep/9 Assembler: #include using namespace std; int square(int n){ int i; int sq; sq = 0; for (i = 0; i < n; i++){ sq = sq + n; } return sq; } int main (){ int num; cout << "Enter a number: "; cin >> num; cout << num << " squared = " << square(num) << endl; return 0; }

Convert the following into Pep/9 Assembler: #include using namespace std; int square(int n){ int i; int sq; sq = 0; for (i = 0; i < n; i++){ sq = sq + n; } return sq; } int main (){ int num; cout << "Enter a number: "; cin >> num; cout << num << " squared = " << square(num) << endl; return 0; }

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 18RQ

See similar textbooks

Similar questions

Convert the following C++ programs into Pep/9 assembly #include <iostrea> using namespace std; int minimum (int i1, int i2){if (i1 < i2)return i1;elsereturn i2;}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
Implementation of the solution in the C++ or Java language • Implementation of the solution in ARMv8 assembly, with comments explaining the purpose of each line Task 1 An automorphic number is a number n whose square ends in n. For instance, 5 is automorphic, because 52 = 25, which ends in 5. Design and implement an ARMv8 program that reads a positive integer from the user and then calculates and prints all the automorphic numbers (decimal base) that are less than or equal to the entered integer. If the entered integer is not positive, an error message is displayed. As an example, if 100 is entered, the program will print all the automorphic numbers up to 100: 1, 5, 6, 25, 76.
Implement in C programming language Question 1 Write a program in c to detect if the system will face any deadlock in the future. If a deadlock is detected then print “Deadlock Ahead” otherwise print “Safe here”. The situation is given below. (Allowed to use Banker’s Algorithm). Note: The code can be implemented in several different ways, but make sure the parameter remains the same as shown below. n = 5; // Number of processes m = 4; // Number of resources int alloc[5][4] = { { 0, 1, 0, 3 }, // P0 // Allocation Matrix { 2, 0, 0, 0 }, // P1 { 3, 0, 2, 0 }, // P2 { 2, 1, 1, 5 }, // P3 { 0, 0, 2, 2 } }; // P4 int max[5][4] = { { 6, 4, 3, 4 }, // P0 // MAX Matrix { 3, 2, 2, 1 }, // P1 { 9, 1, 2, 6 }, // P2 { 2, 2, 2, 8 }, // P3 { 4, 3, 3, 7 } }; // P4 int avail[4] = { 3,…
Convert the following C++ programs into Pep/9 assembly #include <iostream> using namespace std; int minimum (int i1, int i2){ if (i1 < i2) return i1; else return i2;}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
Convert the following C++ programs into Pep/9 assembly #include <iostream> using namespace std; int minimum (int i1, int i2){if (i1 < i2)return i1;elsereturn i2;}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
A Python Programming in Medicine. A techy doctor from the Great Kanagawa Prefecture has become famous for his new offering of medical service, a personalized treatment of his patients that utilizes bioinformatics. By taking some samples of DNA from his patients, he uses state-of-the-art equipment to let computer collect and extract important information that can be found in the DNA sequence. Applying computational analysis on the data extracted would enable the doctor to determine more accurately his patients’ real health problems. In this scenario, you will serve as an intern in his laboratory who will be assigned an important task. You will be given a long DNA sequence, which is represented in a string of letters. Your task is to convert 3-letter codons into protein residues. The output would be the corresponding residues. INPUT: DNA sequence OUTPUT: Generated 3-letter codons and corresponding protein residues An input sample of DNA sequence would look like this:…
C LANGUAGE ONLY. ANSWER ASAP Topic: pointers and dynamic memory allocation Make another version of the code below without copying it or using the same structure Thanks!
translate the c++ code into pep/9 assembly language #include <iosream> using namespace std; void minimum (int i1, int i2){ if (i1 < i2) cout << i1 << " is less than " << i2 << endl; else if (i1 > i2) cout << i2 << " is less than " << i1 << endl; else cout << i1 << " equals " << i2 << endl;}int main (){ int n, m; cout << "Enter two integers: "; cin >> n >> m; minimum (n, m); return 0;}
Implement Round Robin scheduling algorithm in C programming. NOTE: Please do not compute and print the average waiting time and the average turnaround time. You are required to compute these for each process and print these times for each process separately. Add comments in the code so that the code is understandable. Take input from the user: the number of processes, the time quantum and their CPU burst times for n number of processes. Compute and print the completion Time(CT), Turnaround Time(TAT), and Waiting Time(WT) for each process using C Programming. Assuming all the processes have arrived at time 0, please do not take arrival times as input from the user.
1) 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;}Note the use of the variables var0...var3. Because the values of $a0 and $a1 (at least) arechanged on the call to getLarger, they will not be available when they are needed to calculatethe average, and must be stored on the stack. To do this problem correctly, you mustcalculate the maximum value using the getLarger subprogram shown here, and it must becalled before the average is calculated. This implies that at a minimum $a0 and $a1…
This is what I have so far I need help with the commenting on the assembly code I have included my C code that this assembly was generated from so it can be of help please do not just give me back my already commented C code that does not help me My assembly code largest(int*, int): push rbp mov rbp, rsp mov QWORD PTR [rbp-24], rdi mov DWORD PTR [rbp-28], esi mov rax, QWORD PTR [rbp-24] mov eax, DWORD PTR [rax] mov DWORD PTR [rbp-4], eax mov DWORD PTR [rbp-8], 1 jmp .L2 .L4: mov eax, DWORD PTR [rbp-8] cdqe lea rdx, [0+rax*4] mov rax, QWORD PTR [rbp-24] add rax, rdx mov eax, DWORD PTR [rax] cmp DWORD PTR [rbp-4], eax jge .L3 mov eax, DWORD PTR [rbp-8] cdqe lea rdx, [0+rax*4] mov rax, QWORD PTR [rbp-24] add rax, rdx mov…
(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!