HW2: Write a program to add five bytes started at offset 200H to another five bytesstarted at 300H, store the results at offset started at 400H.Note:[ 200] + [300] results stored at [400][201] + [301] results stored at [401][ 204] + [304] results stored at [404]

Answered: HW2: Write a program to add five bytes…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

C++ Use the PEP/8 Assembler to write a program to compute the 5th element of the Fibonacci sequence 1 2 3 5 8 13 21 34 55, etc. Use an .Equate to set the term number you want to find. fibNum: .EQUATE 5 ; We want this term in the Fib sequence
In MIPS assembly, how do I iteratively read a file that contains only 2 numbers on each line, and calculate the distance between the two numbers on each line. Ex: file contains 1 5 4 7 function returns $v0=2 $a2 contains the array address [4, 3, default, default, default] also the file won't be greater than 300 mb and is never empty
ill CS 2340- Live Lectures-20221025 X 2 of 2 UTD Fall 2022 CS 2340 Assignme X + File C:/Users/rubai/OneDrive/UTD%20Fall%202022%20CS%202340%20Assignment%203.pdf 53°F Cloudy #include using namespace std; 3-Translate the following program to MIPS assembly program (Please explain each 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 array int sum(int arr[M] [N]) { int i, j; int sum = 0; // Finding the sum for (i = 0; i < M; ++i) { for (j = 0; j < N; ++j) { // Add the element sum sum + arr[i][j]; } return sum; } // Driver code int main() { int i, j; int arr[M] [N]; // Get the matrix elements int x = 1; for (i = 0; i < M; i++) for (j = 0; j < N; j++) arr[i][j] X++; // Get sum cout << sum(arr); return 0; (D Q T H {" 민 50 ENG 1 Во 12:12 AM 10/29/2022 X : +
Write a C++ program that requests any number of input integers from user, sorts and displays the input integers in ascending order using bubble sort algorithm. Provide a written explanation and output screenshots of your code. REMINDER: Use dynamic memory allocation in C++. Do not put all your codes inside main() function. Your sorting algorithm codes must be placed inside a user-defined function.
ill UTD Fall 2022 CS 2340 Assignme X + 1 of 2 45°F Clear File C:/Users/rubai/OneDrive/UTD%20Fall%202022%20CS%202340%20Assignment%203.pdf #include int main() { |} 1-Translate the following program to MIPS assembly program (Please explain each instruction in your code by a comment and submit a .asm file) //Initialize array int arr[] int temp = 0; //Calculate length of array arr int length = sizeof(arr)/sizeof(arr[0]); {5, 2, 8, 7, 1}; //Displaying elements of original array printf("Elements of original array: \n"); for (int i = 0; i length; i++) { printf("%d ", arr[i]); } //Sort the array in ascending order for (int i = 0; i arr[j]) { temp = arr[i]; arr[i] arr[j] = temp; } } return 0; arr[j]; printf("\n"); //Displaying elements of array after sorting printf("Elements of array sorted in ascending order: \n"); for (int i 0; i < length; i++) { printf("%d ", arr[i]); (D Q Ø H P J ENG re 60 I Bo 60 N x : 6:57 AM 10/26/2022
PLEASE MODIFY THE BELOW CODE BY USING INTERRUPTS. #include <iostream>#include <cstdlib>#include <time.h>#include <chrono>#include <pthread.h> using namespace std::chrono;using namespace std;#define NUM_THREADS 40 struct AddTask{int *v1,*v2,*v3;int start;int end;}; void randomVector(int vector[], int size){for (int i = 0; i < size; i++){ vector[i] = rand() % 100;}} void *AddVector(void* arg){ AddTask *task = (struct AddTask *) arg; for(int i = task->start; i< task->end ; i++){task->v3[i] = task->v2[i] + task->v1[i];}} int main(void){ pthread_t threads[NUM_THREADS]; unsigned long size = 100000000; srand(time(0)); int *v1, *v2, *v3; auto start = high_resolution_clock::now(); v1 = (int *) malloc(size * sizeof(int *));v2 = (int *) malloc(size * sizeof(int *));v3 = (int *) malloc(size * sizeof(int *)); randomVector(v1, size); randomVector(v2, size); for (size_t i = 0; i < NUM_THREADS; i++) {struct AddTask *task = (struct…
2. Tell the exact content of the variables memory location in binary upon execution of the code, use sizeof(int)=2 and the ASCII value of ’A’= decimal 65= hexa 41, ’a’= decimal 97 = hexa 61 : int x, y; char z[4] = ”CaB” ; x = 63; y = -63;
Suppose that x and y have byte values 0x69 (01101001) and Ox55 (01010101), respectively. Fill in the following table indicating the byte values of different C expressions in hex format (Hint: Result of C language logical and binary operations) c)-xl-y Value Ox d) x & ly Value Ox c) x 1 ly Value Ox d) x && -y Value Ox
Homework: 1. Write a program that performs the addition of two byte sized numbers that are initially stored in memory locations 'numl' and 'num2'. The addition result should be stored in another memory location 'total'. Verify the result using emu8086. [Hint: Use DB directive to initially store the two byte sized numbers in memory locations called 'numl' and 'num2". Also reserve a location for the addition result and call it 'total'] 2. Write a program that multiplies two unsigned byte sized numbers that are initially stored in memory locations 'numl'and 'num2'. Store the multiplication result in another memory location called 'multiply". Notice that the size of memory location 'multiply' must be of word size to be able to store the result. Verify the result using emu8086. 3. Write a program that calculates the factorial of number 5 and stores the result in a memory location. Verify the program using emu8086 emulator. [Hint: Since 5! - 5x4x3x2x1, use MUL instruction to find the…
PROGRAMMING EXERCISES: 4. How many double entries can aValues[MAX_A] store? 5. What is the value of aValues[2]? [Hint: the value is an address] 6. How many bytes are allocated to sentence?
1 READING CODE - STACK 47 list the output of the following program assuming the input is as follows: 3 101 mov al, 0; Return code of 0 mov ah, 4ch: Exit back to MSDOS 48 49 4 232 50 int 21h Main ENDP 5 48 51 17 52 7 53 Data ; re-enter the data segment for this procedure include PCMAC.INC 54 NEWLINE EQU_PutCh 13, 10 MessageSub Mystery 55 DB 'Enter a number $' 10 56 DW ? 11 MODEL SMALL 57 12 STACK 100h DATA CODE ; return to coding 58 13 59 Messagel DB 'Total sold today, S' Message2 DB , is: $' Sublnput PROC mov cx, 4 14 60 15 61 16 62 myLoop: 17 63 CODE EXTERN GetDec: NEAR, PutDec NEAR PutStr MessageSub call GetDec add Mystery, ax 18 64 19 65 20 Main PROC 66 dec cx inz myLoop mov ax, Mystery 21 mov ax, @data ds, ax GetDate push cx push dx push dx call Sublnput send control to subprocedure mov bx, ax PutStr Messagel 67 22 mov 68 23 69 ret 24 70 25 71 Sublnput ENDP 26 72 73 END Main; Tells where to start execution 28 74 75 рop dx mov al, dh mov ah, 0 call PutDec PutCh " pop dx mov al, dl…

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS

HW2: Write a program to add five bytes started at offset 200H to another five bytes started at 300H, store the results at offset started at 400H. Note: [200] + [300] results stored at [400] [ 201] + [301] results stored at [401] [ 204] + [304] results stored at [404]