1. Terms
By accessing the website at https://gotit-pro.com, you are agreeing to be bound by these terms of service, all applicable laws and regulations, and agree that you are responsible for compliance with any applicable local laws. If you do not agree with any of these terms, you are prohibited from using or accessing this site. The materials contained in this website are protected by applicable copyright and trademark law.
2. Use License
- Permission is granted to temporarily download one copy of the materials (information or software) on “Gotit Pro’s” website for personal, non-commercial transitory viewing only. This is the grant of a license, not a transfer of title, and under this license you may not:
- modify or copy the materials;
- use the materials for any commercial purpose, or for any public display (commercial or non-commercial);
- attempt to decompile or reverse engineer any software contained on “Gotit Pro’s” website;
- remove any copyright or other proprietary notations from the materials; or
- transfer the materials to another person or “mirror” the materials on any other server.
- This license shall automatically terminate if you violate any of these restrictions and may be terminated by “Gotit Pro” at any time. Upon terminating your viewing of these materials or upon the termination of this license, you must destroy any downloaded materials in your possession whether in electronic or printed format.
3. Disclaimer
- The materials on “Gotit Pro’s” website are provided on an ‘as is’ basis. “Gotit Pro” makes no warranties, expressed or implied, and hereby disclaims and negates all other warranties including, without limitation, implied warranties or conditions of merchantability, fitness for a particular purpose, or non-infringement of intellectual property or other violation of rights.
- Further, “Gotit Pro” does not warrant or make any representations concerning the accuracy, likely results, or reliability of the use of the materials on its website or otherwise relating to such materials or on any sites linked to this site.
4. Limitations
In no event shall “Gotit Pro” or its suppliers be liable for any damages (including, without limitation, damages for loss of data or profit, or due to business interruption) arising out of the use or inability to use the materials on “Gotit Pro’s” website, even if “Gotit Pro’s” authorized representative has been notified orally or in writing of the possibility of such damage. Because some jurisdictions do not allow limitations on implied warranties, or limitations of liability for consequential or incidental damages, these limitations may not apply to you.
5. Accuracy of materials
The materials appearing on “Gotit Pro’s” website could include technical, typographical, or photographic errors. “Gotit Pro” does not warrant that any of the materials on its website are accurate, complete or current. “Gotit Pro” may make changes to the materials contained on its website at any time without notice. However “Gotit Pro” does not make any commitment to update the materials.
6. Links
“Gotit Pro” has not reviewed all of the sites linked to its website and is not responsible for the contents of any such linked site. The inclusion of any link does not imply endorsement by “Gotit Pro” of the site. Use of any such linked website is at the user’s own risk.
7. Modifications
“Gotit Pro” may revise these terms of service for its website at any time without notice. By using this website you are agreeing to be bound by the then current version of these terms of service.
8. Governing Law
These terms and conditions are governed by and construed in accordance with the laws of Florida and you irrevocably submit to the exclusive jurisdiction of the courts in that State or location.
![1. Write a program in MARIE assembly language to perform the following code segment. Test your code thoroughly using the MARIE simulator with values of X=10, X=20, and X=30. What is the value stored in X and Y by the end of execution? Include comments for each line of instruction in your program (12 points). X=10 Y=0 while X!=0 do Y=X X=X-1 endwhile while X!=0 do Y=X X=X-1 endwhile 2. Consider the following program in MARIE assembly language. Complete the table detailing the RTN for the next 3 instructions only that will be executed including the content of registers PC, IR, MAR, MBR, and AC in hexadecimal. Note the first instruction LOAD X is already filled. Note also that the SKIPCOND instruction has no operands, therefore you can complete Fetch, decode and execute cycles only. Explain in one statement what this program is doing (14 points). ORG 000 LOAD X ; AC = X Repeat, ADD One ; AC = X + 1 SKIPCOND 000 ; if AC < 0 then PC = PC + 1 (skip) JUMP End ; Go to End STORE X ; X = AC JUMP Repeat ; Go to Repeat End, STORE X ; Stop (end of program) This program is incrementing the value of X by 1 repeatedly until the value in AC becomes negative. 3. Assume a main memory has the following hex values in the first two bytes: Byte 0: 8F Byte 1: 0F What is the actual decimal value stored in these bytes, assuming they are in 16-bit 2's complement representation and the machine is using: a) Big endian memory b) Little endian memory (4 points) a) In big endian memory, the byte order is reversed. So, the actual decimal value stored in these bytes would be -7. b) In little endian memory, the byte order remains the same. So, the actual decimal value stored in these bytes would be 36655. 4. Consider the assembly program (in MARIE) below and the corresponding memory address for each instruction. Show the symbol table that will be constructed by the assembler after the first pass including the translated program, then fill in the final machine code produced by the assembler after the second pass. Fill in the given tables using HEX numbers for instructions and addresses. (10 points) [Symbol Table] LOAD 0100 ADD 0101 STORE 0110 SUBT 0111 JUMP 1000 Dec1 0001 [First Pass] 0100 LOAD X ; Load value at address X to AC 0101 ADD Y ; Add value at address Y to AC 0110 STORE Z ; Store value in AC to address Z 0111 SUBT X ; Subtract value at address X from AC 1000 JUMP Z ; Jump to address Z [Second Pass] 0100 1005 ; Load X 0101 5006 ; Add Y 0110 210B ; Store Z 0111 1015 ; Subtract X 1000 4010 ; Jump Z](https://gotit-pro.com/wp-content/uploads/2023/10/fa03249e-78f5-4de9-8ddf-1a7a5999f6df.jpg)
![Emergency Response Planning You are responsible for planning emergency response routes for a city. The city is represented as a graph, with intersections as nodes and roads as edges. In the event of an emergency, you need to find the shortest path from a central emergency command center to various locations in the city to minimize response time. The city's road network is represented as an undirected weighted graph, where each road has a known travel time (weight) associated with it. Your task is to find the shortest paths from the central emergency command center (Node F) to all other intersections in the city. Your code should return a nested list of [Source, Target, Duration]. Example: [[F, C, 2]]](https://gotit-pro.com/wp-content/uploads/2023/10/c150e24f-eb6a-4e13-a47f-5bc50d4fda18.jpg)
Judie Hoffman –
Excellent job, my friend. Thank You!!
Jessica Arbon –
It was quality work and in a timely manner. It was the help I needed at the time, and I appreciate it so very much.
Michael Jones –
Great job, very quick and informative! Done in an hours! Thank you for a job well done.
Julie Redd –
Great quality solution, Done way before time
Stephen Farrell –
The assignment was excellent and I have scored 100 percent. I am very proud and happy with you.
Fred Halfpap –
Work was finished long before due and tutor was considerate and engaging. Perfect!