Objectives | Staff&Contact Information | Where&When | Textbook | Grading | Policies | Schedule&Assignments
What this course is about
The goal of CS 2011 is to provide students with
knowledge about the structure and behavior of digital
computers at several levels of abstraction, and to give
students experience in solving problems using an assembly
language. Recommended background and course topics are listed
WPI undergraduate catalog course description
Instructor: Glynis Hamel (GH)
Teaching Assistant: Medhabi Ray (MR)
Senior Assistant: Eric Walston (EW)
|Monday||GH (FL 132)||MR(FL A22)||EW (FL A22)||EW(FL A22)|
|Tuesday||GH (FL 132)|
|Wednesday||MR(FL A22)||MR(FL A22)||EW(FL A22)|
|Friday||EW(FL A22)||GH (FL 132)|
If you have a question regarding your grades in the course, please send email to cs2011-staff *at* cs.wpi.edu. Mail sent to this address goes to the instructor and to the TAs. Include your section number in all correspondence.
The instructor's email address is ghamel *at* cs.wpi.edu. Please restrict your use of my personal email address to issues of a confidential nature. You will get a quicker response if you post your questions to the class discussion board.
|B01||9 - 9:50am||KH 202|
The first lab is scheduled for Wednesday, November 10 (there are no labs on Oct 27 and Nov 3).
Textbook, Software, and Authors' Website
Textbook (required): Patt, Yale N., and Sanjay J. Patel, Introduction to Computing Systems: From
Bits & Gates to C & Beyond,
2nd edition, McGraw-Hill Publishers, 2003. A copy of the textbook is on
reserve at the library. If you buy a used textbook, make sure you buy
the 2nd edition.
(recommended) Tanenbaum, Andrew S., Structured Computer Organization 5/e, Pearson, 2006. Also on reserve at the library.
Software: We will be using the LC-3 simulator, which can be downloaded from the authors' website.
Exams are closed-book, closed-notes. You may bring in one sheet of notes (one paper, 8.5" x 11.5", both sides) to each exam. You may not use any computers, calculators, cellphones, or other electronic devices during the exams.
There are no makeups for exams. Absence from an exam will be excused only for medical or emergency reasons. A note from your doctor or from the Office of Academic Advising will be required. In such cases your final grade will be recorded as Incomplete and you will be allowed to take a makeup exam the next time the course is offered.
Several times during the term we will take a few minutes of class time for in-class group work. This will consist of one or two questions related to recently-covered lecture material or homework problems. Each assignment will be graded as either credit (1) or no credit (0). At the end of the term, five of these assignments will be chosen at random by the instructor, and these will count as 5% of your final grade. There are no makeups for in-class assignments.
If you receive general help from another student or an outside source, that student or source must be acknowledged in the documentation accompanying your submitted work.
Cheating will not be tolerated. If you are unsure whether a given activity would constitute cheating, ask the instructor. Violations of the Academic Honesty Policy can result in an NR for the course, and violators will be subject to the procedures outlined in section 5 of the WPI Judicial Policy.
Note: the instructor reserves the right to change the order of topics
or the dates of the exams, if necessary.
|Week||Reading||Topics||Assignments, Extra Notes|
|Oct 26 - 29||Chapters 1, 2 (Patt)
Chapter 1, Appendix A, B (Tannenbaum)
Representations of signed integers
Floating point representation
Lecture 1 objectives
Lecture 2 objectives
Lecture 3 objectives
Homework 1 (due: Tuesday, 11/2)
|Nov 1 - Nov 5||Chapter 3 (Patt)
Chapter 3 (Tanenbaum)
Performance improvements I - cache
Lecture 4 objectives
Lecture 5 objectives
Lecture 6 objectives
Lecture 7 objectives
Sequential circuit animation
Homework 2 (due: Tuesday, 11/9)
|Nov 8 - 12||Chapter 4, 5 (Patt)||
Instruction execution cycle
Machine code instructions
Microarchitecture of the LC-3
LC-3 ISA - operate instructions
LC-3 ISA - data movement instructions
LC-3 ISA - control instructions
Lecture 8 objectives
Lecture 9 objectives
Lecture 10 objectives
Lecture 11 objectives
Lab 1, Wed 11/10
Homework 3, Part 1 (due: Tuesday, November 16)
|Nov 15 - 19||Chapter 6, 7.1 - 7.2 (Patt)||
LC-3 ISA - control instructions, cont.
Performance improvements II - pipelining
Assembly Language and pseudo-ops
Lecture 12 objectives
Lecture 13 objectives
Lecture 14 - Exam 1, Thursday, November 18
Lecture 15 objectives
Sample Exam 1 (pdf file)
Homework 3, Part 2 (due: Tuesday, Nov 23)
Lab 2, Wed 11/17
|Nov 22 - 23||Chapter 7.3 - 7.4, 8.1 - 8.4 (Patt)||
Lecture 16 objectives
Lecture 17 objectives
Homework 4 (due: Tuesday, 12/7)
|Nov 29 - Dec 3||Chapter 9, 10, 14.3 (Patt)
Chapter 7.3, 7.4 (Tanenbaum)
The assembly process
External assembly, linking
Lecture 19 objectives
Lecture 20 objectives
Lecture 21 objectives
Program used to illustrate trap processing
Recursion - example
Lab 3 Wed, Dec 1
|Dec 6 - 10||Chapter 8.5, Appendix B (Patt)
Appendix C (C.1 - C.4) (Tanenbaum)
Introduction to interrupts
Intel 8088 processor
Intel 8088 addressing
Intel 8088 instruction set
Lecture 22 objectives
Lecture 23 objectives
Lecture 24 objectives
Lecture 25 objectives
Homework 5 (due: Tuesday, 12/14)
Lab 4 Wednesday, Dec 8
|Dec 13 - 16||Appendix B||Intel 8088 stack, activation records||
Lecture 26 objectives
Lecture 27 - Exam review/catch up
Lab 5(Wednesday, December 15)
Lecture 28 - Exam 2, Thursday, December 16
Sample Exam 2 (pdf)