In order to understand the operation mechanism of the CPU, do programming by using the assembly language and learn while running
it with a simulator. By using assembly language of the MIPS architecture, programming is done with a wide range of exercises
as subject matter. Furthermore, how the data in registers and memories inside the CPU changes will be visually grasped while
operating the simulator.
Do programming by using assembly language and understand how information processing is done in CPU while running with simulator.
- Being able to program using MIPS assembly language
- Being able to understand the contents of registers and memories on the way of execution
- Being able to understand and make use of the concept of effective address, array and stack
| Class schedule | HW assignments (Including preparation and review of the class.) | Amount of Time Required | |
|---|---|---|---|
| 1. | Assembly language and programming, how to use the simulator, add / subtract instructions using registers | Check the syllabus. Self Check the contents of the relevant part of the text. | 60minutes |
| Review the content of the lecture and solve the example and exercise being done during the class again. | 130minutes | ||
| 2. | Multiply instructions, division instructions and special registers | Self Check the contents of the relevant part of the text. | 60minutes |
| Review the content of the lecture and solve the example and exercise being done during the class again. | 130minutes | ||
| 3. | Data alignment in memory, load instructions and store instructions | Self Check the contents of the relevant part of the text. | 60minutes |
| Review the content of the lecture and solve the example and exercise being done during the class again. | 130minutes | ||
| 4. | Logical operation instructions (AND, OR, XOR) | Self Check the contents of the relevant part of the text. | 60minutes |
| Review the content of the lecture and solve the example and exercise being done during the class again. | 130minutes | ||
| 5. | Shift operation instructions | Self Check the contents of the relevant part of the text. | 60minutes |
| Review the content of the lecture and solve the example and exercise being done during the class again. | 130minutes | ||
| 6. | Comparative operation instruction and branch instruction | Self Check the contents of the relevant part of the text. | 60minutes |
| Review the content of the lecture and solve the example and exercise being done during the class again. | 130minutes | ||
| 7. | Address modification, array and its manipulation, system call and displaying characters | Self Check the contents of the relevant part of the text. | 60minutes |
| Review the content of the lecture and solve the example and exercise being done during the class again. | 130minutes | ||
| 8. | Input instruction and character processing | Self Check the contents of the relevant part of the text. | 60minutes |
| Review the content of the lecture and solve the example and exercise being done during the class again. | 130minutes | ||
| 9. | Stack, stack pointer, PUSH and POP, calling and restoring subprograms | Self Check the contents of the relevant part of the text. | 60minutes |
| Review the content of the lecture and solve the example and exercise being done during the class again. | 130minutes | ||
| 10. | Recursive processing | Self Check the contents of the relevant part of the text. | 60minutes |
| Review the content of the lecture and solve the example and exercise being done during the class again. | 130minutes | ||
| 11. | Sorting algorithms and assembly program | Self Check the contents of the relevant part of the text. | 60minutes |
| Review the content of the lecture and solve the example and exercise being done during the class again. | 130minutes | ||
| 12. | Linked list and assembly program | Self Check the contents of the relevant part of the text. | 60minutes |
| Review the content of the lecture and solve the example and exercise being done during the class again. | 130minutes | ||
| 13. | List processing in assembly program, binary tree and queue structure | Self Check the contents of the relevant part of the text. | 60minutes |
| Review the content of the lecture and solve the example and exercise being done during the class again. | 130minutes | ||
| 14. | Final exam and review | Self Check the contents of the relevant part of the text and lectures. | 60minutes |
| Review and solve the example and the exercise being done during class. | 130minutes | ||
| Total. | - | - | 2660minutes |
| Review tests during class | Assignments | Final exam | Total. | |
|---|---|---|---|---|
| 1. | 30% | 25% | 45% | 100% |
| 2. | 0% | |||
| 3. | 0% | |||
| Total. | 30% | 25% | 45% | - |
- In the review tests during the class and the final exams, if a student can surely solve the example in the text: 80%
- In the exercises, if a student can create a program based on the understanding of the contents explained in the lesson: 80%
- In the exercises, if a student can create a program based on the understanding of the contents explained in the lesson: 80%
- Course that cultivates an ability for utilizing knowledge
| Work experience | Work experience and relevance to the course content if applicable |
|---|---|
| Applicable | About 20 years of work experience at Toshiba, where he was actually involved in the design of CPU chips. |
- 4.QUALITY EDUCATION
- 9.INDUSTRY, INNOVATION AND INFRASTRUCTURE
Last modified : Thu Sep 23 04:05:52 JST 2021