Question

Come up with an algorithm that searches for the minimum integer in 100 memory locations starting...

Come up with an algorithm that searches for the minimum integer in 100 memory locations starting from 0x5a00, and sets R7 to the minimum integer. Your solution should use a looping construct. Note: Both positive and negative integers are allowed. a) Show the algorithm as a flowchart by decomposing it into its basic constructs. (4 points) b) Convert the above algorithm to an LC-3 program. Write the program in LC-3 binary code. Comment each line of code and submit the binary code as a text file to the dropbox. The program should start at memory address x4000. Print out a screenshot of your code with the PC at the HALT instruction. Turn in the screenshot as a hard copy. (6 points)

0 0
Add a comment Improve this question Transcribed image text
Know the answer?
Add Answer to:
Come up with an algorithm that searches for the minimum integer in 100 memory locations starting...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • i need help with a mips program to to covert roman numerals to real numbers Lab 4: Roman Numeral Conversion Part A: Due...

    i need help with a mips program to to covert roman numerals to real numbers Lab 4: Roman Numeral Conversion Part A: Due Sunday, 19 May 2019, 11:59 PM Due Friday, 24 May 2019, 11:59 PM Part B: Minimum Submission Requirements Ensure that your Lab4 folder contains the following files (note the capitalization convention): o Diagram.pdf o Lab4. asm O README.txt Commit and push your repository Lab Objective In this lab, you will develop a more detailed understanding of how...

  • LC-3 Programming Help!! The Stack Protocol The following outline is the protocol for passing arguments to...

    LC-3 Programming Help!! The Stack Protocol The following outline is the protocol for passing arguments to a function and returning values. Everything is stored on the runtime stack so that space is used only when the function is executing. As a result the actual address of arguments and locals may change from call to call. However, the layout of the stack frame (activation record) is constant. Thus, the offests from the frame pointer (FP) to the parameters/locals are constant. All...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT