Q2/ Write a program to add the following five data bytes stored in data segment offset starting from [0500H], if the sum generates a carry , stop the adding ,and store (01) in data segment offset [0600H], otherwise, continue adding and store the sum in data segment offset [0600H],

Q2/ Write a program to add the following five data bytes stored in data segment offset starting from [0500H], if the sum generates a carry , stop the adding ,and store (01) in data segment offset [0600H], otherwise, continue adding and store the sum in data segment offset [0600H],

Name: Q2/ Write a program to add the following five data bytes stored in da
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Q2/ Write a program to add the following five data bytes stored in data segmentoffset starting from [0500H], if the sum generates a carry , stop the adding ,andstore (01) in data segment offset [0600H], otherwise, continue adding and store thesum in

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 41VE

See similar textbooks

Similar questions

In the following code, the first printf() reached produces the output “14,” but the second printf() can cause a bus error or a segmentation fault. Why? main(){ int *p;funct(p);printf("%d\n",*p);}funct(int *p2){p2=(int *)malloc(4);*p2=14;printf("%d\n",*p2);}
Suppose we number the bytes in a w-bit word from 0 (least significant) to w/8 – 1 (most significant). Write code for the following C function, which will return an unsigned value in which byte i of argument x has been replaced by byte b: unsigned replace_byte (unsigned x, int i, unsigned char b); Here are some examples showing how the function should work: replace_byte(0x12345678, 2, 0xAB) --> 0x12AB5678 replace_byte(0x12345678, 0, 0xAB) --> 0x123456AB Bit-Level Integer Coding Rules In several of the following problems, we will artificially restrict what programming constructs you can use to help you gain a better understanding of the bit-level, logic, and arithmetic operations of C. In answering these problems, your code must follow these rules: Allowed operations All bit-level and logic operations. Left and right shifts, but only with shift amounts between 0 and w – 1. Addition and subtraction. Equality (==) and inequality (!=) tests. (Some of the problems do not allow…
Generate MIPS code for the following code segments assuming that all variables are in memory locations.
// Task 3 // For this function, you must return the largest power of 2 that // is less than or equal to x (which will be positive). You may // not use multiplication or some sort of power function to do this, // and should instead rely on bitwise operations and the underlying // binary representation of x. If x is 0, then you should return 0. unsigned largest_po2_le(unsigned x) { return x; }
Modify the following program in lc-3 to get the input(numbers) from the keyboard and print the result to console. .ORIG x3000Loop LD R0, number1 ; load number1 into R0LDR R1, number2 ; load number2 into R1ST R2, SaveR2 ; save register R2LD R5, goSUB ; load address of SUB into R4JSRR R5 ; go to subroutine whose address in R5STR R3, result ; store resultLD R2, SaveR2 ; restore old value R2HALTnumber1 .FILL #10number2 .FILL # -8goSUB .FILL SUB ; initialize goSUB to address of SUBSaveR2 .BLKW #1; reserve space SaveR2 and SaveR3result .BLKW #1SUB NOT R1, R1ADD R2, R1, #1ADD R3, R0, R2RET.END
Q.1) Mark the following statements as true or false and correct the second part if false: 1. The number (1.638125x235) expressed in IEEE 32-bit floating-point format as: 10010011 10100010000000000000000 2. The header of the CD-ROM format contains the block address and the mode byte, in which:-Mode 0 and Mode 1 : Blank data Field, Mode 2: use of an ECC. 3. When X=1.000000000000000000000000x21 and Y=1.111111111111111111111111x20, The result of (Z=X-Y) will be Z=1x2-20 without guard bits and Z=1x2-22 when adding four guard bits. 4. The simple interrupt cycle of control unit actually consists of 3 steps and 3 micro-operations. 5. In the instruction cycle sequence, after each execute cycle is a fetch cycle. 6. The Wilkes control technique is a horizontal microprogramming format. 7. After implementation Booth`s algorithm for the operation (7 * 3) the contents of registers: A=0001 and Q= 0101. 8. Double side hard disk drives have: 8 platters, and 128 sectors per track. When the size of…
BELOW MCQ GIVEN ANSWER CAN BE MORE THAN ONE OPTION. PLEASE PROVIDE CORRECT ANSWERS. ------------------- Q3 :- The ANSI C function below causes the program in which it runs to malfunction . Which of the following connection will help to perform function successfully ? /* Return a count of all the bits set in bytes */ int bitcount (unsigned char c) { unsigned char x , b , count =0; for (b = 0 , x= 1 ; !(x & 0x100); ++b, x <<=1) { if (x | c ) ++count; } return count; } A) change the type of x to a type larger than unsigned char. B) remove the extraneous variable b. C) change the return type to unsigned char . D) change if ( x | c) to if ( x & c) inside the for loop. E) change ! (c & 0x100) to ( x < 0x100) inside the for loop.
Suppose we number the bytes in a w-bit word from 0 (least significant)to w/8 −1 (most significant).Write code for the following C function, which will return an unsignedvalue in which byte i of argument x has been replaced by byte b:unsigned replace byte (unsigned x, int i, unsigned char b);Examples:replace byte(0x12345678, 2, 0xAB) → 0x12AB5678replace byte(0x12345678, 0, 0xAB) → 0x123456AB
15. Consider the following Java-like code: int number = <<read number from user>>; int mask = MASK; int result = number OP mask; if (result != 0) { print("Bit 8 was set"); } The above code is supposed to print “Bit 8 was set” if bit 8 of user’s number was set to 1. If bit 8 was not set, then this code should not print anything (result==0). What hexadecimal value should MASK be, and what bit-wise operation should OP be, for the above code to work correctly?
write an ALP to find square of a given byte of data
You are writing code that is equivalent to: X = A / (5 + B) Assume signed bytes and the following first 3 lines of code: mov al,A mov bl,B add bl,5 What is the one line of code that will perform the division correctly?
Given rax = 0x0000000200000100, rbx = 0x0000000000000100, and rcx = 0x0000000000000001,and the following values in memoryaddress -> byte at that address0x0000000000000100 -> 0x010x0000000000000101 -> 0x000x0000000000000102 -> 0x000x0000000000000103 -> 0x000x0000000000000104 -> 0x020x0000000000000105 -> 0x000x0000000000000106 -> 0x000x0000000000000107 -> 0x00what is the new value in %rax after the following operation?subq -0x04(%rbx, %rcx, 4), %rax