Here's a link to the General Class Web Site for readings, sample problems, lecture examples, and other helpful information.

DESCRIPTION: This course presents a functional introduction to execution and storage mechanisms used to support high-level programming languages and operating systems. This design-oriented course describes how complex mechanisms are created using operations and storage defined in an instruction set architecture. Assembly language examples illustrate key course concepts. Lecture material is reinforced by design projects that implement HLL code fragments using assembly language.

PREREQUISITES: ECE 2030, CS 1372

TEXTBOOK: Patt and Patel, Introduction to Computing Systems, 2^nd edition, 2004.

IN-CLASS EXAMS: There are three in-class exams. They are closed-book, closed-note. Calculators are not allowed on the exams. Each exam focuses on the material covered since the last exam. However, due to the cumulative nature of the material, all exams are comprehensive (i.e., they may draw on all material covered in the class thus far.) Each in-class exam contributes 15% of the overall grade.

FINAL EXAM: The final exam covers all material covered in the class. It is a closed-book, closed-note exam and calculators are not allowed. The final exam contributes 25% of the overall grade.

MISSED EXAM POLICY: Exams are taken at the scheduled class time or at the scheduled final period. A missed exam will be recorded as a zero. Family emergencies and extreme medical emergencies are handled specially.

PROJECTS: There are two projects. The projects are to be completed and submitted individually. The total project grade contributes 30% of the overall class grade.

GRADING: The final grades are determined based on totals earned during the class.

Total points = .45 (in-class exam average) + .30 (project grade) + .25 (final)

Grades are assigned as follows (assuming a passing project average): [90-100] = A, [80-90) = B, [70-80) = C, [60-70) = D, [0-60) = F.

ACADEMIC HONESTY: Although students are encouraged to work together to learn the course material, graded class work must be completed individually. Specifically, while you are permitted to discuss the project assignments and algorithms with other students in the class, you must design, write, and debug your solutions individually. You should not share code, debug code, or discuss its performance with anyone. Once you begin implementing your solution, you must work alone.

All exams are to be completed individually with no collaboration or interaction during the exam period.

All conduct in this course will be governed by the Georgia Tech honor code. Additionally, it is expected that students will respect their peers and the instructor such that no one takes unfair advantage of anyone else associated with the course. Any suspected cases of academic dishonesty will be reported to the Dean of Students for further action.

ATTENDANCE: Since class lectures include material that is not included in the book, class attendance is required. If a class is missed, a student should make arrangements to get notes from other students. The importance of regular class attendance and good note taking cannot be understated.

HEALTH POLICY: It is extremely important that everyone try to avoid spreading germs and sharing illnesses with others during the semester. If you are sick, please communicate with the professors, GTAs, and fellow students through email or telephone rather than in person.