Computer Organization and Architecture (COSC 245)

Fall, 1998

www.central.edu/homepages/fyfes/courses/coa/



REQUIRED TEXTS:

Computer Organization, Fourth Edition by Hamacher, Vranesic, and Zaky. McGraw Hill Publishing Co.


INSTRUCTOR: Stephen Fyfe OFFICE: Central Hall 312
BOX # 039 PHONE: 5305
HOME 628-9955
EMAIL: fyfes@central.edu
OFFICE HOURS: MWF 9:00 - 10:00
T/Th 10:00 - 11:00
MTWRF 2:00 - 3:00
Other times by appointment, or just stop in

COURSE DESCRIPTION: This course is a study of the internal organization and design of computing devices. The machine will be examined at different levels such as digital logic, microprogramming, conventional machine and assembly language. Advanced architectures such as RISC and parallel machines will be explored. The course will include an examination of the components of a computer system such as the CPU, busses, internal memory, external memory and I/O devices, and how they all work together to form a functioning computer system.


COURSE OBJECTIVES: The objectives for this course include:


COURSE PROCEDURES: This course will utilize lecture, discussion and hands-on lab work as the main tools for presenting the course material. Students will be expected to read the text, and be prepared to discuss the readings and the assignments in class. Homework assignments will generally take the form of problems from the text book or assembler programming projects. Students will also be expected to write and present brief summaries over parts of the course material. This will generally take the form of studying a problem from the book or given by the instructor and writing a summary which explains the problem and gives a possible solution.


PROBLEM SUMMARIES: The problem summaries that students will give in class will likely be brief (5 - 10 minutes) explanations of some problem related to the current class topic or a presentation on some aspect of the topic that will not be presented by the instructor. Students will be graded on their understanding of the topic, how completely they cover the topic, the correctness of their solution (if applicable), and the clarity of their presentation. A goal of these presentations is to give students an opportunity to speak about computer science before an audience. However, it is recognized that some students are better presenters than others. Although it is not required, students may submit written work that demonstrates their understanding of all aspects of the topic, if they feel their presentation does not show this.


GRADING PROCEDURES: Students will be evaluated on their understanding of the concepts being covered in class, and their ability to apply those concepts in homework problems and other projects.

The final grade will be determined by the following distribution:

2 Problem Summaries10%
Homework and Programming Problems40%
4 Tests40%
Final Exam10%

and the following TENTATIVE scale will be used to determine the final grade

94 - 100A70 - 74C
90 - 93A-67 - 69C-
87 - 89B+62 - 66D+
83 - 86B58 - 61D
80 - 82B-55 - 57D-
75 - 79C+00 - 54F

Written homework will be due by 5:00 pm on the day they are due. Late homework will be accepted, but will lose points at the discretion of the instructor.

Problem summaries will be due by classtime on the day when the student is expected to give their presentation.


COURSE SCHEDULE: The following is a TENTATIVE schedule of topics for each week. Changes may be made during the semester as needed.

Week TopicChapter/Homework
1 Introduction and Overview
Digital Logic and Logic Circuits
Chapter 1 and Appendix A
2 Digital Logic and Logic Circuits Appendix A
3 Digital Logic and Logic Circuits Appendix A
4 Machine Instructions and Assembler Programming
TEST I
Chapter 2
5 Addressing Modes Chapter 2
Simple Pentium program
6 Stacks and Queues
Subroutines
Chapter 2
7 Pentium vs. PowerPC instruction sets Chapter 2
8 CPU Organization and Instruction Execution
TEST II
Chapter 3
9 Microprogramming Chapter 3
10 I/O organization Chapter 4
11 Memory Chapter 5
12 Computer Arithmetic
TEST III
Chapter 6
13 Computer Arithmetic
Pipelining
Chapter 6 and 7
14 Pipelining Chapter 7
15 CISC vs RISC vs Stack architectures
Large Computer Systems
Chapter 8 and 10
16 Large Computer Systems
Final Exam
Chapter 10