how can i find the square root of a number that is stored in the ax register in emu 8086 assembly
How to achieve-
Program in tabular form –
| OFFSET | MNEMONICS | COMMENT |
|---|---|---|
| 0400 | MOV AX, [500] | AX <- [500] |
| 0404 | MOV CX, 0000 | CX <- 0000 |
| 0407 | MOV BX, FFFF | BX <- FFFF |
| 040A | ADD BX, 02 | BX = BX + 02 |
| 040E | INC CX | C = C + 1 |
| 040F | SUB AX, BX | AX = AX – BX |
| 0411 | JNZ 040A | JUMP to 040A if ZF = 0 |
| 0413 | MOV [600], CX | [600] <- CX |
| 0417 | HLT | Stop |
Explanation of how it is being done –
how can i find the square root of a number that is stored in the ax...
Answer the following questions I want to double check my work
Q1: (8086 processor) Translate the following code segment written in high level languages into assembly code. Assume Ax contains signed number. If AX >=2 then CX=CX+1 ; Else AX-CX; End Q2: Show how this statement M JK-1 could be translated into assembly code using 8086 instruction set a) b) MIPS instruction set Assume M. J and K are memory variables In s086 assume 16-bit, we can use MOv instruction...
Find the real part of the complex number a + bi obtained as the square root of -2.4 +4.1i, where 0° <e < 180º.
How to find then perimeter of a square who's diagonal is 9 square root 38?
Need help modifying my Matlab script below (myscript calculates the square root of a number. using a Newton-Raphson method with 1 as the initial guess, calculates true and estimated error, and shows each iteration).-I need to create three new functions each of which should be called in the main script. These functions are needed to replace code that is currently in my script shown below.-I need to create these functions:A function to find f(x)A function to find f '(x) ?A...
29. A matrix B is said to be a square root of a matrix A if BB A (a) Find two square roots of A = (b) How many different square roots can you find of - (c) Do you think that every 2 x 2 matrix has at least one square root? Explain your reasoning
4. A computer's current is given by i = i, sint cost. Find the root-mean-square current from t = 0 sec to t = 0.50 sec. (6 marks)
. Write an 8086 assembly language program to find the prime numbers among 100 bytes of data in an array stored from the address 4000H: 1000H in the data segment and store the result from the address 4000H: 3000H. write the code using 8086 assembly language only i do not want any other language If you Do not sure please do not solve it
7.6 #19 ES root of y=5=2-root y-4 the index is 2 so I square both sides of the equation. I got as far as (5)^2=-4 root y-4. the answer in the book is 25+64=16y-64+64 (I would like to know how did 64 come about and how did they get 16y?
Your code must approximate the square root of an integer between 0 and 2^31-1 Using integer maths is sufficient (no floating point or fractions are required); your code will return the truncated (integer portion) of the square root. Your code must be in an assembly language subroutine which is called by a C function for testing. Be sure to use registers according to the ARM calling convention. Base your software on the following pseudocode: Approximate square root with bisection method...
does anyone know how to find the cubed root of a number on a ti89. not the titanium just the old school ti89.