16. List the 3 types of memory partitions as discussed in class. 17. In which of

Question

16. List the 3 types of memory partitions as discussed in class.

17. In which of the 3 types of memory are static variables stored?

18. There are two things the NOP instruction accomplishes while doing nothing, list one.

19. Given ecx = 0x0000007B, so cl=0x7B, what is the minimum value that when added, would set the
OVERFLOW flag?
   add cl, __________ ; minimum value to cause OF to be set

Short Answer (40 pts)

20. (4 pts) Given esp = 0x18F448, what is value of eax after executing a “pop eax” instruction? What is esp
after executing the pop instruction?
0018FF44 B0 CA CC BE EF BE AD DE eax = __________ esp = __________

21. (12 pts) Given that [ ebp - 0x14 ] refers to a local variable named tmpD = 0xDE76A1 and ebp = 0x1288C.

CODE A: CODE B: .
mov ecx, [ebp - 0x14]    vs. lea ecx, [ebp – 0x14]
push ecx    push ecx
call func1 call func1

a. (4 pts) Briefly describe the difference between the CODE A instructions and the CODE B instructions.

b. (4 pts) For each one, show what ecx looks like on the stack.

Stack CODE A: CODE B:
0x12880

c. (4 pts) Show the matching C function call for each.

Explanation / Answer

Please Note: You have posted more than one Question. As per Chegg Answering Guidelines, I have answered the first question. Please Post Separate for other Questions.

Q16. List the 3 types of memory partitions as discussed in class.

Answer)

Memory partitioning is the technique or the system where the memory of the computer or device is partitioned into sections which can be allocated to the programs for their execution. The memory divisions are known as the partitions of the memory. There are 3 types of memory partitions as:

Fixed Partitioning - Fixed partitioning means dividing the memory into fixed sizes and the process of the programs can be loaded into the memory blocks of fixed or else greater than the size, thus fixed partitioning occurs and the space left behind unutilized is known as fragmentation space.

Variable Partitioning - Variable partitioning is the process of variably dividing the memory into many sizes such as the memory is divided into non overlapping variable partitions. The large programs fit in large partitions while smaller ones in smaller.

Dynamic Partitioning - Dynamic Partitioning is the division of the partitioning of the memory where the size of the partition is not declared initially but is set at the time when the process is to be loaded into the memory. Thus each partition will be equal to the accommodate the size of the process/program. This way the fragmentation loss can be avoided.

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.