Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Help me ASAP !! In pep/9 and C language They are all T/F problems 8 . Pseudo-ops

ID: 3833541 • Letter: H

Question

Help me ASAP !! In pep/9 and C language

They are all T/F problems

8 . Pseudo-ops are also called assembler directives in assembly language. T / F

10 .The two possible page-replacement algorithms are Last-in, First out (LIFO) and least recently used (LRU).

12. ADDSP -- pops local variables off the stack.

13 . Pseudo-ops do not have opcodes and do not correspond to any of the 40 instructions in the Pep/9 instruction set.

16. LDWX stands for load word accumulator.

17. In a paging technique of memory management, the Operating System divides the application program in small pages, which are the same size of the memory page.

21. In a paging technique of memory allocation, the Operating system will divide the memory into many small and equal size partitions, 1-kilobyte frames

24. LDWA 0x009A,i

will load word located at 009A address to accumulator.

33. DECI and DECO are two instructions the Operating System provides at the assembly level that the Pep/9 hardware does not provide at the machine level

37. When deciding whether the state of the replaced page needs to the updated on disk, system will check the status of the dirty bit

41. Seek time is the time it takes the arm of hard drive to move to the designated cylinder.

43. The Base register solves the address-translation problem in Fix-Partition Multiprogramming memory allocation technique.

47. When using uniprogramming technique for main memory allocation, Operating system divides the main memory in two partitions.

48. SUBSP 6,i

pushes 6 bytes onto the stack

49. Latency is the time it takes the block to reach the head once the head is in place.

50. Large application programs are always loaded in the Virtual memory.

Explanation / Answer

Solution:

8) True, assembler directives are also called pseudo-op codes.

9) False, There is no such algorithm as Last In First Out (LIFO), if there would be it wouldn,t have been of any use because there is no significance of using cache at the first place if you are popping out the last in memory address.

12) True, It deallocates the local variables.

13) True.

16) True

17) False

21) True

24) True

I hope this helps. Don't forget to give a thumbs up if you like this.