LC-3 ASSEMBLE LANGUAGE instructions are provided in pdf esssay

student
I don’t understand this Computer Science question and need help to study.please use the same memory address that’s given and the instruction are provided in the templet and the pdf ORIG x3000; Program begins here;————-;Instructions;————-;——————————-;INSERT CODE STARTING FROM HERE;——————————–HALT;—————;Data;—————;Subroutine pointers;Other datanewline .fill ‘/n’; Strings for reports from menu subroutines:goodbye .stringz “Goodbye!/n”allbusy .stringz “All machines are busy/n”allnotbusy .stringz “Not all machines are busy/n”allfree .stringz “All machines are free/n”allnotfree.stringz “Not all machines are free/n”busymachine1 .stringz “There are ”busymachine2 .stringz ” busy machines/n”freemachine1 .stringz “There are ”freemachine2 .stringz ” free machines/n”status1 .stringz “Machine ”status2 .stringz ” is busy/n”status3 .stringz ” is free/n”firstfree1 .stringz “The first available machine is number ”firstfree2 .stringz “No machines are free/n”;—————————————————————————————————————–; Subroutine: MENU; Inputs: None; Postcondition: The subroutine has printed out a menu with numerical options, invited the; user to select an option, and returned the selected option.; Return Value (R1): The option selected: #1, #2, #3, #4, #5, #6 or #7 (as a number, not a character); no other return value is possible;—————————————————————————————————————–;——————————-;INSERT CODE For Subroutine MENU;——————————–;HINT back up;HINT Restore;——————————–;Data for subroutine MENU;——————————–Error_msg_1 .STRINGZ “INVALID INPUT/n”Menu_string_addr .FILL x6400;—————————————————————————————————————–; Subroutine: ALL_MACHINES_BUSY (#1); Inputs: None; Postcondition: The subroutine has returned a value indicating whether all machines are busy; Return value (R2): 1 if all machines are busy, 0 otherwise;—————————————————————————————————————–;——————————-;INSERT CODE For Subroutine ALL_MACHINES_BUSY;——————————–;HINT back up;HINT Restore;——————————–;Data for subroutine ALL_MACHINES_BUSY;——————————–BUSYNESS_ADDR_ALL_MACHINES_BUSY .Fill xB200;—————————————————————————————————————–; Subroutine: ALL_MACHINES_FREE (#2); Inputs: None; Postcondition: The subroutine has returned a value indicating whether all machines are free; Return value (R2): 1 if all machines are free, 0 otherwise;—————————————————————————————————————–;——————————-;INSERT CODE For Subroutine ALL_MACHINES_FREE;——————————–;HINT back up;HINT Restore;——————————–;Data for subroutine ALL_MACHINES_FREE;——————————–BUSYNESS_ADDR_ALL_MACHINES_FREE .Fill xB200;—————————————————————————————————————–; Subroutine: NUM_BUSY_MACHINES (#3); Inputs: None; Postcondition: The subroutine has returned the number of busy machines.; Return Value (R1): The number of machines that are busy (0);—————————————————————————————————————–;——————————-;INSERT CODE For Subroutine NUM_BUSY_MACHINES;——————————–;HINT back up;HINT Restore;——————————–;Data for subroutine NUM_BUSY_MACHINES;——————————–BUSYNESS_ADDR_NUM_BUSY_MACHINES .Fill xB200;—————————————————————————————————————–; Subroutine: NUM_FREE_MACHINES (#4); Inputs: None; Postcondition: The subroutine has returned the number of free machines; Return Value (R1): The number of machines that are free (1);—————————————————————————————————————–;——————————-;INSERT CODE For Subroutine NUM_FREE_MACHINES;——————————–;HINT back up;HINT Restore;——————————–;Data for subroutine NUM_FREE_MACHINES;——————————–BUSYNESS_ADDR_NUM_FREE_MACHINES .Fill xB200;—————————————————————————————————————–; Subroutine: MACHINE_STATUS (#5); Input (R1): Which machine to check, guaranteed in range {0,15}; Postcondition: The subroutine has returned a value indicating whether; the selected machine (R1) is busy or not.; Return Value (R2): 0 if machine (R1) is busy, 1 if it is free; (R1) unchanged;—————————————————————————————————————–;——————————-;INSERT CODE For Subroutine MACHINE_STATUS;——————————–;HINT back up;HINT Restore;——————————–;Data for subroutine MACHINE_STATUS;——————————–BUSYNESS_ADDR_MACHINE_STATUS.Fill xB200;—————————————————————————————————————–; Subroutine: FIRST_FREE (#6); Inputs: None; Postcondition: The subroutine has returned a value indicating the lowest numbered free machine; Return Value (R1): the number of the free machine;—————————————————————————————————————–;——————————-;INSERT CODE For Subroutine FIRST_FREE;——————————–;HINT back up;HINT Restore;——————————–;Data for subroutine FIRST_FREE;——————————–BUSYNESS_ADDR_FIRST_FREE .Fill xB200;—————————————————————————————————————–; Subroutine: GET_MACHINE_NUM; Inputs: None; Postcondition: The number entered by the user at the keyboard has been converted into binary,; and stored in R1. The number has been validated to be in the range {0,15}; Return Value (R1): The binary equivalent of the numeric keyboard entry; NOTE: You can use your code from assignment 4 for this subroutine, changing the prompt,; and with the addition of validation to restrict acceptable values to the range {0,15};—————————————————————————————————————–;——————————-;INSERT CODE For Subroutine;——————————–;——————————–;Data for subroutine Get input;——————————–prompt .STRINGZ “Enter which machine you want the status of (0 – 15), followed by ENTER: ”Error_msg_2 .STRINGZ “ERROR INVALID INPUT/n”;—————————————————————————————————————–; Subroutine: PRINT_NUM; Inputs: R1, which is guaranteed to be in range {0,16}; Postcondition: The subroutine has output the number in R1 as a decimal ascii string,; WITHOUT leading 0’s, a leading sign, or a trailing newline.; Return Value: None; the value in R1 is unchanged;—————————————————————————————————————–;——————————-;INSERT CODE For Subroutine;——————————–;——————————–;Data for subroutine print number;——————————–.ORIG x6400MENUSTRING .STRINGZ “**********************/n* The Busyness Server */n**********************/n1. Check to see whether all machines are busy/n2. Check to see whether all machines are free/n3. Report the number of busy machines/n4. Report the number of free machines/n5. Report the status of machine n/n6. Report the number of the first available machine/n7. Quit/n”.ORIG xB200; Remote dataBUSYNESS .FILL xABCD; <—-!!!BUSYNESS VECTOR!!! Change this value to test your program.;—————;END of PROGRAM;—————.ENDRequirements: 1 | .doc file | Assembly LanguageATTACHMENTS
Approximate price: $22
We value our customers and so we ensure that what we do is 100% original..

With us you are guaranteed of quality work done by our qualified experts.Your information and everything that you do with us is kept completely confidential.You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.The Product ordered is guaranteed to be original. Orders are checked by the most advanced anti-plagiarism software in the market to assure that the Product is 100% original. The Company has a zero tolerance policy for plagiarism.The Free Revision policy is a courtesy service that the Company provides to help ensure Customer’s total satisfaction with the completed Order. To receive free revision the Company requires that the Customer provide the request within fourteen (14) days from the first completion date and within a period of thirty (30) days for dissertations.The Company is committed to protect the privacy of the Customer and it will never resell or share any of Customer’s personal information, including credit card data, with any third party. All the online transactions are processed through the secure and reliable online payment systems.By placing an order with us, you agree to the service we provide. We will endear to do all that it takes to deliver a comprehensive paper as per your requirements. We also count on your cooperation to ensure that we deliver on this mandate.