This document contains tutorials and problems on computer architecture concepts. It discusses storing ASCII characters in memory using big-endian and little-endian schemes, condition codes after adding 2's complement numbers, and techniques for saving return addresses that support subroutine nesting and recursion.
This document contains tutorials and problems on computer architecture concepts. It discusses storing ASCII characters in memory using big-endian and little-endian schemes, condition codes after adding 2's complement numbers, and techniques for saving return addresses that support subroutine nesting and recursion.
This document contains tutorials and problems on computer architecture concepts. It discusses storing ASCII characters in memory using big-endian and little-endian schemes, condition codes after adding 2's complement numbers, and techniques for saving return addresses that support subroutine nesting and recursion.
and following big-endian scheme. A program reads ASCII characters “Johnson” through keyboard and stores them at word location 1000 and 1004.find the binary data stored in the memory locations from 1000 to 1008 • 2.6 repeat the same for little-endian scheme. Problem on condition codes Find the status of Condition codes N,Z, V and C when the following 2s complement signed numbers are added (note: 8 bits are used to store the operands and result) 1) 0XCA and 0X23 2) 0XFF and 0x01 3) 0x78 and 0x 65 4) 0X89 and 0XA2 TPS activity Consider the following possibilities for saving the return address of a subroutine a)in a processor register b)in a memory location associated with the call, so that a different location is used when the subroutine is called from different places. c)on a stack Which of these possibilities supports subroutine nesting and which supports subroutine recursion Solution for TPS activity • a) neither supports nesting nor recursion. • b)supports nesting but not recursion. • c)supports both nesting and recursion.