티스토리 뷰
목차
컴퓨터구조 연습문제 해답 [모리스 마노 6 챕터]
[모리스마노] 컴퓨터구조 연습문제 33p
6-3. A more efficient compiler will optimige the machine code as follows.
[모리스마노] 컴퓨터구조 연습문제 34p
6-4. A line of code such as : LDA I is interpreted by the assembler(Fig, 6-2). as a two symbol field with I as the symbolic address.
A line of code such as : LDA I I is interpreted as a three symbol field. The first I is an address symbol and the second I as the Indirect bit.
Answer : yes, it can be used for this assembler.
6-5. The assembler will not detect an 《ORG or END》 if the Fig 6-1. Such a label has no meaning and constitutes an error. To detect the error, modify the flow chart of Fig. 6-1.
[모리스마노] 컴퓨터구조 연습문제 35p
[모리스마노] 컴퓨터구조 연습문제 36p
6-12 (a). The program counts the number of I'5 in the number stored in location WRD. Since WRD=(62C1)16 = (0110 0010 1100 0001)2 number of I'S is 6; so CTR will have
[모리스마노] 컴퓨터구조 연습문제 37p
[모리스마노] 컴퓨터구조 연습문제 38p
6-15. The first time the program is executed, location CTR will go to 0. If the program is executed again starting from location (100) 16. location CTR will be incremented and will not reach 0 until it is incremented 2 16 = 65,536 times, at which time it will reach 0 again.
We need to initialige CTR and P as follows.
[모리스마노] 컴퓨터구조 연습문제 39p
[모리스마노] 컴퓨터구조 연습문제 40p
[모리스마노] 컴퓨터구조 연습문제 41p
[모리스마노] 컴퓨터구조 연습문제 42p
[모리스마노] 컴퓨터구조 연습문제 43p
컴퓨터구조 연습문제 해답 [모리스 마노 6 챕터]