illCS 2340- Live Lectures-20221025 X2 of 2UTD Fall 2022 CS 2340 Assignme X +File C:/Users/rubai/OneDrive/UTD%20Fall%202022%20CS%202340%20Assignment%203.pdf53°FCloudy#include using namespace std;3-Translate the following program to MIPS assembly program (Please explaineach instruction in your code by a comment and submit a .asm file)// Get the size m and n#define M 4#define N 4// Function to calculate sum// of elements in 2d arrayint sum(int arr[M] [N]){int i, j;int sum = 0;// Finding the sumfor (i = 0; i < M; ++i) {for (j = 0; j < N; ++j) {// Add the elementsum sum + arr[i][j];}return sum;}// Driver codeint main(){int i, j;int arr[M] [N];// Get the matrix elementsint x = 1;for (i = 0; i < M; i++)for (j = 0; j < N; j++)arr[i][j] X++;// Get sumcout << sum(arr);return 0;(DQTH{"민50ENG1Во12:12 AM10/29/2022X:+

Given :- In the above given question, the statement is mention in the above given question Need…

Answered: S assembly program (F t and submit a…

Engineering

Computer Science

S assembly program (F t and submit a .asm file

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

Question Asked Jul 9, 2020 3 views Python Programming- Computer-Assisted Instruction Part 1: Computer-Assisted Instruction (CAI) refers to the use of computers in education. Write a script to help an elementary school student learn multiplication. Create a function that randomly generates and returns a tuple of two positive one-digit integers. Use that function's result in your script to prompt the user with a question, such as: How much is 6 times 7? For a correct answer, display the message "Very good!" and ask another multiplication question. For an incorrect answer, display the message "No. Please try again." and let the student try the same question repeatedly until the student finally gets it right. Then, modify the program so that various comments are displayed for each answer. Possible responses to a correct answer should include 'Very good!' , 'Nice work!' and 'Keep up the good work!' Possible responses to an incorrect answer shojld include 'No. Please try again.' ,…
It is due in C ++ Please if you can make I instruction for each file. A sample run is as follows: Enter the company name: TC Energy Enter TC Energy's stock symbol: TRP.TO Enter TC Energy's current stock price: 55 Enter TC Energy's annual dividend per share: 3.24 Enter the company name: Canadian Utilities Enter Canadian Utilities's stock symbol: CU.TO Enter Canadian Utilities's current stock price: 31.70 Enter Canadian Utilities's annual dividend per share: 1.76 Enter the company name: Bank of Nova Scotia Enter Bank of Nova Scotia's stock symbol: BNS.TO Enter Bank of Nova Scotia's current stock price: 70.08 Enter Bank of Nova Scotia's annual dividend per share: 3.60 Enter the company name: TransAlta Renewables Enter TransAlta Renewables's stock symbol: RNW.TO Enter TransAlta Renewables's current stock price: 21.75 Enter TransAlta Renewables's annual dividend per share: 0.94 Enter the company name: Toronto Dominion Bank Enter Toronto…
5.22 In Python: Write a program whose input is two integers and whose output is the two integers swapped. Ex: If the input is: 3 8 the output is: 8 3 Your program must define and call the following function. swap_values() returns the two values in swapped order.def swap_values(user_val1, user_val2)
A. The original Caesar cypher shifts each character by one: a becomes b, z becomes a, and so on. Let's make it a bit harder, and allow the shifted value to come from the range 1..25 inclusive. Moreover, let the code preserve the letters' case (lower-case letters will remain lower-case) and all non-alphabetical characters should remain untouched. Your task is to write a program which: asks the user for one line of text to encrypt; asks the user for a shift value (an integer number from the range 1..25 - note: you should force the user to enter a valid shift value (don't give up and don't let bad data fool you!) Test your code using the data we've provided. Test data Sample input: abcxyzABCxyz 123 2 Sample output: cdezabCDEzab 123 Sample input: The die is cast 25 Sample output: Sgd chd hr bzrs
suppose r0 = 0x20000000 and r1 = 0x01234567. what is the content of r0 and r1 after the following line of code is executed: LDRH r1, [r0], #4
The ceil(x) function is applicable to both int and double/floating point data type. (True or False) The sin(x) and cos(x) function need input arguments in degrees to give a correct output. (True or False) "When using pass by reference, the original value of a variable at the main loop remains unchanged." (True or False) Call by value operates using the principle of global variables. (True or False) The cos(x) function is available once cmath has been declared in the preprocessor. (True or False)
You are required to make changes in the below programs and introduce the use of compaction where required. #include<stdio.h> #include<conio.h> main() { int ms, bs, nob, ef,n, mp[10],tif=0; int i,p=0; clrscr(); printf("Enter the total memory available (in Bytes) -- "); scanf("%d",&ms); printf("Enter the block size (in Bytes) -- "); scanf("%d", &bs); nob=ms/bs; ef=ms - nob*bs; printf("\nEnter the number of processes -- "); scanf("%d",&n); for(i=0;i<n;i++) { printf("Enter memory required for process %d (in Bytes)-- ",i+1); scanf("%d",&mp[i]); } printf("\nNo. of Blocks available in memory -- %d",nob); printf("\n\nPROCESS\tMEMORY REQUIRED\t ALLOCATED\tINTERNAL FRAGMENTATION"); for(i=0;i<n && p<nob;i++) { printf("\n %d\t\t%d",i+1,mp[i]); if(mp[i] > bs) printf("\t\tNO\t\t---"); else { printf("\t\tYES\t%d",bs-mp[i]);tif = tif + bs-mp[i]; p++; } } if(i<n) printf("\nMemory is Full, Remaining Processes cannot be accomodated"); printf("\n\nTotal…
given ASCIIOFSET .FILL x0030 NegASCIIOFSET .FILL xFFD0 ASCIINewline .FILL x000d ; Newline ascii code ASCIISpace .FILL x0020 ; Space ascii code ASCIIComma .FILL x002C ; Comma ascii code Use LC-3 I/O device to print number, commas, and spaces in printCommaSpace subroutine, also check code to see if it follows instructions and modify accordingly
i have this code .ORIG x3000SetupLEA R0, InfoPUTS ADD R6, R6, #5; Init Main Loop counter (loop 5 times) ;Print first 2 Fib values before starting;----- Your Code Here -----;LD R1, #0 JSR printNum LD R2, #1 JSR printNumJSR printNum ; Print the value in R2 JSR printCommaSpace ; Print comma and space ;----- End Your Code Here -----;;Loop and call subroutines to calculate each subsequent value in the sequence;Exit the loop once all single-digit values in the sequence have been printedMainLoop ;----- Your Code Here -----; JSR calcNextFib JSR printNum JSR printCommaSpaceADD R6, R6, #-1BRz Done BR MainLoop ;----- End Your Code Here -----; Done HALT ;-----------------------------------;Subroutines;----------------------------------- ;Uses R1 and R2 to calc next value in Fibonacci sequence;When complete, Fib2 (R2) will contain the new Fib number;and Fib1 (R1) will contain the previous value of Fib2 (R2)calcNextFib;----- Your Code Here -----;ST R1, SaveR3 ; Save R1ST R2,…
This is the updated code that I have: .data .globl main .textmain: # compute the next state of the LFSR for each input state li $a0, 0x00000001 jal lfsr_next_state move $t0, $v0 li $a0, 0xdeadbeef jal lfsr_next_state move $t1, $v0 li $a0, 0x200214c8 jal lfsr_next_state move $t2, $v0 li $a0, 0x00000000 jal lfsr_next_state move $t3, $v0 # print the output states move $a0, $t0 li $v0, 1 syscall move $a0, $t1 li $v0, 1 syscall move $a0, $t2 li $v0, 1 syscall move $a0, $t3 li $v0, 1 syscall # exit the program li $v0, 10 syscall # Function to compute the next state of an LFSR# Input parameter: $a0 = current state# Output: $v0 = next statelfsr_next_state: # Initialize upper mask with 0x7fff and lower mask with 0x8000 lui $t0, 0x7fff ori $t0, $t0,…
Consider the following C++ code snippet: int cards[3]; for (int i = 0; i < 3; i++) cards[i] = 0; Choose the best statement: A) This code will compile and run but causes an out-of-range memory write. B) This code will compile and has no apparent issues. C) This code will not compile as written. D) This code shows an example of dynamic memory allocation.
Using Huffman code, we can compress the bits used for saving the characters in a file: Total bits used for saving the character in table 1 is 264 bits using standard ASCII 8 bits for 1 character. Using Huffman code encoding in Table 2, the total bits used is 126 bits. The problem: ➢ Input: list of characters such as table 1 ➢ Output: total bits using Huffman code encoding (table 2) ➢ Task: Design an algorithm in pseudocode/code to print the total bits using Huffman code encoding and write down the Algorithm analysis. The complexity of the algorithm must be in O(n) and proof it! ➢ PS: you don’t need to sort the input since the input is already sorted!