Computer Architecture I
A.Y. 2019/2020
Learning objectives
The course aims at introducing basic concepts of hardware and firmware architectures of computing systems, starting from digital circuit fundamentals up to the description of behavior and structure of the main parts of a computing system and its programming in machine language.
Expected learning outcomes
Students are expected to master information encoding techniques, Boolean algebra, and key notions of logic circuits. They will have to demonstrate understanding of role and behavior of basic elements related to structure and functioning of a computer. Students will have also to be able to translate simple algorithms into the machine language of the reference processor adopted in the course.
Lesson period: Second semester
Assessment methods: Esame
Assessment result: voto verbalizzato in trentesimi
Single course
This course cannot be attended as a single course. Please check our list of single courses to find the ones available for enrolment.
Course syllabus and organization
Single session
Responsible
Lesson period
Second semester
Course syllabus
The course program consists of two parts: the first part introduces key concepts related to information coding and circuit design; the second part introduces the architectural aspects and the characteristics - hardware and software - of a specific processor.
The main topics are:
- Information coding: natural numbers, relative numbers, real numbers, character and strings
- Digital circuits: Boolean algebra, combinational circuits, basic sequential circuits
- Introduction to architectural concepts and to the MIPS processor
- MIPS Assembly: instructions, Assembly constructs vs. constructs defined at high abstraction level
- Assembly programming through exercises
- Hardware implementation of the MIPS architecture: relationship between the Assembly constructs and hardware.
- Introductory notions on memory hierarchy
The main topics are:
- Information coding: natural numbers, relative numbers, real numbers, character and strings
- Digital circuits: Boolean algebra, combinational circuits, basic sequential circuits
- Introduction to architectural concepts and to the MIPS processor
- MIPS Assembly: instructions, Assembly constructs vs. constructs defined at high abstraction level
- Assembly programming through exercises
- Hardware implementation of the MIPS architecture: relationship between the Assembly constructs and hardware.
- Introductory notions on memory hierarchy
Teaching methods
Traditional lectures. A subset of lectures will focus exclusively on exercises.
Teaching Resources
https://mdamianiae.ariel.ctu.unimi.it/v5/home/Default.aspx
Bibliography:
Part 1 : M. Morris Mano, C.R. Kime, Reti logiche, Pearson (
Part 2 : D.A. Patterson, J.L. Hennessy, Struttura e Progetto dei Calcolatori, Zanichelli
Bibliography:
Part 1 : M. Morris Mano, C.R. Kime, Reti logiche, Pearson (
Part 2 : D.A. Patterson, J.L. Hennessy, Struttura e Progetto dei Calcolatori, Zanichelli
Assessment methods and Criteria
The examination consists of a written test on the topics of the course. The test consists of a set of exercises and, possibly, open questions. The student cannot use books, notes and any other material during the test.
A written test "in itinere" will be organized during the course, to allow students passing this (optional) test, to register the score in advance. The test is split in two parts: the first part of the test will be assigned in the middle of the course; the second part, at the end of the course. The students reporting a sufficient score in the first part are admitted to the second part of the test . The final score is expressed in thirtieths and is computed as average of the partial scores. During the test the students can bring at most 1 (one) sheet of notes.
A written test "in itinere" will be organized during the course, to allow students passing this (optional) test, to register the score in advance. The test is split in two parts: the first part of the test will be assigned in the middle of the course; the second part, at the end of the course. The students reporting a sufficient score in the first part are admitted to the second part of the test . The final score is expressed in thirtieths and is computed as average of the partial scores. During the test the students can bring at most 1 (one) sheet of notes.
INF/01 - INFORMATICS - University credits: 6
Lessons: 48 hours
Professor:
Damiani Maria Luisa
Shifts:
-
Professor:
Damiani Maria LuisaProfessor(s)