Make a program (use emu8086) for filling memory location from 1200H to 1250H with data 11H, 13H, 15H, 17H, 19H, 1BH, 1DH, 1FH, and so on, respectively. Then divide each data then divide each data in a memory location by 10H. Store the quotient in a memory location starting from 1000H . Make as efficient as possible! (Note: DS = 100H)

Make a program (use emu8086) for filling memory location from 1200H to 1250H with data 11H, 13H, 15H, 17H, 19H, 1BH, 1DH, 1FH, and so on, respectively. Then divide each data then divide each data in a memory location by 10H. Store the quotient in a memory location starting from 1000H . Make as efficient as possible! (Note: DS = 100H)

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

Implementing matrix addition is pretty simple; see the program below. However, the given addition function matrix_add_double() does not run at full speed. On the instructors computer, which has 16GB of RAM, the program below shows that the call to matrix_add_double takes 38571 ms, while another, better implementation achieves the same result in 3794.7ms, which is 10.2 times faster! Your job for this exercise is: • to explain what in the Operating System and/or CPU and/or other part of the system makes the implementation below go so slowly. • to fix the code to achieve full speed. Hint: There are two reasons why the code runs slowly. The one reason is related to how virtual addresses get translated to physical addresses, the other reasons is related to another effect in the hardware. Only the performance for the matrix_add_double function() counts for your exam results. You can leave the other parts of the code untouched, but you may also change them.…
Write a python program. Add a function called reverse() that outputs a DNA strand in reverse. Example: reverse(AATC) returns CTAA Note: you should not use the built-in reverse method.
Suppose that the following code is run on a machine that has a maximum integer value of32,767.int A, B, C, DA = 20,000B = 25,000C = -20,000D = A + B + CIs the add operator above associative? Explain the reason.
Consider the code presented below: y = (1, 9, 2) y[1]=8 print(y) What do we get when we execute this code? Answer:
Prob 7. We have learned in the class that using the barrel shifter, we can implement multiplication/division of a number for some special cases with addition, subtraction, and reversed subtraction instructions as well as shift instructions. For each of the following calculations, write a single-line assembly code to perform it using this approach assuming signed integers A and B are saved in r0 and ri respectively: (a) A = 7 * B / 8 (b) A 7 B/8 5
Implement the modular exponentiation (a.k.a. fast exponentiation)function mod_exp (b, n, m) to compute bn (mod m) more efficiently. (Hint: toread n bit-by-bit, use / and % operations repeatedly)a) Test your function for b = 3, n = 231 – 2, m = 231 – 1.b) Report the result and the time (in seconds) it takes to find the result. in pahton
Write a program to handle a user's rolodex entries. (A rolodex is a system with tagged cards each representing a contact. It would contain a name, address, and phone number. In this day and age, it would probably have an email address as well.) Typical operations people want to do to a rolodex entry are: 1) Add entry 2) Edit entry 3) Delete entry 4) Find entry 5) Print all entries 6) Quit You can decide what the maximum number of rolodex entries is and how long each part of an entry is (name, address, etc.). When they choose to edit an entry, give them the option of selecting from the current rolodex entries or returning to the main menu — don't force them to edit someone just because they chose that option. Similarly for deleting an entry. Also don't forget that when deleting an entry, you must move all following entries down to fill in the gap. If they want to add an entry and the rolodex is full, offer them the choice to return to the main menu or select a person to overwrite. When…
use nano as text editor --> provide the file or screenshot so I can see my problem Implement the following code in ARM on Raspberry Pi, compile and run. g=12, h=8, i=2, j=5; f = (g + h) - (i + j); Your program displays the message: f = (g + h) – (i + j) = 13 Note: answer should be calculated not hardcoded
Please write a program using python to show the movement of polymerase in transcription elongation model. For example, there are some nucleotides, 'ATCCTGCAAGTC...'. If polymerase chooses the correct complementary nucleotides, it moves forward. if it chooses a wrong nuceotide, it moves backward.
Write a Python program that implements the Taylor series expansion of the function (1+x) for any x in the interval (-1,1], as given by: 1(1+x) = x-x²/2 + x³/3 - x^/4 + x³/5. The program prompts the user to enter the number of terms n. If n> 0, the program prompts the user to enter the value of x. If the value of xis in the interval (-1, 1], the program calculates the approximation to l(1+x) using the first n terms of the above series. The program prints the approximate value. Note that the program should validate the user input for different values. If an invalid value is entered, the program should output an appropriate error messages and loops as long as the input is not valid. Sample program run: Enter number of terms: 0 Error: Zero or negative number of terms not accepted Enter the number of terms: 9000 Enter the value of x in the interval (-1, 1]: -2 Error: Invalid value for x Enter the value of x in the interval (-1, 1]: 0.5 The approximate value of ln (1+0.5000) up to 9000 terms…