HW3-3750

HW3-3750 - 1 EE 3750 Homework 3 due Wed., March 31, 2004...

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 31, 2004 For all problems: state any assumptions made; include comments as needed to make assembly language instruction sequences clear. 1. Write an 8086 instruction sequence to jump to label ONE17 if bits 1 and 7 of byte variable BLACK are both 1. If not, then jump to label ZERO5 if bit 5 of BLACK is 0. Otherwise, execute code from label NONE. 2. Write a complete data segment DATA9 that creates: a word variable TAN, initializing two words there to 578 and 578; a byte variable YELLOW, initializing 50 bytes there with alternating values of 38 and 127 (so the sequence is 38, 127, 38, 127, etc.); • a byte variable GREEN, allocating 70 bytes of uninitialized space; and • a word variable GRAY, initializing three words there to 24 (decimal), 24 (hex), and 2C (hex). 3. Write an 8086 instruction sequence to search a given string for occurrences of the ASCII character string ‘begin’ (that is, the sequence 62H, 65H, 67H, 69H, 6EH). The string to be searched is in byte array GOLD, containing 500 elements.
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.

Page1 / 2

HW3-3750 - 1 EE 3750 Homework 3 due Wed., March 31, 2004...

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