Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 441 Weeks Ago, 3 Days Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Accounting Posted 06 Jun 2017 My Price 5.00

The Motorola 680x0 machines include the instruction

 

The Motorola 680x0 machines include the instruction Decrement and Branch According to Condition, which has the following form:

DBcc Dn, displacement

where cc is one of the testable conditions, Dn is a general-purpose register, and displacement specifies the target address relative to the current address. The instruction can be defined as follows:

When the instruction is executed, the condition is first tested to determine whether the termination condition for the loop is satisfied. If so, no operation is performed and execution continues at the next instruction in sequence. If the condition is false, the specified data register is decremented and checked to see if it is less than zero. If it is less than zero, the loop is terminated and execution continues at the next instruction in sequence. Otherwise, the program branches to the specified location. Now consider the following assembly-language program fragment:

Two strings addressed by A0 and A1 are compared for equality; the string pointers are incremented with each reference. D1 initially contains the number of long words (4 bytes) to be compared.

 

a. The initial contents of the registers are   (the $ indicates hexadecimal notation). Memory between $4000 and $6000 is loaded with words $AAAA. If the foregoing program is run, specify

the number of times the DBNE loop is executed and the contents of the three registers when the NOP instruction is reached.

b. Repeat (a), but now assume that memory between $4000 and $4FEE is loaded with $0000 and between $5000 and $6000 is loaded with $AAA.

 

 

 
 

Answers

Alpha Geek
(8)
Status NEW Posted 06 Jun 2017 03:06 PM My Price 5.00

-----------

Attachments

file 1496763399-Answer.docx preview (408 words )
T-----------he -----------Mot-----------oro-----------la -----------680-----------x0 -----------mac-----------hin-----------es -----------inc-----------lud-----------e t-----------he -----------ins-----------tru-----------cti-----------on -----------Dec-----------rem-----------ent----------- an-----------d B-----------ran-----------ch -----------Acc-----------ord-----------ing----------- to----------- Co-----------ndi-----------tio-----------n, -----------whi-----------ch -----------has----------- th-----------e f-----------oll-----------owi-----------ng -----------for-----------m: ----------- DB-----------cc -----------Dn,----------- di-----------spl-----------ace-----------men-----------t -----------whe-----------re -----------cc -----------is -----------one----------- of----------- th-----------e t-----------est-----------abl-----------e c-----------ond-----------iti-----------ons-----------, D-----------n i-----------s a----------- ge-----------ner-----------al------------pur-----------pos-----------e r-----------egi-----------ste-----------r, -----------and----------- di-----------spl-----------ace-----------men-----------t s-----------pec-----------ifi-----------es -----------the----------- ta-----------rge-----------t a-----------ddr-----------ess----------- re-----------lat-----------ive----------- to----------- th-----------e c-----------urr-----------ent----------- ad-----------dre-----------ss.----------- Th-----------e i-----------nst-----------ruc-----------tio-----------n c-----------an -----------be -----------def-----------ine-----------d a-----------s f-----------oll-----------ows-----------: ----------- W-----------hen----------- th-----------e i-----------nst-----------ruc-----------tio-----------n i-----------s e-----------xec-----------ute-----------d, -----------the----------- co-----------ndi-----------tio-----------n i-----------s f-----------irs-----------t t-----------est-----------ed -----------to -----------det-----------erm-----------ine-----------
Not Rated(0)