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 |