HW3-3750

HW3-3750 - 1 EE 3750 Homework 3 due Wed For all problems...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 OVER EE 3750 — Homework 3 due Wed., March 29, 2006 For all problems: state any assumptions made; include comments as needed to make assembly language instruction sequences clear. 1. Write a complete data segment DATA0 that creates: a byte variable GRAY, initializing four bytes there to 10110 (binary), 101 (decimal), 10 (hex), and 3E (hex); a word variable BLUE, initializing 30 words there in a repeating sequence of 3750, 2006, 2007 values (that is, 3750, 2006, 2007, 3750, 2006, 2007, 3750, etc.); a word variable GOLD, allocating 350 words of uninitialized space; and • a byte variable SILVER, initialized to 56. 2. Write an 8086 instruction sequence to search a given string for the first occurrence of each of the following letters: ‘S’, ‘P’, ‘I’, and ‘N’. Use string comparison instructions. Let byte array TEXT hold the input string to be searched, and let LENGTH hold the number of elements in TEXT. Let byte array SPIN with four elements hold the ASCII codes for each of the letters ‘S’,
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/25/2012 for the course EE 3750 taught by Professor Desouza during the Fall '08 term at LSU.

Page1 / 2

HW3-3750 - 1 EE 3750 Homework 3 due Wed For all problems...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online