Description
Inventory Management System Implementation:
Create an Inventory Management System class that manages the inventory using the MyList data structure. Implement methods in the Inventory Management System class to perform the following operations:
a. addItemToInventory(InventoryItem item): Adds an item to the inventory.
b. removeItemFromInventory(int itemID): Removes an item from the inventory by its unique item ID.
c. updateItemQuantity(int itemID, int newQuantity): Updates the quantity of an item.
d. displayAllItems(): Displays a list of all inventory items.
e. calculateTotalInventoryValue(): Calculates and returns the total value of the inventory.
User Interaction:
Develop a menu-driven application that simulates interaction with the Inventory Management System. The menu should offer options like:
1. Add an item to inventory.
2. Remove an item from inventory.
3. Update item quantity.
4. Display all inventory items.
5. Calculate total inventory value.
6. Exit.
Testing:
Make sure to test your program on various scenarios, including adding and removing items, updating quantities, displaying all items, and calculating the inventory value.
Before submitting your assignment, read the following instructions carefully:
1. Submit neat and well-organized Java code(s) by adding comments to your code(s), giving the variables representative names and printing appropriate messages for the output.
2. The assignment should be uploaded to the portal (follow the TA’s instructions). Do NOT submit the assignment by email.
3. Assignments that are not uploaded to the portal will NOT be accepted.
4. Give a representative name for your Java file, e.g. “Question1.java”.
![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)
Nancy Del –
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.
Amy Lowe –
Great Work In Timely Fashion. Something what I wanted.
Greg King –
Everything was completed on time and met my expectations.
David Leedberg –
Thank for your help and service. I really like the work that they did on my paper.
Kirsten Gorby –
It was amazing work and in a very short time.