14. (3 pts) expressions from infix to reverse Polish (postfix) notation. 15. (3

Question

14. (3 pts) expressions from infix to reverse Polish (postfix) notation. 15. (3 pts) Convert the following expressions from reverse Polish notation to infix notatiorn 12. (6 pts) we have the instruction Add 600. Given memory and register R1 contain the values below: Address 100 400 500 600 700 0500 1200 2300 0400 2345 R1 100 Assuming R1 is implied in the indexed addressing mode, determine the actual value loaded Mode Immediate Value Loaded into AC Direct Indirect Indexed (15 pts) A computer using direct mapped cache has 232 cache of 1024 blocks. Each block contains 32 words. 3. words of main memory and a a. (5 pts) How blocks of main memory are there? b. (5 pts) What are the sizes of the tag, block, and word fields in a cache address?

Explanation / Answer

Ans 14:

C*Y - W*Z*(C-D) into postifix => CY*WZ*CD-*-

as first C*Y is evaluated then W*Z then C-D then product of W*Z and C-D , this product is multiplied and C*Y - W*Z*(C-D) is evaluated

-----------------------------------------------

Ans 15:

Postfix => CY- Z+ V*WZO--* in infix => ((C-Y) + Z)*V*(W-(Z-O))

First C-Y is evaluted then C-Y is added to Z and then multipled by V

first Z - O is evaluated and then W - (Z-O)

then (W-(Z-O)) is multiplied by ((C-Y) + Z)*V

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

---

---

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