Translate the following C++ program into MAL (MIPS Assembly Langage). Your solution should have all necessary data allocations, input/output instructions etc, and must compile and run correctly in spim. Make sure your loops are efficient (i.e., they should not have unnecessary branches). Given: max is in $s0, num is in $s1, i is in $s2. (These variables should not be allocated in the .data section.) You may use any other $s? or $t? registers as temporaries. #include using std::cin; using std::cout; int main() { int max, num, i;

Translate the following C++ program into MAL (MIPS Assembly Langage). Your solution should have all necessary data allocations, input/output instructions etc, and must compile and run correctly in spim. Make sure your loops are efficient (i.e., they should not have unnecessary branches). Given: max is in $s0, num is in $s1, i is in $s2. (These variables should not be allocated in the .data section.) You may use any other $s? or $t? registers as temporaries. #include using std::cin; using std::cout; int main() { int max, num, i;

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

Write a C++ program that fills a 5 x 5 matrix of integers. The matrix must be a static matrix; its size must be fixed at compile-time. Display the contents of the matrix. Query the user for an integer. Pass the matrix and the integer to a bool function that searches for the first occurrence, and only the first occurrence, of the integer in thematrix. If the integer is found, the function returns true (and passes back the row and column coordinates of the first occurrence of the integer); if not, the function returns false.
Write a C++ program incorporating recursion to solve the following problem. The program should compile and execute under the UNIX gcc or g++ environments. (show this please) In this program it needs to accept a sequence of k characters from the user and use the characters to produce a k concentric squares. Also assume that there is an index origin of 1, the outermost square is made up of the letter a[k], the square inside that is made from the letter a[k-1], the square inside that is made from the letter a[k-2], and so on, with the innermost square made from the letter a[1]. For example, if k=5, and the values of a are ("R","O","C","K","Y") then the executed program should display: Y Y Y Y Y Y Y Y Y Y K K K K K K K Y Y K C C C C C K Y Y K C O O O C K Y Y K C O R O C K Y Y K C O O O C K Y Y K C C C C C K Y Y K K K K K K K Y Y Y Y Y Y Y Y Y Y To make this program simpiler to do if you implement it in C++ and write a class; instances of this class can be passed by value. If a class is…
Write a C++ program that fills a 5 x 5 matrix of integers. The matrix must be a static matrix; its size must be fixed at compile-time. Display the contents of the matrix. Query the user for an integer. Pass the matrix and the integer to a bool function that searches for the first occurrence, and only the first occurrence, of the integer in thematrix. If the integer is found, the function returns true (and passes back the row and column coordinates of the first occurrence of the integer); if not, the function returns false. Main then displays whether the integer was found in the matrix and if so, the coordinates of the first occurrence. The use of a break to exit a loop or a function should be avoided. My code does not find the location of the first occurrence and does not use a bool function. Can you please help me to find the error. This is my code: #include <iostream> #include <random> using namespace std; int main() { int guess, array[5][5]; bool found = false; for(int…
Please Answer this in C++ only Devo is learning Combinatorics in his college. He finds it very interesting to calculate number of ways of going to point (c, d) from point (a, b) in co-ordinate plane. We can take horizontal and vertical steps only and cannot visit at a point twice. In a step, you can move one unit only. We have to reach to the point (c, d) from the point (a, b) using abs(a-c) + abs(b-d) steps only. Devo has two sets of points. Set A contains points having X co-ordinate 0 and Y co- ordinates varying from 1 to N (both inclusive). Set B contains points having X co- ordinate K and Y co-ordinates varying from 1 to N (both inclusive). Both sets contain N number of integral points. He wants to calculate the sum of number of ways to going to each point of set B from each point of set A. As the answer can be large, print it modulo 1000000007. Input 2 22 45 Output 8 236
This code is written in c++, I want this code to be convert in matlab. #include #include #include #include /* Defining equation to be solved. Change this equation to solve another problem. */ #define f(x) 3*x - cos(x) -1 /* Defining derivative of g(x). As you change f(x), change this function also. */ #define g(x) 3 + sin(x) using namespace std; int main() { float x0, x1, f0, f1, g0, e; int step = 1, N; /* Setting precision and writing floating point values in fixed-point notation. */ cout<< setprecision(6)<< fixed; /* Inputs */ cout<<"Enter initial guess: "; cin>>x0; cout<<"Enter tolerable error: "; cin>>e; cout<<"Enter maximum iteration: "; cin>>N; /* Implementing Newton Raphson Method */ cout<< endl<<"*******"<< endl; cout<<"Newton Raphson Method"<< endl; cout<<"Redlich-knowng Method"<< endl; cout<<"Peng-Robinson Equestion"<< endl; cout<<"*******"<< endl; do { g0 =…
I Need this in C++ NOT Java Complete this C++ program to conduct experimental analysis for project P-4.60 and P-4.61 from the book . You are already provided with these algorithms in the c++ file P-4.60: Perform an experimental analysis of the two algorithms prefixAvrage1 (p1) and prefixAverage2(p2), from Section 4.3.3. Visualize their running times as a function of the input size with a log-log chart. P-4.61: Perform an experimental analysis that compares the relative running times of the methods(example1 (e1) through example5(e5)) shown in Code Fragment 4.12. Visualize their running times as a function of the input size with a log-log chart. Implementation Detail:Inputs and outputs Your program will take 3 arguments. The first argument will specify the algorithm (function) to be tested. Possible values include p1, p2, e1, e2, e3, e4, e5. Each corresponding to an algorithm to be tested. For example, p1 means function prefixAverage1, e1 means function example1 The second argument…
Answer in C++, show example output please There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initiallyempty. Using these three buckets, we can perform any number of the following twotypes of operations. We can fill the smallest bucket (of size X) completely to the top with X units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. We can fill the medium bucket (of size Y) completely to the top with Y units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. Although we may not be able to completely fill the size-M bucket, but we can stilldetermine the maximum amount of milk we can possibly add to largest bucket. Sample input:17 25 77 Sample output:76 In this example, we fill the bucket of size 17 three times and then bucket of size 25once, accumulating a total of 76 units of water. You could use additional test case to test your program:Input: 52 791…
Write a c++ program that determines whether or not a string of alphanumeric characters is a palindrome. Ignore any whitespace characters or punctuation when processing the string. You will be required to demonstrate pointer math and dereferencing. You will be required to separate your interface from your implementation; you must have a header file (.h) for your interface, and a source file (.cpp) for your implementation. Be sure to perform data validation on your input to prevent buffer overflows. Your code should present the user with prompts similar to the following: (image included) Here are some example palindromes you can test with: Mr. Owl ate my metal wormDo geese see God?Was it a car or a cat I saw?Murder for a jar of red rumA nut for a jar of tunaGo hang a salami, I'm a lasagna hog!
considering the prototype float minMax (float* array, int size, float* min, float* max); - in c code, how would you write the code for the function? would i include both for loops to find the min and max? i.e. all of below would go in the one function? that doesn't seem right? i'm not sure how to tweek it accordingly? float minimum(float array[], int size){int i;float min = array[0]; // min initialized to first elementfor(i=1;i<size;i++){ if(array[i] < min) //element is compared with min min = array[i];}return min;} float maximum(float array[], int size){int i;float max = array[0]; // max initialized to first elementfor(i=1;i<size;i++){ if(array[i] > max) //element is compared with max max = array[i];}return max; -- what if i needed to add a third value to this like address? would it then be a void function? how would that work? void arrayMinMaxAvg (float* array, int size, float* min, float* max, float* avg) - for example, is this even possible?
Answer In c++ only. Rohit is working in the Multinational company named Accenture. He has empty boxes lying on the floor in a row. The size of the boxes is provided in the form of identical members a. The size of the ith box is indicated by [i]. Since Rohit has a small room, there is a shortage of space. Therefore, he should reduce the number of lower boxes by inserting the box into another box at least twice the current box i.e. if we have to insert that box into the jth box then (2 * a [i]) <= a [j]. Each box can contain one box and a box stored in another box cannot hold any box itself. Find the minimum number of boxes left behind after placing boxes in each other. Sample Input: 16 1 4 2 Sample Output: 3
Answer In c++ only. Rohit is working in the Multinational company named Accenture. He has empty boxes lying on the floor in a row. The size of the boxes is provided in the form of identical members a. The size of the ith box is indicated by [i]. Since Rohit has a small room, there is a shortage of space. Therefore, he should reduce the number of lower boxes by inserting the box into another box at least twice the current box i.e. if we have to insert that box into the jth box then (2 * a [i]) <= a [i]. Each box can contain one box and a box stored in another box cannot hold any box itself. Find the minimum number of boxes left behind after placing boxes in each other. Sample Input: 16 1 4 2 Sample Output: 3
Need help with this c++ problem Use recursion to implement a function: find(s, t) that tests whether the string t iscontained in the string s. For instance, calling the function like this: find("Mississippi", "sip") returns true. You must use recursion to complete this, not loops; you obviously may not use thestring find() member function either. Here's the basic strategy:• If the text starts with the string you want to match, then you are done.• If the string s is smaller than the string t, you are also done.• If not, check the sentence without the first character.