CS 201, Spring 2005
This is the webpage for CmpSci 201,
Introduction to computer organization and ARM assembly programming.
Instructor: Trek Palmer
Office: CmpSci Building Rm. 354
Office Hours: MF, 10-11 and by appointment
email: trekp@cs.umass.edu

A Note on usage: Feel free to read, print, make hats out of, etc. these notes and labs, but I ask that you credit me with their creation (it is, after all, the nice thing to do). Please respect the licensing of the rolecks system as well. Course Syllabus

Lecture Notes

Lecture		Reading
Lecture 1		Chapter 1
Lecture 2		Chapter 2.1
Lecture 3		Chapter 2.1
Lecture 4		Chapter 2.4, 3.1-3.4
Lecture 5		Chapter 2.4, 3.1-3.4
Lecture 6		Chapter 2.2
Lecture 7		Chapter 2.5
Lecture 8		Chapter 4.1, 4.2
Lecture 9		Chapter 3.6
Lecture 10
Lecture 11
Lecture 14		Chapter 6.7
Lecture 15		Chapter 6.7
Lecture 16
Lecture 17		Appendix A.1, A.2, Chapter 6.1
Lecture 18		Appendix A.6, Chapter 6.2.1
Lecture 19		Appendix A.7, A.9, A.10
Lecture 20		Appendix A.8, A.13
Lecture 21		Chapter 4.4, 4.5
Lecture 22		Chapter 4.5, 5.1, 5.2
Lecture 23		Chapter 5.2, 5.3, 4.2.5, 4.2.6, 4.3.1
Lecture 24		Chapter 7.1-7.2
Lecture 25		Chapter 7.3-7.5.1, 8.1
Lecture 26
Lecture 27
Lecture 28		Chapter 5.5
Lecture 29a(PDF)		Chapter 5.5
Lecture 29b		Chapter 5.9
Lecture 30
Lecture 31
Lecture 32
Lecture 33

Homework Assignments

Homework assignments will be posted on this web page. Homework will be handed in at the beginning of class on the due date specified. Please print clearly, and if possible type up your answers. Illegible answers will be marked wrong.

Homework 1 (PDF) due Feb 2, 2005
- Clarification: For question 2, it should be noted that the mov instruction only copies the value from one register to another. It does NOT erase the value in the old register.
Homework 2 (PDF) due Feb 9, 2005
- Clarification: For questions 1-3, assume the numbers are unsigned
Homework 3 (PDF) due Feb 16, 2005
- Clarification: For the last question, please note that the values are ALREADY loaded into the registers, you do not have to load them yourself. To mask out the bits use Logical/Arithmetic operations and shifting (if necessary).
Homework 4 (PDF) due Mar 2, 2005
Homework 5 (PDF) due Mar 9, 2005
Homework 6 (PDF) due Mar 23, 2005
- Additional assignment: Have FUN over Spring Break. That's what it's for!
Homework 7 (PDF) due Mar 30, 2005
Homework 8 (PDF) due April 6, 2005
Homework 9 (PDF) due April 13, 2005
Homework 10 (PDF) due April 20, 2005
Homework 11 (PDF) due May 4, 2005

Labs

The labs will be conducted in the edlab, which is on the second floor of the Lederle Tower (LGRT 223). edlab accounts for cs201 students are being created and should (hopefully) be ready by wednesday (Feb. 2).

Lab 1 (PDF) due Feb 4, 2005
Source code for lab 1
- Clarification: Write your id number in as decimal. That is you should put #IDNUMBER, where IDNUMBER is the 8-digit number on your student ID.
Lab 2 (PDF) due Feb 11, 2005
Lab 3 (PDF) due Feb 18, 2005
- Make sure you get the latest version of Rolecks
- In order to load the address of a symbol into a register use the ADR instruction. For instance: ADR R1, foo ; loads the address of foo into R1
- In the last question, the string is 0-indexed
Lab 4(PDF) due Feb 25, 2005
Lab 5(PDF) due Mar 4, 2005
Lab 6(PDF) due Mar 11, 2005
Lab 7(PDF) due Mar 25, 2005
Lab 8(PDF) due April 1, 2005
Lab 9(PDF) due April 15, 2005
Lab 10(PDF) due April 22, 2005
Lab 11(PDF) due May 6, 2005
- Note that you have two weeks to do this lab. It's roughly twice as much work as the other labs, so don't slack off.

Rolecks ARM Simulator

Rolecks is a graphical ARM simulator, implemented in Java. There is also a command-line interface version (not distributed here). Rolecks is GPL-ed and is the creation of Trek Palmer and Tim Richards (currently Cmp Sci grad students at UMass Amherst).
The Rolecks System (JAR)(April 6)
An ARM Reference Sheet (PDF)

Projects

Project 1 Description Due Feb 18th, 2005
Project 2 Description Due Mar 11th, 2005
- Code for determining "squareness"
- Make sure to get the latest version of rolecks. There was a bug involving right shifting by quantities stored in registers.
Project 3 Description Due April 11th, 2005
Project 4 Description Due May 19th, 2005 (this is the Thursday of finals week, not the friday!)
- Start this project AS EARLY AS YOU CAN!!!! It is by far the most difficult assignment you'll get. Start early, ask lots of questions, and you should do fine.

Messages/Announcements

Thursday lab, Jan 27 is cancelled
The schedule and SPIRE have the lab sections in the wrong room. The labs will be in LGRT 223 (the edlab).
The schedule in the syllabus is only approximate. Actual due dates will appear next to the assignments when posted to this page.
The first midterm will be this Friday. To study, review the homework, lecture notes, and labs. Be sure you know:
- binary, hexadecimal and how to convert between them and decimal
- binary arithmetic (addition and subtraction)
- 1's and 2's complement (and how to use them)
- Logical and shifting operations
- Basic memory organization and alignment
- Basic computer organization and the fetch-decode-execute cycle
The second midterm will be next friday (April 8). Be sure you know:
- Functions and the Stack
- Floating point representation
- Dynamic and Static data (and the difference between them)
- Boolean logic and gates
- Timing diagrams and state diagrams
- Bus organization
- Memory organization
Next Thursday is (in Umass-land) a logical Monday, but I'm cancelling class, so sleep in.
The registrars have decided to continue their punishment of CS201 by scheduling the final to be at 4PM this Saturday (5/14) in Goessman 51 (on the ground floor). The final will be comprehensive but more heavily weighted towards the second half of the semester.
Stuff to know for the final:
- Binary, Hex, Octal how to convert between them and how to convert between them and decimal.
- Binary arithmetic
- Logic ops and shifting
- Boolean logic (both symbolic and gate-based)
- Simple sequential circuits (flip-flop based)
- Floating point
- The STACK! Really know the stack. PLEASE PLEASE PLEASE.
- Pipelines
- Sequential Execution
- Cache concepts
- Virtual Memory
- Binary Formats
- ARM programming