EECS 370 - Introduction to Computer Organization
Section: 001
Term: WN 2009
Subject: Electrical Engineering and Computer Science (EECS)
Department: CoE Electrical Engineering and Computer Science
Credits:
4
Requirements & Distribution:
BS
Enforced Prerequisites:
EECS 203 or 270 with a grade of at least C; and EECS 280 or 283 with a grade of at least C.
Other Course Info:
F, W.
BS:
This course counts toward the 60 credits of math/science required for a Bachelor of Science degree.
Repeatability:
May not be repeated for credit.
Primary Instructor:

This course is intended to give you a basic understanding of how computers execute programs. Understanding computers means understanding the hardware/software process of how you and the computer work together to have the computer carry out a task. In your introductory programming courses (e.g. EECS 280), you learned how to express a task in terms of a high-level programming language such as C/C++. In EECS 370, you will see how a low-level language is executed by the hardware, and you will see how to put together basic hardware building blocks to form the functional units of a computer.

To achieve these goals, you will design and "build" simple computers at various levels of detail. In this course, building will not mean connecting chips and gates. Rather, you will describe the hardware in diagrams, finite-state machines, and hardware simulators (written in C). To further your understanding of other topics, we will provide practice questions that will be discussed in the discussion sections.

Prerequisites
Students must have taken EECS 280. From that course they should have learned and be comfortable with programming C++ on Unix. A brief overview of C vs. C++ will occur during the first discussion section of the semester. Also you can go to GSI office hours for additional help.

Course Material
The required text for the course is Computer Organization and Design: The Hardware/Software Interface (3rd Edition OR 3rd Edition Revised), by Patterson and Hennessy. Either version of the book is acceptable; the only difference is the partition of material between the book and CD. The lecture notes are posted on the course web page.

Class Projects
Four projects will be assigned during the term, each of which will require a substantial time commitment on your part. Many students find the work load in this course to be heavy.

Exams
There will be three exams this semester. You are expected to take the exams at the scheduled times. If you do not take an exam without verifying a documented medical or personal emergency which causes you to miss an exam, you will receive a zero for that exam. If you anticipate conflicts with the exam time, talk to the instructor at least 1 month before the exam date. The exam dates are given near the beginning of the semester so you can avoid scheduling job interviews or other commitments on exam days. Outside commitments are not considered a valid reason for missing an exam.

Homework
There will be 7 homework assignments during the semester. Homeworks must have your U of M uniqname on them, be stapled (no paperclips or dog-ears), and be turned-in on time, otherwise no credit will be given. You may not post homework answers on the newsgroup or place them in any other public forum (a webpage for example.) or share them with others. We will only take into consideration your best 6 homework grades in computing your final grade for the class. Note that homeworks constitute a very small factor in your final grade, their main purpose is to help you in getting trained for the type of questions that you find in the course exams.

Grading policy
Final grades will be based on the total points earned on homeworks, projects and exams. Factors such as class participation may be used to adjust your final grade, especially if it falls on a borderline. The tentative point breakdown is as follows:

  • Projects 10% each = 40%
  • Homeworks (7 assignments) = 5%
  • Exams 2 midterms, 15% each, 1 final 25% = 55%

Incompletes will generally not be given. According to university policy, doing poorly in a course is not a valid reason for an incomplete. If you are having problems in the course, your best bet is to come talk to the instructor as soon as you are aware of them.

Computers
You may use any Linux workstation that runs gcc. However, we will only support problems which occur on a CAEN machine.If you are not an engineering student (or declared CS-major), we recommend you to get a CAEN account. The autograder should work for submissions ITCS Linux workstations, but we cannot guarantee this.

EECS 370 - Introduction to Computer Organization
Schedule Listing
001 (LEC)
 
10808
Open
27
 
-
TuTh 9:00AM - 10:30AM
Note: STUDENTS ELECTING DIS 011-012 WILL BE AUTO-ENROLLED IN LECTURE 001.
002 (LEC)
 
10809
Open
3
 
-
TuTh 12:00PM - 1:30PM
Note: STUDENTS ELECTING DIS 021-022 WILL BE AUTO-ENROLLED IN LECTURE 002.
011 (DIS)
P
20802
Open
3
 
-
Tu 11:00AM - 12:00PM
012 (DIS)
P
10810
Open
1
 
-
Tu 1:30PM - 2:30PM
013 (DIS)
P
10811
Open
10
 
-
Th 3:30PM - 4:30PM
014 (DIS)
P
10812
Open
2
 
-
Th 1:30PM - 2:30PM
015 (DIS)
P
18748
Closed
0
 
-
F 3:30PM - 4:30PM
NOTE: Data maintained by department in Wolverine Access. If no textbooks are listed below, check with the department.


Computer Organization and Design,4th,Pattenson & Hennessy, ISBN 0-12-374493-8
Required
Syllabi are available to current LSA students. IMPORTANT: These syllabi are provided to give students a general idea about the courses, as offered by LSA departments and programs in prior academic terms. The syllabi do not necessarily reflect the assignments, sequence of course materials, and/or course expectations that the faculty and departments/programs have for these same courses in the current and/or future terms.

No Syllabi are on file for EECS 370. Click the button below to search for a different syllabus (UM login required)

Search for Syllabus
The CourseProfile (ART) system, supported by the U-M Provost’s 3rd Century Initiative through a grant to the Digital Innovation Greenhouse, provides additional information about: course enrollments; academic terms and instructors; student academic profiles (school/college, majors), and previous, concurrent, and subsequent course enrollments.

CourseProfile (ART)