Need help with question 17 please Modify the program in question 12 to use R1 as

Question

Need help with question 17 please

Modify the program in question 12 to use R1 as your counter. The maximum amount of times a loop can be repeat using accumulator B or a memory location is ___. How do you get around the problem in question 14? The maximum amount of times our "solution to question 14" loop can be repeated is ___. Fill in the chart below Action of statement if: Instruction Flag checked Flag = set Flag=clear BEQ BCC Define a short branch. Give 3 examples of a short branch. How many bytes are the above examples? If the second byte of the short branch positive the jump is ___ and if it is negative the jump is ___.

Explanation / Answer

BEQ (Branch if equal) If flag is set it will jump to given instruction, if flag is clear, it will not do anything

BCC (Branch on cary clear) If flag is set do not do anything, If flag is clear jump to given instruction

Related Questions

Navigate

• Browse (All)
• Browse N
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.