Large address space 2n where n = word length May be nested, multilevel, cascaded - e.g. EA = (((A))) • Draw the diagram yourself -

Suppose that we have the following stack, where the red line is the indicator for sp. The stack grows downwards in main memory, just as it does in a regular RISC-V main memory. Both Wordo and Word1 occupy 1 word each: Word ( Word1 If we want to store the following contents of the stack: (i) a byte from to, (ii) a half word from t1, (iii) a word from t2, such that the stack becomes the following shown below: Word to I t1 t2 So essentially, we are popping Word1 from stack and then pushing t0, t1 and t2 in order. Given the following RISC-V code: 1 addi sp, sp, 2 sb to, 3 sh tl, 4 SW t2, O -7,0, 1, 5 Please select the proper number sequence to fill in the blanks in lines of code maintaining the correct order. All the numbers in the options below are in decimal O-3, 0, 1, 5 ▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬ (sp) (sp) (sp) O-3, 6, 4, 0 O None of the options

Suppose a malloc implementation returns 8-byte aligned addresses and uses an explicit free list where the next and previous pointers are each 32-bits. Blocks have a 32-bit header and 32-bit footer, where the low-order bit of the header and footer are used to indicate whether the block is allocated (1) or free (0). Furthermore, the block size (which includes the header, payload, footer, and any necessary padding) is rounded up to the nearest multiple of 8, and this size (in bytes) is stored in the header and footer. Assume any padding must be between the payload and the footer.If we call malloc(1), what block size will be allocated, in bytes? With the same conditions as #1, and assuming we've already called malloc(1), if the heap used by malloc starts at address 0x4000 (16384 in decimal), what address would be returned if we then called malloc(32)?

calculate the addresses of Bottom of Stack (BOS), Top of Stack (TOS), End of Stack (EOS). How many words of data are currently being stored in the stack?