Consider the following code written in a high level language.a[10] = (1,2,3,4,5,6,7,8,9,10)b(10] = (100,90,80,70,60, 50, 40,30,20,10)c(101 = (5,6,7,8,9, 10, 11, 12, 13, 14)d[101 = (20, 21,22,23,24,25,26,27,28, 29)sum = 0;for (i = 10; i > 0: i--) (sum + (a[i)/blil)*(c[i]/30) /d[i]:(You don't need to translate thedata segment, only translating the code segment should be enough.)All the variables in the code above have WORD datatype. For multiplication anddivision you must need to use single operand MUL, DIV instructions. You canassume that the computations are UNSIGNED. You can use temporary variables tostore the intermediate results of the expression.You are not allowed to make any logical reduction in the code. You are NOT allowedto use directives - (.REPEAT, .UNTIL, WHILE, etc).

Name: Consider the following code written in a high level language.a[10] =
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Consider the following code written in a high level language.a[10] = (1,2,3,4,5,6,7,8,9,10)b(10] = (100,90,80,70,60, 50, 40,30,20,10)c(101 = (5,6,7,8,9, 10, 11, 12, 13, 14)d[101 = (20, 21,22,23,24,25,26,27,28, 29)sum = 0;for (i = 10; i > 0: i--) (su

Engineering

Computer Science

Consider the following code written in a high level language. a[101 = (1,2,3,4,5,6,7,8,9,10) b[(10] = (100,90,80,70,60, 50, 40,30,20,10) c(101 = (5,6,7,8,9, 10, 11, 12, 13, 14) d[101 = (20, 21,22,23,24,25,26,27,28, 29) sum 0; for ( i = 10 ;i > 0; i--) ( sum + (a[i] / b[i]) (c[i]/30) / d[i]: (You don't need to transl data segment, only translating the code segment should be enough.)

Consider the following code written in a high level language. a[101 = (1,2,3,4,5,6,7,8,9,10) b[(10] = (100,90,80,70,60, 50, 40,30,20,10) c(101 = (5,6,7,8,9, 10, 11, 12, 13, 14) d[101 = (20, 21,22,23,24,25,26,27,28, 29) sum 0; for ( i = 10 ;i > 0; i--) ( sum + (a[i] / b[i]) (c[i]/30) / d[i]: (You don't need to transl data segment, only translating the code segment should be enough.)

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

*Data Structures (a) The function g(n) is a/an [?] bound on f(n). A. upper B. tight C. lower (b) The function f(n) is a/an [?] bound on g(n). A. upper B. tight C. lower (c) The function g(n) is a/an [?] bound on h(n). A. upper B. tight C. lower (d) The function j(n) is a/an [?] bound on g(n). A. upper B. tight C. lower (e) The function h(n) is a/an [?] bound on k(n). A. upper B. tight C. lower (f) The function k(n) is a/an [?] bound on f(n). A. upper B. tight C. lower
int i; float x[5], y[5]; [ lots of code deleted... ] for (i=0;i y[i]) x[i] = x[i] + y[i]; [ more code deleted... ] Translate to MIPS assembly language:
4. Suppose we want to create a stack of names that vary in length. Why is it advantageous to store the names in separate areas of memory and then build the stack out of pointers to these names rather than allowing the stack to contain the names themselves?
NAND2TETRIS HARDWARE SIMULATOR HiLoMux - This has one 8-bit input bus, in, and one 4-bit output bus, out. Alsopresent is a sel input, which is used to select what appears on out. Ifsel is false, then out should contain the lower 4-bits of in (i.e. in[0],in[1], in[2], in[3]). If sel is true, then out should contain theupper 4-bits of in (i.e. in[4] mapped to out[0], in[5], mapped toout[1], etc.). In other words, the HiLoMux can be used to select anibble from a byte please use the skeleton program below CHIP HiLoMux{ IN in[8], sel; OUT out[4]; PARTS: }
Problem D. Find URLsHTML is a language for representing documents designed to be displayed by a web browser. In many browsers, you can see the HTML source code by right-clicking somewhere on the page and clicking “View Page Source”. If you try this on a web page with links to other websites, you’ll notice that the URL of the link is usually formatted in the following way: href="https://some.website.com/subfolder/more_stuff.txt" Write a function find_url(html) that takes in a string of html text that contains exactly one external link URL formatted as above, and returns just the URL string (in the above example, that would be https://some.website.com/subfolder/more_stuff.txt). You can assume that the only place in the string where the substring href=" occurs is right before the URL, and that the next quotation mark after that point denotes the end of the URL. Hints: ● The .find method and string slicing will likely make this easier. ● Remember that in order to use a double quote…
Translate C program to Pep/9 assembly language. /C code for 6.19a#include <stdio.h>char myChar;char toLower(char ch) { if ((ch >= ’A’) && (ch <= ’Z’)) { return ch + ’a’ - ’A’; } else { return ch; }}int main () { scanf(”%c”, &myChar); printf(”%c\n”, toLower(myChar)); return 0;}
PYTHON/JUPYTER NOTEBOOKS given the attached fourier data : # Measurements of fourier data data = [ [-2.00, -9.37], [-1.00, 10.00], [-1.14, 10.83], [-0.29, -13.88], [0.00, -18.00], [0.57, -1.83], [1.00, 14.00], [1.43, 14.5], [2.00, 0.00], [2.29, -1.38], [3.00, 28.00], [3.14, 35.64], [4.00, 37.88], [5.00, -23.00], [4.86, -17.52], [5.71, -14.63], [6.00, -1.00], [6.50, -15.00], [6.57, -1.73], [7.00, 12.00], [7.43, 5.97], [7.50, 2.00], [8.29, 22.78], [9.00, 1.00], [9.14, -6.41], [10.0, -9.37] Fit the data with the linear least-squares fit method using Fourier basis functions. Use 15 pairs of sines and cosines and create the plots/results below. x_vec = [ 1.591 -0.42 5.684 -5.112 -2.257 0.36 4.546 -7.626 0.341 -4.391 1.092 1.878 4.286 7.783 -3.427 -4.608 1.763 -0.957 -1.751 3.441 2.857 -2.624 2.96 0.911 -2.538 2.782 -1.943 -8.819 1.635 2.123 2.123] Local Relative Error (discarding y values < 0.1): mean [%] = 17.08 std [%] = 89.43…
L[3.1] + [-2.6] + 1.9] O 2 3
s. Convert the following C code to assembly language using vector operations. (Just do your best, make necessary assumptions, don't worry about syntax too much.) for (i-0;i <300; i++) { c_re[i] = a_re[i] b_re[i]-a_im[i] * b_im[i]: c_im[i] - a_re[i] b_im[i]+a_im[i] * b_re[i];
Example: The Problem Input File Using C programming language write a program that simulates a variant of the Tiny Machine Architecture. In this implementation memory (RAM) is split into Instruction Memory (IM) and Data Memory (DM). Your code must implement the basic instruction set architecture (ISA) of the Tiny Machine Architecture: //IN 5 //OUT 7 //STORE O //IN 5 //OUT 7 //STORE 1 //LOAD O //SUB 1 55 67 30 55 67 1 LOAD 2- ADD 3> STORE 4> SUB 5> IN 6> OUT 7> END 8> JMP 9> SKIPZ 31 10 41 30 //STORE O 67 //OUT 7 11 /LOAD 1 //OUT 7 //END 67 70 Output Specifications Each piece of the architecture must be accurately represented in your code (Instruction Register, Program Counter, Memory Address Registers, Instruction Memory, Data Memory, Memory Data Registers, and Accumulator). Data Memory will be represented by an integer array. Your Program Counter will begin pointing to the first instruction of the program. Your simulator should provide output according to the input file. Along with…
In a programming language (Pascal), the declaration of a node in a singly linked list is shown in Figure P6.7(a). The list referred to for the problem is shown in Figure P6.7(b). Given P to be a pointer to a node, the instructions DATA(P) and LINK(P) referring to the DATA and LINK fields, respectively, of node P are equivalently represented by P↑. DATA and P↑. LINK in the programming language. What do the following commands do to the logical representation of the list T? i) ii) TYPE POINTER=NODE; NODE RECORD DATA: integer; LINK: POINTER END; VAR P, Q R: T POINTER (a) Declaration of a node in a singly linked list T 31 TE 57 12 (b) A singly linked list T iii) R₁.LINK: = Q iv) R₁.DATA: = P₁.DATA: Q₁.DATA + R₁.DATA Q: = P |R Figure P6.7. (a and b) Declaration of a node in a programming language and the logical representation of a singly linked list T Q.LINK.DATA + 10 91 Linked Lists 189
Implement the function (in C or C++) with the following prototype: /** Implement a function which rotates a word left by n-bits, and returns that rotated value. Assume 0 <= n < w Examples: when x = 0x12345678 and w = 32: n=4 -> 0x23456781 n=20 -> 0x67812345 */ unsigned rotate_left(unsigned x, int n); The function should follow the bit-level integer coding rules above. Be careful of the case n = 0.