x86 - can anyone help me and write the program of this equation: x=n mod y, in assembly lsnguage -


how can solve problem in assembly language: using sub, mov, , instructions, show how calculate x = n mod y, assuming given values of n , y. n 16-bit unsigned integer, , y power of 2.

there 2 main steps solving problems this:

  1. determine algorithm , express in pseudocode or language such c

  2. implement (1) in assembler.

for step (1) need know n mod y, y power of 2, equivalent n , (y - 1).


Comments

Popular posts from this blog

Add email recipient to all new Trac tickets -

400 Bad Request on Apache/PHP AddHandler wrapper -

php - Change action and image src url's with jQuery -