Checkout
checkout
view
Your Cart Your Cart: item(s)
Subjects -> Computer Science -> Other -> Posting #38022
Add to Shopping Cart
$2.19 Instant Download
Computer Science, Other
Year 3

Assembly Instructions


1.  Place binary number 3B26h in register DX and count the number of binary ones in the number in DX in register AL.  For example, the binary number 3F62h has nine binary ones.

2.Write a program that takes the smaller of two words stored in memory locations DS:1234h and DSL=:5678h and store in register AX.

By OTA:  Rachna Kundliya, PhD

OTA Rating:  4.6/5

Your Price:  $2.19  (original value ~$7.98)

What's included:

  • Plain text response
  • Attachment(s):
    • solution.doc
$2.19 Download Add to Cart

Add to Shopping Cart
$2.19 Instant Download
Assembly Instructions - Add together all of the 2-word numbers that are stored from address 60000h to 60FFFh in memory. Store the sum starting at location 61020h. Each 2-word number may range in size from 00000000h to FFFFFFFFh. Include a flowchart clearly describing your solution.
Advanced Instructions: Convert any hexadecimal number ... Multiply the byte in register ... - Write complete programs for the following problems. 1. Convert any hexadecimal number from 00 to 63h placed in AX into its equivalent unpacked BCD number in AX. 2. Multiply the byte in register AL by the byte in register BL. Place the result in AX.
Useful Assembly Instructions - Count the number of bytes located in memory from DS:1000h to DS:1200h that are greater than 77h. Place the count on register CA.
Procedures - Create a stack area at 1000h. Push 10h bytes, located at data memory addresses 60000h to 6000fh, on the stack using indirect addressing. Then pop the stack to memory addresses 62000h to 6200fh using indirect addressing. Load unique data into the 10h bytes in order to test the program.
Procedures - Write a simple near procedure (such as a return) and call it using direct addressing.

Page generated in 0.2954 seconds

About Us ·  Contact Us ·  Samples ·  Solutions ·  Legal Terms and Conditions ·  Privacy Policy

©2008 SolutionLibrary.com

Search for Solutions About Us Samples