ECE 2030: Introduction to Computer Engineering

Here is a link to the General Class Web Pages. Be sure to look here for many interesting and useful things!

SUPPLEMENTARY SAMPLE PROBLEMS:

  • Sample Instruction Format Problems
  • Sample Instruction Format Solutions
  • Sample Assembly Language Problems
  • Sample Assembly Language Solutions
  • Another Sample Assembly Problem
  • Another Sample Assembly Solution

    COURSE DESCRIPTION: This course illuminates the of design and operation of digital computing systems using VLSI technology. Topics include: function definition, switch and wire design, boolean functions, combinational logic, memory, state machines, sequential logic, digital arithmetic, microarchitecture, instruction sets, controller, assemble language.

    PREREQUISITES: CS 1321 Introduction to Computing

    TEXT: Logic and Computer Design Fundamentals, M. Mano and C. Kime, supplemented with class notes

    IN-CLASS EXAMS: There are three one-hour 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 cover in the class thus far.) Each in-class exam contributes 20% of the overall grade.

    FINAL EXAM: The final exam covers all material cover in the class. It is a closed-book, closed-note exam and calculators are not allowed. The final exam contributes 40% 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.

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

    Total points = .60 (in-class exam average) + .40 (final)

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

    ACADEMIC HONESTY: Although students are strongly encouraged to work together to learn the course material, all students are expected to complete exams and graded homework individually. 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.

    EXTRAS: A schedule of lectures can be found here . A shift register timing diagram can be found here. The datapath and microcode worksheet can be found here and here .

    LOCATION: Klaus 2456
    INSTRUCTOR: Scott Wills
    OFFICE: Klaus 3312
    PHONE: (404) 894-7469
    E-MAIL: scott.wills@ece.gatech.edu
    OFFICE HOURS: by appointment

    TENTATIVE EXAM SCHEDULE:
    Exam1: Wednesday, 19 September 2007
    Exam2: Wednesday, 24 October 2007
    Exam3: Wednesday, 28 November 2007
    Final Exam: Tuesday, 11 December 2007, 2:50 - 5:40 a.m.
    check the Registrar website for changes to the final exam schedule.

    Click here

    Questions and comments to Scott Wills
    last revised on 2 December 2007.