Department of Computing Science
CMPUT 229: Computer Organization and Architecture I
Fall 2001-2002, Section A1

Section A1's On-Line Lecture Notes (Draft Version available on September 6)

Section A1's On-Line Marks Posting (none yet) Check your most recent CS Marks Directly

Schedule of Lab Sections and TAs

Calendar Description

Prerequisite: CMPUT 115 ; Co-requisite: CMPUT 201

Textbooks

1. Computer Organization and Design: The Hardware/Software Interface, Second Edition, by David A. Patterson and John L. Hennessy, Morgan Kaufmann Publishers, 1997
   An on-line version of Appendix A (Assemblers, Linkers, and the SPIM simulator) is available.
2. Introduction to RISC Assembly Language Programming, by John Waldron, Addison-Wesley, 1999.

Course Outline

This outline is subject to change.

1. Introduction (Chapter 1)
   • Program translation (1.2, A.1)
   • Microprocessor (1.3)
   • Course objectives
2. Number Systems and Binary Arithmetics (Chapter 4)
   • Decimal, binary, hexadecimal, numbers (4.2)
   • Signed numbers (4.2)
   • Binary addition and subtraction (4.3)
   • Logical operations (4.4)
3. The Processor and Datapath (Chapter 5) *
   • Registers, ALU, and multiplexer (5.1); PC and memory (5.2); simple datapath (5.3); and control unit(5.3)
4. Assembly Language (Chapter 3)
   • Introduction to MIPS machine (p. 141)
   • Assembly instructions (3.1, 3.2, 3.3)
   • Addressing modes (3.8)
   • Encoding assembly instructions (3.4)
   • Branching (3.5)
   • Procedures/subroutines (3.6)
   • Compiling, assembling, linking, and loading (3.9)
   • Applications: procedures (3.10) and arrays/pointers (3.11)
5. Exceptions and Interrupts (Chapter 5)
   • Exceptions (5.6)
   • Exception handling (A.7)
   • Interrupts and Interrupt handling(A.7)
6. Input/Output Programming (Chapter 8)
   • Introduction (8.1, 8.2, 8.3)
   • I/O interfacing (8.5)
   • I/O on MIPS (A.8)
   • Polled and interrupt-driven I/O (A.7)
7. Memory Hierarchy (Chapter 7)
   • Locality, memory hierarchy, and cache (7.1)
   • Direct mapped cache (7.2)
   • Set associative cache (7.3)
8. Floating Point Numbers (Chapter 4)
   • Floating point (4.8)

Marking Scheme

Assignment Schedule

Notes

1. Students must work on their homeworks and assignments independently. There is to be no group work or collaboration on any homeworks and assignments. Make sure you understand and follow the Code of Student Behavior, especially the section on Academic Offences.

   Identical or almost identical programs from separate students are considered evidence of plagiarism, and these cases will be subject to disciplinary actions by the Associate Chair, the Faculty of Science, or the University.

   In the past, a number of cases of plagiarism have been detected and have resulted in severe penalties. See http://www.cs.ualberta.ca/programs/undergraduate/plagiarism.html for some statistics. NOTE: Even though CMPUT 229 is not listed on that page, there were two students who were caught and received a 1F in my course last year.

2. All lab sessions have fixed schedules and are held in the Network & Machine Architecture Instructional Laboratory in CSC 167 (first floor of the new Computer Science building).
3. There are no scheduled make-up sessions for the two Monday holidays, October 8 (Thanksgiving) and November 11 to 13 (Remembrance Day and Fall-Term Class Break ). During those weeks, students who are affected by the holidays can go to other lab sections for help from the TA.
4. Your code must be properly commented with a standard header, block comments at the beginning of each functional block, and in-line comments after every instruction. Refer to the course homepage for an example of properly documented programs.
5. A laboratory assignment is to be submitted electronically before 9:00 PM of the Friday when it is due. You will be given detailed instructions on how to submit electronically. No late submissions are accepted.
6. Homework assignment is due in class, at the beginning of class!. No late submissions are accepted.