The STACK is a dynamic data structure. The 80x86 computer controls its stack via stack pointer ESP. Whenever you POP data out of the stack segment memory using POP BX, the 80x86 will transfer data by: O a. Increasing the stack pointer ESP by 2. Ob. Increasing the stack pointer ESP by 4. o. Decreasing the stack pointer ESP by 2. O d. Decreasing the stack pointer ESP by 4.

Create, compile, and run a program that manages a stack.  Specifically, your program should create a stack that holds new inventory.  Suppliers will come to the store and place boxes of items in the warehouse in the back of the store.  Push these boxes onto the stack.  Store employees will, from time to time, take boxes from that stack and put the contents onto the shelves.  You should pop these from the stack.  In short, your job is to manage the stack.  As boxes are being pushed onto and popped from the stack, list each box and tell what's happening to it.  Tracking a box using the stack means pushing and popping its SKU number.  You can hardcode the SKUs into your program.   Data fields are:  SKU number   For this lab, you will need to use the files StackInterface.java and LinkedStack.java.You will have to create a class for the boxes.  You can use BalanceChecker.java and TestBalance.java to see how to create your test class. You only need to submit  StackInterface.java and/or…

Assembly programming

Look at this stack frame:   Fill in the data types for the following procedure:   SomeSub PROC,   LOCAL val1:           ,   LOCAL val2:           ,   LOCAL val3:           ,   LOCAL val4:

What are the operations that can be performed on a stack?

2. What is the address where the ascii string "!= " is stored?    3. What is the value of the stack pointer before the program executes?

Q-6: A main program consists of two procedures begins at memory address 7000H. Procedure-1 begins at begins at 6000H and Procedure-2 begins at 8000H respectively. Procedure-1 is called within Procedure-2 at memory address 8050H. In the main program Procedure-1 is called at 7040H and Procedure-2 is called twice: first at 7060H and then at 70AOH. Please note that Stack is used to save return addresses at the instants of procedure calls. Show the state of Stack while the program runs.

NAND2TETRIS HARDWARE SIMULATOR HiLoMux - This has one 8-bit input bus, in, and one 4-bit output bus, out. Alsopresent is a sel input, which is used to select what appears on out. Ifsel is false, then out should contain the lower 4-bits of in (i.e. in[0],in[1], in[2], in[3]). If sel is true, then out should contain theupper 4-bits of in (i.e. in[4] mapped to out[0], in[5], mapped toout[1], etc.). In other words, the HiLoMux can be used to select anibble from a byte please use the skeleton program below CHIP HiLoMux{    IN in[8], sel;    OUT out[4]; PARTS:     }

CPU Priority Scheduling-preemptive: Write a Java program to implement a priority scheduling algorithm that uses low number to represent high priority. Your program should first prompts the user to input a list of process ID, arrival time, burst time, and priority for each process to be run on the CPU. The list is terminated by 0 0 0 0 for the process ID, arrival time, burst time, and priority. The program output should draw a Gantt chart (as text) that shows the scheduling order of the processes using the Priority scheduling algorithm. Also print the turnaround time, response time, and waiting time for each process along with their average for all processes. Make sure to display very helpful messages to the user for input and output.

Create a code that stores values on the stack in each iteration of the factorial label. How many values are you storing on the stack in each iteration of your factorial label? By how many bytes do you expect the stack pointer to change? using coding composer studio with a MSP432 microcontroller