create new tag
view all tags
Welcome to the COMPUTER ARCHITECTURE (unit 1) webpage!
Prof. DanieleGorla

phone: 06-4991 8434

office: Via Salaria 113 - 3rd Floor, room 310

email: gorla@diNOSPAM.uniroma1.it (delete NOSPAM)

  • Tuesday: 8.30am - 10.45am (Zoom Meeting ID: 959 1074 4688)
  • Friday: 2pm - 3.30pm (Zoom Meeting ID: 922 2820 5143)
Aula Bandinelli (Via Antonio Scarpa 16)

The students should have received the pwd for accessing the Zoom meets at their institutional email (@studenti.uniroma1.it).

Important News
  • The first class will be Tue, Oct. 6th, 2020 IN AULA BLU3 (CU028): This room will be used for the first THREE weeks (until oct.23rd)!

Topics presented in the Course

The overall program of the course is the following:

  • Introduction to the organization of a computer: historical evolution and main components

  • Information representation. Codes, numeration systems, the binary/octal/hexadecimal codes. Representation in base complement. Representation in fixed and floating point, the standards IEEE. Some other codes: ASCII, Unicode, error-correcting codes.

  • Boolean algebra. Axioms and derived laws, duality principle. Variables and boolean expressions, equivalent expressions. Boolean functions of one and two variables. Main logic gates: NOT, AND and OR. Truth tables. Combinatorial nets. Relation between combinatorial nets and boolean expressions. Canonical and normal forms: SOP and POS. NAND and NOR gates, their universality. XOR/XNOR gates and their properties.

  • Analysis and synthesis of a combinatorial net. Minimization of SOP/POS boolean expressions: Karnaugh maps. Boolean function with “don't care” conditions and their minimization.

  • MSI Combinatorial modules: coder, decoder, ROM, PLA, multiplexer, demultiplexer. Half-Adder and Full-Adder for adding natural numbers. Comparator of binary numbers.

  • Sequential nets: memorization and feedback: Latch SR, D (delay), JK, T; gated latch; flip-flop master-slave. Finite automata with output: Mealy vs Moore; representation with diagrams and tables. Temporal diagram. Automata equivalence, transformation from one model to the other. Automata minimization.

  • Analysis and synthesis of sequential nets. Counters modulo 2**n, reverse counter, bidirectional (up-down counter) counters, counters modulo k (with k different from 2**n); settable counters.

  • Registers. All combinations of serial/parallel input/output; shifters, circular registers.

  • Register interconnection: 4 modalities (all combinations among fixed/variable source/destination).

Text books

[MM] M. Morris Mano, M. D. Ciletti: Digital design, 4th edition. Pearson/Prentice Hall.

[K] A. F. Kana: Digital Logic Design. (Available online)

Exam rules

The exam is made up by a written part and an oral one.

Rules for the written exam:

  • You canNOT use any material (book, notes, exercises with solutions, ...)
  • You MUST have an official ID document with a recent photo
  • You must have your own sheets for the drafts of your exercises and all what you need for writing (pens, pencils, eraser, sharpener, etc.)
  • You canNOT use any calculator
  • Mobile phones and tablets MUST be switched off all the time
  • You canNOT leave the room during the exam
  • You MUST book the exam on Infostud in advance (usually, the week before). If you have not booked the exam, you will not be allowed to enter. REMARK: you must book EVERY TIME you come for a written exam!

Date and time of every written exam are timely published in the Bachelor Degree webpage, under the "Exams" tab.

The oral exam must be done just after the written exam (usually, the week after). The exact dates for the oral exams are communicated together with the results of the written exam a few days after the written exam. REMARK: a fully negative oral exam can also lead to cancel the written exam (that has to be done again).

Class diary

Here you can find all topics, class-by-class, together with slides and references on the text books

Class, October 6th, 2020 Overall introduction to the course. Historical evolution of computers. Representation of information, definition of code and its requirements; Definition and properties of positional numeric systems, the binary code. Changing base for natural numbers: from base 10 to base b, from base b to base 10; representation interval in base b with a fixed number of digits; octal and hexadecimal systems ([MM] 1.1, 1.2, 1.3, 1.4; [K] pgg. 1-5).

Slides 1 - Slides 2

Class, October 9th, 2020 Arithmetic operations on naturals.

Slides 3

Exercises, October 9th, 2020 Converting natural numbers from base 10 to binary, octal, hexadecimal and other bases, and vice versa.

Exercises on Naturals

Class, October 13th, 2020 Representing integers in two’s complement: representation interval, how to find the opposite of a given number. Sum and subtraction in two’s complement ([MM] 1.5, 1.6; [K] pgg. 6-9).

Slides 4

Exercises, October 13th, 2020 Operations on naturals in bases different from 10.

Exercises on operations among naturals

Class, October 16th, 2020 Converting rational numbers in fixed point: from binary to decimal, and vice versa ([MM] 1.3). Floating point representation: representation intervals and Standard IEEE ([K] pgg. 10-12).

Slides 5

Class, October 20th, 2020 Operations in floating point representation.

Slides 6

Exercises, October 20th, 2020 Operations on integers. Fixed and floating point representation of rationals.

Exercises on integres - Esercises on rationals

Class, October 23rd, 2020 ASCII Code ([MM] 1.7, [K] pg. 14-16) and UNICODE ( wikipedia page). Basic notions on error-correcting codes: parity bit; longitudinal and vertical parity (https://www.geeksforgeeks.org/error-detection-in-computer-networks/); Haming Code 4-3 (https://www.tutorialspoint.com/digital_circuits/digital_circuits_error_detection_correction_codes.htm).

Slides 7

Exercises, October 23rd, 2020 Sum, subtraction and multiplication in floating point.

Exercises on operations on floating point numbers

Class, October, 27th, 2020 Definition of Boolean algebra. Derived properties: involution, idempotency, annihilator, absorption, De Morgan ([MM] 2.1--2.4; [K] pgg.23--26 || REMARK: in these texts they use a different set of axioms for defining boolean algebra). Boolean variables and expressions. Dual and complementary expressions. Equivalence among expressions. Boolean functions with 1, 2 or more variables; truth tables. Logic gates ([MM] 1.9, 2.5, 2.7, 2.8; [K] pgg.17--19, 31). NAND, NOR and their universality; XOR and XNOR ([MM] 3.7, 3.9; [K] pgg.19--23, 47-54).

Slides 8 - Slides 9

Exercises, October 27th, 2020 Exercises on error-correcting codes

Exercises on Error-correcting Codes

Topic attachments
I Attachment History Action Size Date Who Comment
PDFpdf 01-intro.pdf r1 manage 2797.0 K 2020-09-17 - 16:54 DanieleGorla  
PDFpdf 02-representing-naturals.pdf r1 manage 795.3 K 2020-09-17 - 16:56 DanieleGorla  
PDFpdf 03-operations-on-naturals.pdf r1 manage 246.1 K 2020-09-17 - 16:59 DanieleGorla  
PDFpdf 04-integers.pdf r1 manage 425.9 K 2020-09-17 - 17:00 DanieleGorla  
PDFpdf 05-rationals.pdf r1 manage 655.0 K 2020-10-15 - 16:14 DanieleGorla  
PDFpdf 06-operations-in-floating-point.pdf r1 manage 375.2 K 2020-10-20 - 12:09 DanieleGorla  
PDFpdf 07-other-codes.pdf r1 manage 1034.7 K 2020-10-03 - 09:47 DanieleGorla  
PDFpdf 08-boole.pdf r1 manage 520.8 K 2020-09-17 - 17:42 DanieleGorla  
PDFpdf 09-boolean-expressions-and-operators.pdf r1 manage 903.8 K 2020-09-17 - 17:42 DanieleGorla  
PDFpdf 10-Normal-and-Canonical-Forms.pdf r1 manage 1245.8 K 2020-09-18 - 17:06 DanieleGorla  
PDFpdf 11-Minimizing-Boolean-expressions.pdf r1 manage 716.5 K 2020-09-22 - 13:37 DanieleGorla  
PDFpdf 12-combinatorial-nets-analysis-and-synthesis.pdf r1 manage 748.5 K 2020-10-20 - 13:52 DanieleGorla  
PDFpdf exercises-class-10.pdf r2 r1 manage 49.1 K 2020-09-22 - 14:09 DanieleGorla  
PDFpdf exercises-class-11.pdf r1 manage 281.1 K 2020-09-23 - 10:08 DanieleGorla  
PDFpdf exercises-class-12.pdf r1 manage 226.4 K 2020-10-20 - 13:52 DanieleGorla  
PDFpdf exercises-class-2.pdf r1 manage 33.5 K 2020-09-17 - 17:09 DanieleGorla  
PDFpdf exercises-class-3.pdf r1 manage 40.7 K 2020-09-17 - 17:09 DanieleGorla  
PDFpdf exercises-class-4.pdf r1 manage 47.0 K 2020-09-17 - 17:09 DanieleGorla  
PDFpdf exercises-class-5.pdf r1 manage 76.1 K 2020-09-17 - 17:09 DanieleGorla  
PDFpdf exercises-class-6.pdf r1 manage 70.3 K 2020-09-17 - 17:09 DanieleGorla  
PDFpdf exercises-class-7.pdf r1 manage 81.2 K 2020-10-03 - 09:58 DanieleGorla  
PDFpdf exercises-class-8.pdf r1 manage 38.6 K 2020-09-18 - 17:06 DanieleGorla  
PDFpdf exercises-class-9.pdf r1 manage 52.5 K 2020-09-18 - 17:06 DanieleGorla  
Edit | Attach | Watch | Print version | History: r27 < r26 < r25 < r24 < r23 | Backlinks | Raw View | Raw edit | More topic actions
Topic revision: r27 - 2020-10-24 - DanieleGorla

Questo sito usa cookies, usandolo ne accettate la presenza. (CookiePolicy)
Torna al Dipartimento di Informatica
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2020 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback