Computer Architecture and Lab F - NModule LAB
Academic Year 2024/2025 - Teacher: GABRIELLA VERGAExpected Learning Outcomes
Knowledge and understanding: To acquire knowledge and understanding of fundamental concepts of computer systems architecture and of methodological principles that drive its development, in the historical perspective of their evolution.
Applying knowledge and understanding: To acquire problem solving capabilities in computer system design, by trying to solve on-purpose proposed problems, and abilities to make use of, to design and to implement software tools, such as simulators and interpreters, for abstract machines at the lowest levels of computer system organization.
Making judgements: To be able to compare and evaluate the quality of solutions to design problems for computer systems.
Communication skills: To acquire communication skills and proper language to communicate, even with nonexpert people, about problems relating to functioning, design, implementation, and evaluation of computer systems.
Learning skills: To develop the ability to adapt one's own knowledge to the rapid evolution of the discipline and to keep up-to-date through specialized sources in the field.
Course Structure
The material shown during the lesson is available in the Teams channel Architetture degli elaboratori (Canale FN) accessible with the code: yebt84n.
The material projected during the lesson is available in the telegram channel accessible at the following link: https://t.me/architetturaFN.
Required Prerequisites
Attendance of Lessons
Detailed Course Content
- Exercises on binary system and binary data representation
- Exercises on analysis and synthesis of logical functions
- Exercises on sequential circuits
- Exercises in assembly (scalar product and minimum search)
- Exercises in assembly (subroutine call)
- Exercises on RISC microarchitectures
- Exercises on pipelining
- Exercises on I/O interfaces
- Exercises on arithmetic circuits
Textbook Information
Course Planning
| Subjects | Text References | |
|---|---|---|
| 1 | Exercises on binary system and binary data representation | Chapter 1 (1.4-1.5) |
| 2 | Exercises on analysis and synthesis of logical functions | Appendix A (A.1-A4) |
| 3 | Exercises on sequential circuits | Appendix A (A.5-A.10) |
| 4 | Exercises in assembly (scalar product and minimum search) | Chapter 2 (2.1-2.5, 2.11, App 2.1-2.2(ARM)) |
| 5 | Exercises in assembly (subroutine call) | Chapter 2 (2.6-2.10, 2.12-2.13 App 2.3-2.4(ARM)) |
| 6 | Exercises on RISC microarchitectures | Chapter 5 |
| 7 | Exercises on pipelining | Chapter 6 |
| 8 | Exercises on I/O interfaces | Chapter 7 |
| 9 | Exercises on arithmetic circuits | Chapter 9 (9.1-9.4, 9.6-9.8) |
Learning Assessment
Learning Assessment Procedures
The test is structured so that each student is given a grade according to the following scheme:
- Not approved: the student has not acquired the basic concepts and is unable to answer at least 60% of the questions or complete the exercises.
- 18-23: the student demonstrates a minimal mastery of the basic concepts, his/her ability to connect the contents is modest, he/she is able to solve simple exercises.
- 24-27: the student demonstrates a good mastery of the course contents, his/her ability to connect the contents is good, he/she solves the exercises with few errors.
- 28-30 cum laude: the student has acquired all the contents of the course and is able to fully master them and connect them with a critical spirit; he/she solves the exercises completely and without errors.
Examples of frequently asked questions and / or exercises
Convert from binary to decimal and vice versa
Logic gates and their truth tables
Instructions in Assembly and Assembly programs
Data path for program execution