ECE 2030b: Introduction to Computer Engineering

Dr. John A. Copeland

Fall 2002

Schedule       Supplement Reading       Slides        HW Files         Q&A      2001

Quiz Answers (2001 & 2002)


HW-1 due Friday Sept.6, answers pdf file.

HW-2 due Friday Sept. 13, answers pdf file.

HW-3 due Wed. Sept. 18, answers pdf file.

HW-4 due Wed. Oct. 7, answers pdf file.

HW-5 due Mon. Oct 21 - answers pdf file.

HW-6 due Mon. Nov. 4 - text or HTML

HW-7 due Mon. Nov. 11 - pdf file

HW-8 due Wed. Dec. 5 - pdf file


The 2030 Help Lab is open in Van Leer C-448f every afternoon Mon.-Fri. (schedule of GTA's, scroll down to bottom).

Year 2001 homework problems directory.

You can find additional study material and solutions to some textbook problems at http://cwx.prenhall.com/bookbind/pubbooks/mano/chapter0/deluxe.html

Solutions for Chap. 4 - Sequential Circuits: ftp://ftp.prenhall.com/pub/esm/electrical_and_computer_engineering.s-045/mano/logic_computer_design_fund_2e/solutions/solu_ch4.pdf


Office Hours in GCATT 579: by appointment (404 894-5177, or copeland@ece.gatech.edu) or before or after class in Van Leer 449c.

Class Hours:  MWF from 9:05-9:55 a.m. in Van Leer 457

Text and Other Resources:

Course Prerequisites:  CS 1301

Course Website:  General web site for all sections of ECE2030
       http://www.ece.gatech.edu/academic/courses/ece2030/

Course Outline:  Time permitting, the basic outline that will be followed is located at
       http://www.ece.gatech.edu/academic/courses/ece2030/outline/index.html

Instructor's Home Page:
       http://www.csc.gatech.edu/~copeland/
 

Course Evaluation:

Assignments 20%
In-class exams 2x 25%
Final Exam 30%


Homework:  You may discuss homework with others to help understand the problems and material, but, are required to complete your own homework.  Homework is to be handed in at the beginning of the lecture on the given due date.  Late homework will not be accepted unless accompanied by a written explanation of why it is late, and even then may get half-credit.

Missed Exam Policy:  Exams are taken at the scheduled class times and the scheduled final period.  A missed exam will be recorded as a zero.  Family deaths and extreme medical emergencies are handled specially.

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.

Email:  All students are expected to read their email at least once a day during the week for various announcements and postings.

Academic Honesty:  All violations of the Georgia Tech Honor Code will be handled by referring the case directly to the Dean of Students for penalties.
 

Exams:

 
Exam # Date
Exam #1 see Schedule
Exam #2 see Schedule
Exam #3 none
Final Exam Friday, last period

Course Lecture Slides:

Note:  Lecture slides are "incomplete" in terms of required course material and are provided as a convenience to save some time during your note taking.  You are still required to attend lectures and take your own notes or make additional notes on the provided slides.  You will have difficulty in the course if you try to rely solely on the lecture slides without attending class regularly to obtain important explanations. Slides also available from this class Web site. There is a schedule and reading assignments for the "Chapters" below.
 
Chapter # Title Lecture Version Print Versions

1
Introduction slides 2pp

2
Switch Networks and Switch Design slides 2pp

3
Boolean Algebra slides 2pp

4
Gate Design slides 2pp

5
Number Systems and Arithmetic slides 2pp

6
Combinational Logic Building Blocks slides 2pp

7
Sequential Systems - Latches & Registers slides 2pp

8
Finite State Machines (FSM) slides 2pp

9
Register Blocks: Counters, Shift, and Rotate Registers slides 2pp

10
Memory Systems slides 2pp

11
Datapath Elements slides 2pp

12
Single Cycle Datapath Unit (DPU) slides 2pp

13
Instruction Set Architecture (ISA) slides 2pp

14
Program Control, Jumping, and Branching slides 2pp

15
Procedure Calls and Subroutines slides 2pp

Assignments:

 
Assignment Due Date Partial Solutions
Assignment #1 TBD Solutions
Assignment #2 TBD Solutions
Assignment #3 TBD Solutions
Assignment #4 TBD Solutions
Assignment #5 TBD Solutions
Assignment #6 TBD Solutions
Assignment #7 TBD Solutions

Interesting Links:

Online Digital Logic Simulator
Message to aliens - notice the binary counting for numbers used


Disclaimer:

This web page is supplied as an extra courtesy.  If any discrepancies exists between this web page and the material or discussions from class, then the material and discussions from class override what is given here.