Home

FINAL EXAM (Tuesday, December 12, 12pm - 3pm)
  • Material covered:  All lectures (and associated readings), labs, and homework.  However, there will be greater emphasis on post-midterm material (Lectures 9-16 and Problem Sets 4-5).
    • Lectures 15 and 16:   A good understanding of the basic lecture material covered in class would suffice; do not expect very detailed questions on these topics.
  • Open-book, open-notes, calculator allowed
  • Laptop allowed for accessing Sakai, class website, course materials, and basic (handheld) calculator functions; no other internet access allowed
  • No use of MIPS/MARS simulators
  • NOTE:  The exam involves entering responses in Sakai.  So, laptop with wifi is required.
  • Some sample questions.   Here are solutions, which will be discussed in the review session on Sunday.  These are some questions from past exams for guidance only.
MIDTERM (Monday, October 16)
  • Material covered:  Lecture 1-8, associated readings, Problem Sets 1-3, and Labs 1-5.  Only Slides 1-22 of Lecture 8 are covered.
  • 75 minutes in duration, multiple-choice and short-answer questions
  • Open-book, open-notes, calculator allowed
  • Laptop allowed for accessing Sakai, class website, course materials, and basic (handheld) calculator functions; no other internet access allowed
  • No use of MIPS/MARS simulators
  • NOTE:  The exam involves entering responses in Sakai.  So, laptop with wifi is required.
  • Sample Exam Questions and their solutions are available on Sakai
  • Statistics (total score=40):  mean=26.8 / std-dev=8.6 / max=39.5 / 90%ile=36.6 / 75%ile=32.9 / median=28.0 / 25%ile=21.8.

QUIZZES

  1. Friday, Sep 1, in lab session
    • Material covered:  Lecture 1, Lecture 2 (slides #1-32), and associated lecture readings
  2. Friday, Sep 8, in lab session
    • Material covered:  Lecture 2, Lecture 3 (whatever covered on Sep 6), and associated lecture readings.
  3. Friday, Sep 15, in lab session
    • Material covered:  Lecture 3 (full) and Lecture 4 (slides #1-12), and associated lecture readings.
  4. Friday, Sep 29, in lab session
    • Material covered:  Lectures 4-5, and associated lecture readings.
  5. Friday, Oct 6, in lab session
    • Material covered:  Lectures 5-7 (until slide 11 of Lecture 7), and associated lecture readings.
  6. Friday, Oct 27, in lab session
    • Material covered:  Lecture 8 (full), and associated lecture readings.
  7. Friday, Nov 3, in lab session
    • Material covered:  Lecture 9 (full) only, and associated lecture readings.
  8. Friday, Nov 10, in lab session
    • Material covered:  Lectures 9, 10 and 11, and associated lecture readings.
  9. Friday, Nov 17, do it at home by Monday's class
    • Material covered:  Lecture 12, and associated lecture readings.
  10. Friday, Dec 1, in lab session
    • Material covered:  Lectures 13 and 14, and associated lecture readings.
    • Open-book, open-notes, calculator allowed.
    • Laptop allowed for accessing class website, course materials, and basic (handheld) calculator functions; no other internet access allowed.
    • ~25 minutes duration.  Multiple-choice/short answers.
    • Go to Sakai and look under Tests & Quizzes.
    • This is the last quiz.

HOMEWORK

  1. Performance and Trends (due Fri Sep 22, 11:55 pm) [available on Sakai]
  2. Representing Information (due Mon Oct 2, 11:55pm) [available on Sakai]
  3. Assembly Language (due Wed Oct 11, 11:55pm) [available on Sakai]
  4. Logic Circuits (due Fri Nov 17, 11:55pm) [available on Sakai]
    • Note:  There are two parts.  Part 1 appears under “Assignments”, and involves drawing circuit diagrams using a web-based tool.  Part 2 appears under “Tests & Quizzes”, and involves short-answer questions.
  5. Floating-Point, Sequential Logic and Architecture (due Wed Dec 6, 11:55pm) [available on Sakai]

LABS

  1. UNIX Tutorial, and Editing, Compiling and Running C Programs (Sep 1)
  2. Arithmetic, I/O, and Conditionals and Loops in C (Sep 8)
  3. Arrays and Functions in C (Sep 15)
  4. Strings and Pointers in C (Sep 22)
  5. Maze Finding in C (Sep 29)
  6. Basic MIPS Assembly (Oct 18)
  7. More MIPS: Assembling Pictures (Oct 27)
  8. String Processing, Procedure Calls and Recursion (Nov 3)
  9. Logical Shifts (Nov 10)
    • Assignment
    • NOTE:  The exercises only need logical and shift operations!  This assignment is shorter than usual, and is due on Wednesday, not Friday.
  10. Lab X (mini-project)
    • Assignment
    • EXTRA CREDIT:  You may choose to do more than one exercise in this assignment for extra credit, by the same due date of December 1.  The problem with the highest score will count towards your assignment score.  If you submit work on more than one problem, the additional one(s) will count towards extra credit.  For the extra credit problems, there is no partial credit; you should submit only if your programs completely pass the self check.
  11. Review Istvan’s tutorial on the MIPS Computer (Dec 1)
    • No more lab assignments.

 

LECTURES

  1. Introduction (Aug 23, 25)
    • Reading:  Ch. 1.1-1.4
  2. Performance and Trends  (Aug 25-30)
    • Reading:  Ch. 1.5-1.7
  3. Representing Information (Sep 6, 11)
    • Reading:  Ch. 2.3-2.4, Ch. 3.5 (till p. 202 only)
  4. Instruction Sets – 1 (Sep 13, 18)
    • Reading:  Ch. 2.1-2.2 and Ch. 2.5-2.6
  5. Instruction Sets – 2 (Sep 20, 27)
    • Reading:  Ch. 2.1-2.7
  6. Assembly and Simulator (Oct 2)
    • Reading:  App. A.1-A.5 (Patterson/Hennessy Appendix)
    • Examples:  Sum.asm, SumArray.asm and Fibonacci.asm
    • Note:  Please be sure that the following are enabled in Mars, under Settings:  “Permit extended (pseudo) instructions and formats” is enabled, and Memory Configuration is set to be “Compact, Data at Address 0”
  7. Addressing Modes (Oct 4)
    • Reading:  Ch. 2.3, 2.10 and 2.14
  8. Procedures and Stacks (Oct 9, 11, 23)
    • Reading:  Ch. 2.8 and App. A.6
  9. Transistors and Logic – 1 (Oct 25, 30)
    • Reading:  App. B.1-B.3
  10. Transistors and Logic – 2 (Nov 1)
    • Reading:  App. B.1-B.3
  11. Arithmetic and Logic Circuits (Nov 6)
    • Reading:  Ch. 3.1-3.2 and App. B.5
    • Skim:  App. B.6
  12. Multiplication, Division and Floating-Point Numbers (Nov 8)
    • Reading:  Ch. 3.3-3.5
  13. Memories and State Machines (Nov 15)
    • Reading:  App. B.7-B.12 and Ch. 4.2
  14. Let’s Build a Computer (Nov 20, 27, 29)
  15. Memory Hierarchy and Caches: An Overview (Dec 4)
    • Reading:  Ch. 5.1-5.3
  16. Pipelining:  An Overview (Dec 6)
    • Reading:  Ch. 4.5-4.8
  17. Wrap Up (Dec 6)

Fall 2017 Course Website