Q 2/A- Write a program to add the following five data bytes stored in data segment offset starting from [0800H], if the sum generates a carry , stop the adding ,and store (2B) in data segment offset [0440H], otherwise, continue adding and store the sum in data segment offset [0440H], Data (H): 04,06 ,01,02 and 11. B- What two conditions can terminate the operation performed by the instruction LOOPNE? C- What flag condition is tested for by the instruction JNS?

Q 2/A- Write a program to add the following five data bytes stored in data segment offset starting from [0800H], if the sum generates a carry , stop the adding ,and store (2B) in data segment offset [0440H], otherwise, continue adding and store the sum in data segment offset [0440H], Data (H): 04,06 ,01,02 and 11. B- What two conditions can terminate the operation performed by the instruction LOOPNE? C- What flag condition is tested for by the instruction JNS?

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

Modify the code below: Add code to display both sum and diff in a hexadecimal format on the screen, all bytes must be stored in a reversed sequence order. code: .386 ; Tells MASM to use Intel 80386 instruction set..MODEL FLAT ; Flat memory modeloption casemap:none ; Treat labels as case-sensitive INCLUDE IO.H ; header file for input/output .STACK 100h ; (default is 1-kilobyte stack) .const ; Constant data segment .DATA ; Begin initialized data segment op1 QWORD 0A2B2A40675981234h ; first 64-bit operand for additionop2 QWORD 08010870001234502h ; second 64-bit operand for addition sum DWORD 3 dup(?) ; 96-bit sum = ????????????????????????h op3 DWORD 2h, 0h, 0h ; 96-bit operand to subtract: 20000000200000002h .CODE ; Begin code segment_main PROC ; Beginning of code;-----------------------------------------------------------------------------; add two 64 bit numbers and store the result as 96 bit sum;-----------------------------------------------------------------------------mov EAX,…
// 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; }
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…
EX.3:Convert four last digits (suppose that each digit is the hexadecimal number) in your roll number to binary.Example: if your roll number is HE162491, then four last digits in your roll number are 2491. So, in binary form you will have: 0010 0100 1001 0001a. Encoding each block of 8 bits with Hamming Code (12, 8). b. Using any one encoded block in [a] and modify to one bit error. Explain how to correct error bit?
1. Write a C++ program that takes two binary numbers of 8 bits eachrepresented with the letters Z and O (for zero or one) and displays thesum in binary with Zs and Os. Do this by converting the numbers to ints,adding the its using +, displaying the 3 ints, then converting the sum toZ and Os and displaying the result. 1 a.) Redo number 1, by doing a bit-by-bit addition, not forgetting the carry. 1b.) Write a program to take two numbers represented with romannumerals and display the sum. Assume the sum will be less than 20.Hints: Ask the user to terminate each number with a semicolon and usechars to hold the roman ‘digits’.The numbers are I, II, III IV, V, VI, VII, VIII, IX, X, XI, XII, XIII, XIV, XV…isfive, Change the program to allow the sum to go up to 49 See how large a number you can handle. L is 50, C is 100, M is 1000. Using basic C++ int, char, if- else statements, and switch statements, please! no functions, or strings, or Cmath etc.
Write a program that will: a. Create an array of bytes containing the values: 12h, 34h, 56h, 78h, 9Ah, BCh, DEh, F0h b. Loop over the array and compute the sum in the EAX register. Note: the array contains bytes and you convert the bytes in the array to a 32-bit value before performing the sum. c. Show the contents of the EAX and ECX register at each iteration of the loop.
6.8 Run the test bench of Program 6-6 for the 2-to-4 decoder module Vr2to4dec_s in Program 6-1, showing that there are no errors. Then do three more runs, each time inserting or deleting just one character in Vr2to4dec_s, resulting in the test bench reporting 2, 4, and 8 errors.
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…
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?
Generate MIPS code for the following code segments assuming that all variables are in memory locations.
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.